/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-atomic/lamport.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 14:51:20,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 14:51:20,915 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:51:20,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 14:51:20,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 14:51:20,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 14:51:20,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 14:51:20,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 14:51:20,957 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 14:51:20,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 14:51:20,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 14:51:20,961 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 14:51:20,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 14:51:20,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 14:51:20,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 14:51:20,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 14:51:20,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 14:51:20,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 14:51:20,963 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 14:51:20,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 14:51:20,964 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 14:51:20,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 14:51:20,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 14:51:20,965 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 14:51:20,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 14:51:20,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:51:20,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 14:51:20,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 14:51:20,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 14:51:20,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 14:51:20,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 14:51:20,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 14:51:20,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 14:51:20,968 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:51:21,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 14:51:21,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 14:51:21,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 14:51:21,204 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 14:51:21,204 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 14:51:21,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/lamport.i [2023-12-09 14:51:22,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 14:51:22,567 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 14:51:22,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i [2023-12-09 14:51:22,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16216620f/d3d3d9df00ae463f8b44c806d83c1fec/FLAG61759239f [2023-12-09 14:51:22,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16216620f/d3d3d9df00ae463f8b44c806d83c1fec [2023-12-09 14:51:22,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 14:51:22,608 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 14:51:22,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 14:51:22,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 14:51:22,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 14:51:22,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:51:22" (1/1) ... [2023-12-09 14:51:22,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc4e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:22, skipping insertion in model container [2023-12-09 14:51:22,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:51:22" (1/1) ... [2023-12-09 14:51:22,666 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 14:51:22,931 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-atomic/lamport.i[32156,32169] [2023-12-09 14:51:22,940 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-atomic/lamport.i[34083,34096] [2023-12-09 14:51:22,949 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:51:22,963 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 14:51:22,996 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-atomic/lamport.i[32156,32169] [2023-12-09 14:51:23,006 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-atomic/lamport.i[34083,34096] [2023-12-09 14:51:23,009 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:51:23,029 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 14:51:23,029 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 14:51:23,034 INFO L206 MainTranslator]: Completed translation [2023-12-09 14:51:23,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:23 WrapperNode [2023-12-09 14:51:23,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 14:51:23,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 14:51:23,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 14:51:23,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 14:51:23,041 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:51:23" (1/1) ... [2023-12-09 14:51:23,055 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:51:23" (1/1) ... [2023-12-09 14:51:23,073 INFO L138 Inliner]: procedures = 170, calls = 82, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2023-12-09 14:51:23,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 14:51:23,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 14:51:23,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 14:51:23,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 14:51:23,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:23" (1/1) ... [2023-12-09 14:51:23,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:23" (1/1) ... [2023-12-09 14:51:23,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:23" (1/1) ... [2023-12-09 14:51:23,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:23" (1/1) ... [2023-12-09 14:51:23,095 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:23" (1/1) ... [2023-12-09 14:51:23,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:23" (1/1) ... [2023-12-09 14:51:23,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:23" (1/1) ... [2023-12-09 14:51:23,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:23" (1/1) ... [2023-12-09 14:51:23,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 14:51:23,104 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 14:51:23,104 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 14:51:23,104 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 14:51:23,105 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:23" (1/1) ... [2023-12-09 14:51:23,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:51:23,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:23,138 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:51:23,142 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:51:23,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 14:51:23,160 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-12-09 14:51:23,160 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-12-09 14:51:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-09 14:51:23,161 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-09 14:51:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 14:51:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 14:51:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 14:51:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 14:51:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 14:51:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 14:51:23,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 14:51:23,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 14:51:23,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 14:51:23,163 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:51:23,318 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 14:51:23,321 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 14:51:23,589 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 14:51:23,599 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 14:51:23,599 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-12-09 14:51:23,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:51:23 BoogieIcfgContainer [2023-12-09 14:51:23,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 14:51:23,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 14:51:23,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 14:51:23,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 14:51:23,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:51:22" (1/3) ... [2023-12-09 14:51:23,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598f48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:51:23, skipping insertion in model container [2023-12-09 14:51:23,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:23" (2/3) ... [2023-12-09 14:51:23,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598f48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:51:23, skipping insertion in model container [2023-12-09 14:51:23,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:51:23" (3/3) ... [2023-12-09 14:51:23,615 INFO L112 eAbstractionObserver]: Analyzing ICFG lamport.i [2023-12-09 14:51:23,630 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 14:51:23,630 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-09 14:51:23,630 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 14:51:23,696 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-09 14:51:23,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 131 transitions, 276 flow [2023-12-09 14:51:23,802 INFO L124 PetriNetUnfolderBase]: 24/129 cut-off events. [2023-12-09 14:51:23,803 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 14:51:23,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 129 events. 24/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 264 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 99. Up to 5 conditions per place. [2023-12-09 14:51:23,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 131 transitions, 276 flow [2023-12-09 14:51:23,819 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 119 transitions, 247 flow [2023-12-09 14:51:23,838 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:51:23,846 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;@6a0258d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:51:23,846 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-09 14:51:23,865 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:51:23,866 INFO L124 PetriNetUnfolderBase]: 2/36 cut-off events. [2023-12-09 14:51:23,866 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:51:23,866 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:23,867 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:23,868 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-09 14:51:23,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:23,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1569203657, now seen corresponding path program 1 times [2023-12-09 14:51:23,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:23,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023349772] [2023-12-09 14:51:23,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:23,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:24,092 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:51:24,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:24,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023349772] [2023-12-09 14:51:24,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023349772] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:24,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:24,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:51:24,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408853804] [2023-12-09 14:51:24,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:24,103 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-09 14:51:24,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:24,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-09 14:51:24,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-09 14:51:24,143 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 131 [2023-12-09 14:51:24,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 119 transitions, 247 flow. Second operand has 2 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 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:51:24,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:24,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 131 [2023-12-09 14:51:24,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:24,197 INFO L124 PetriNetUnfolderBase]: 12/107 cut-off events. [2023-12-09 14:51:24,197 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2023-12-09 14:51:24,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 107 events. 12/107 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 210 event pairs, 0 based on Foata normal form. 20/113 useless extension candidates. Maximal degree in co-relation 88. Up to 4 conditions per place. [2023-12-09 14:51:24,200 INFO L140 encePairwiseOnDemand]: 119/131 looper letters, 3 selfloop transitions, 0 changer transitions 0/107 dead transitions. [2023-12-09 14:51:24,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 107 transitions, 229 flow [2023-12-09 14:51:24,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-09 14:51:24,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-12-09 14:51:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 245 transitions. [2023-12-09 14:51:24,212 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9351145038167938 [2023-12-09 14:51:24,213 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 245 transitions. [2023-12-09 14:51:24,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 245 transitions. [2023-12-09 14:51:24,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:24,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 245 transitions. [2023-12-09 14:51:24,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:51:24,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 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:51:24,222 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 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:51:24,226 INFO L308 CegarLoopForPetriNet]: 102 programPoint places, 1 predicate places. [2023-12-09 14:51:24,226 INFO L500 AbstractCegarLoop]: Abstraction has has 103 places, 107 transitions, 229 flow [2023-12-09 14:51:24,226 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 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:51:24,227 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:24,227 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:24,228 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 14:51:24,228 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-09 14:51:24,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:24,229 INFO L85 PathProgramCache]: Analyzing trace with hash 649522088, now seen corresponding path program 1 times [2023-12-09 14:51:24,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:24,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354586580] [2023-12-09 14:51:24,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:24,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:24,340 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:51:24,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:24,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354586580] [2023-12-09 14:51:24,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354586580] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:24,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:24,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:51:24,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095956512] [2023-12-09 14:51:24,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:24,342 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:51:24,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:24,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:51:24,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:51:24,344 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 131 [2023-12-09 14:51:24,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 107 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 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:51:24,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:24,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 131 [2023-12-09 14:51:24,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:24,432 INFO L124 PetriNetUnfolderBase]: 31/214 cut-off events. [2023-12-09 14:51:24,433 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-12-09 14:51:24,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 214 events. 31/214 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 751 event pairs, 4 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 212. Up to 24 conditions per place. [2023-12-09 14:51:24,439 INFO L140 encePairwiseOnDemand]: 126/131 looper letters, 11 selfloop transitions, 3 changer transitions 0/111 dead transitions. [2023-12-09 14:51:24,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 111 transitions, 270 flow [2023-12-09 14:51:24,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:51:24,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:51:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-12-09 14:51:24,446 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8651399491094147 [2023-12-09 14:51:24,446 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-12-09 14:51:24,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-12-09 14:51:24,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:24,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-12-09 14:51:24,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:51:24,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 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:51:24,452 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 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:51:24,453 INFO L308 CegarLoopForPetriNet]: 102 programPoint places, 3 predicate places. [2023-12-09 14:51:24,454 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 111 transitions, 270 flow [2023-12-09 14:51:24,454 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 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:51:24,455 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:24,455 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:24,455 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 14:51:24,455 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-09 14:51:24,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:24,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1382746169, now seen corresponding path program 1 times [2023-12-09 14:51:24,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:24,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185077788] [2023-12-09 14:51:24,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:24,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:24,570 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:51:24,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:24,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185077788] [2023-12-09 14:51:24,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185077788] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:24,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:24,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:51:24,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426240773] [2023-12-09 14:51:24,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:24,572 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:51:24,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:24,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:51:24,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:51:24,574 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 131 [2023-12-09 14:51:24,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 111 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 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:51:24,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:24,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 131 [2023-12-09 14:51:24,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:24,635 INFO L124 PetriNetUnfolderBase]: 25/195 cut-off events. [2023-12-09 14:51:24,635 INFO L125 PetriNetUnfolderBase]: For 77/87 co-relation queries the response was YES. [2023-12-09 14:51:24,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 195 events. 25/195 cut-off events. For 77/87 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 625 event pairs, 5 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 211. Up to 22 conditions per place. [2023-12-09 14:51:24,637 INFO L140 encePairwiseOnDemand]: 127/131 looper letters, 9 selfloop transitions, 2 changer transitions 1/109 dead transitions. [2023-12-09 14:51:24,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 109 transitions, 286 flow [2023-12-09 14:51:24,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:51:24,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:51:24,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2023-12-09 14:51:24,640 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8600508905852418 [2023-12-09 14:51:24,640 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 338 transitions. [2023-12-09 14:51:24,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 338 transitions. [2023-12-09 14:51:24,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:24,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 338 transitions. [2023-12-09 14:51:24,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 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:51:24,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 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:51:24,644 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 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:51:24,645 INFO L308 CegarLoopForPetriNet]: 102 programPoint places, 5 predicate places. [2023-12-09 14:51:24,645 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 109 transitions, 286 flow [2023-12-09 14:51:24,646 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 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:51:24,646 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:24,646 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:24,646 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 14:51:24,646 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-09 14:51:24,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:24,647 INFO L85 PathProgramCache]: Analyzing trace with hash -919469372, now seen corresponding path program 1 times [2023-12-09 14:51:24,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:24,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099959072] [2023-12-09 14:51:24,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:24,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:24,789 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:51:24,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:24,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099959072] [2023-12-09 14:51:24,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099959072] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:24,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:24,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 14:51:24,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274616022] [2023-12-09 14:51:24,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:24,791 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 14:51:24,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:24,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 14:51:24,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-09 14:51:24,793 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 131 [2023-12-09 14:51:24,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 109 transitions, 286 flow. Second operand has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:51:24,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:24,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 131 [2023-12-09 14:51:24,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:25,071 INFO L124 PetriNetUnfolderBase]: 438/1278 cut-off events. [2023-12-09 14:51:25,071 INFO L125 PetriNetUnfolderBase]: For 533/537 co-relation queries the response was YES. [2023-12-09 14:51:25,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2227 conditions, 1278 events. 438/1278 cut-off events. For 533/537 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8681 event pairs, 60 based on Foata normal form. 0/1114 useless extension candidates. Maximal degree in co-relation 1918. Up to 306 conditions per place. [2023-12-09 14:51:25,083 INFO L140 encePairwiseOnDemand]: 117/131 looper letters, 47 selfloop transitions, 5 changer transitions 27/159 dead transitions. [2023-12-09 14:51:25,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 159 transitions, 562 flow [2023-12-09 14:51:25,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 14:51:25,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 14:51:25,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2023-12-09 14:51:25,085 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8183206106870229 [2023-12-09 14:51:25,085 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 536 transitions. [2023-12-09 14:51:25,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 536 transitions. [2023-12-09 14:51:25,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:25,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 536 transitions. [2023-12-09 14:51:25,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 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:51:25,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 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:51:25,091 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 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:51:25,093 INFO L308 CegarLoopForPetriNet]: 102 programPoint places, 9 predicate places. [2023-12-09 14:51:25,093 INFO L500 AbstractCegarLoop]: Abstraction has has 111 places, 159 transitions, 562 flow [2023-12-09 14:51:25,094 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:51:25,094 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:25,094 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:25,094 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 14:51:25,095 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-09 14:51:25,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:25,095 INFO L85 PathProgramCache]: Analyzing trace with hash 575758142, now seen corresponding path program 2 times [2023-12-09 14:51:25,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:25,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318977247] [2023-12-09 14:51:25,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:25,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:25,174 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:51:25,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:25,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318977247] [2023-12-09 14:51:25,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318977247] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:25,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:25,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 14:51:25,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329528014] [2023-12-09 14:51:25,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:25,176 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 14:51:25,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:25,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 14:51:25,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-09 14:51:25,177 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 131 [2023-12-09 14:51:25,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 159 transitions, 562 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:51:25,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:25,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 131 [2023-12-09 14:51:25,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:25,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([416] L707-->L710: Formula: (= v_~x~0_4 1) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0][55], [136#true, 5#L846-4true, thr1Thread1of1ForFork1InUse, 124#true, thr2Thread1of1ForFork0InUse, 39#L780true, 122#(= ~X~0 0), 128#true, 109#L710true, 117#true]) [2023-12-09 14:51:25,478 INFO L294 olderBase$Statistics]: this new event has 65 ancestors and is cut-off event [2023-12-09 14:51:25,479 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-12-09 14:51:25,479 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-12-09 14:51:25,479 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-12-09 14:51:25,554 INFO L124 PetriNetUnfolderBase]: 1277/3620 cut-off events. [2023-12-09 14:51:25,554 INFO L125 PetriNetUnfolderBase]: For 2166/2190 co-relation queries the response was YES. [2023-12-09 14:51:25,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6698 conditions, 3620 events. 1277/3620 cut-off events. For 2166/2190 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 30132 event pairs, 175 based on Foata normal form. 0/3111 useless extension candidates. Maximal degree in co-relation 6462. Up to 982 conditions per place. [2023-12-09 14:51:25,584 INFO L140 encePairwiseOnDemand]: 127/131 looper letters, 23 selfloop transitions, 6 changer transitions 5/180 dead transitions. [2023-12-09 14:51:25,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 180 transitions, 738 flow [2023-12-09 14:51:25,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 14:51:25,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 14:51:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 568 transitions. [2023-12-09 14:51:25,586 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.867175572519084 [2023-12-09 14:51:25,586 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 568 transitions. [2023-12-09 14:51:25,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 568 transitions. [2023-12-09 14:51:25,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:25,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 568 transitions. [2023-12-09 14:51:25,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:51:25,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 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:51:25,590 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 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:51:25,592 INFO L308 CegarLoopForPetriNet]: 102 programPoint places, 13 predicate places. [2023-12-09 14:51:25,592 INFO L500 AbstractCegarLoop]: Abstraction has has 115 places, 180 transitions, 738 flow [2023-12-09 14:51:25,593 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:51:25,593 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:25,593 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:25,594 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 14:51:25,595 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-09 14:51:25,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:25,598 INFO L85 PathProgramCache]: Analyzing trace with hash -475048574, now seen corresponding path program 3 times [2023-12-09 14:51:25,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:25,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686848228] [2023-12-09 14:51:25,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:25,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:25,679 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:51:25,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:25,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686848228] [2023-12-09 14:51:25,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686848228] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:25,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:25,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 14:51:25,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621546443] [2023-12-09 14:51:25,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:25,680 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 14:51:25,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:25,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 14:51:25,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-09 14:51:25,681 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 131 [2023-12-09 14:51:25,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 180 transitions, 738 flow. Second operand has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:51:25,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:25,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 131 [2023-12-09 14:51:25,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:25,948 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([416] L707-->L710: Formula: (= v_~x~0_4 1) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0][56], [5#L846-4true, 136#true, thr1Thread1of1ForFork1InUse, thr2Thread1of1ForFork0InUse, 124#true, 143#true, 122#(= ~X~0 0), 39#L780true, 128#true, 109#L710true, 117#true]) [2023-12-09 14:51:25,948 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-12-09 14:51:25,948 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-12-09 14:51:25,948 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-12-09 14:51:25,948 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-12-09 14:51:26,485 INFO L124 PetriNetUnfolderBase]: 2211/6119 cut-off events. [2023-12-09 14:51:26,486 INFO L125 PetriNetUnfolderBase]: For 5273/5672 co-relation queries the response was YES. [2023-12-09 14:51:26,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14002 conditions, 6119 events. 2211/6119 cut-off events. For 5273/5672 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 55083 event pairs, 303 based on Foata normal form. 28/5202 useless extension candidates. Maximal degree in co-relation 13633. Up to 2037 conditions per place. [2023-12-09 14:51:26,521 INFO L140 encePairwiseOnDemand]: 117/131 looper letters, 68 selfloop transitions, 6 changer transitions 57/234 dead transitions. [2023-12-09 14:51:26,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 234 transitions, 1234 flow [2023-12-09 14:51:26,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 14:51:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 14:51:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2023-12-09 14:51:26,525 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.816793893129771 [2023-12-09 14:51:26,525 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 535 transitions. [2023-12-09 14:51:26,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 535 transitions. [2023-12-09 14:51:26,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:26,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 535 transitions. [2023-12-09 14:51:26,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 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:51:26,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 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:51:26,529 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 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:51:26,530 INFO L308 CegarLoopForPetriNet]: 102 programPoint places, 17 predicate places. [2023-12-09 14:51:26,530 INFO L500 AbstractCegarLoop]: Abstraction has has 119 places, 234 transitions, 1234 flow [2023-12-09 14:51:26,530 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:51:26,530 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:26,530 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:26,531 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 14:51:26,531 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-09 14:51:26,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:26,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2083021464, now seen corresponding path program 4 times [2023-12-09 14:51:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:26,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494127327] [2023-12-09 14:51:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:26,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:26,578 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:51:26,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:26,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494127327] [2023-12-09 14:51:26,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494127327] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:26,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:26,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 14:51:26,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350153754] [2023-12-09 14:51:26,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:26,580 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 14:51:26,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:26,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 14:51:26,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-09 14:51:26,581 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 131 [2023-12-09 14:51:26,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 234 transitions, 1234 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:51:26,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:26,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 131 [2023-12-09 14:51:26,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:26,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([416] L707-->L710: Formula: (= v_~x~0_4 1) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0][57], [5#L846-4true, 136#true, thr1Thread1of1ForFork1InUse, 124#true, thr2Thread1of1ForFork0InUse, 143#true, 122#(= ~X~0 0), 39#L780true, 128#true, 109#L710true, 117#true, 153#(= ~x~0 1)]) [2023-12-09 14:51:26,721 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-12-09 14:51:26,721 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-12-09 14:51:26,721 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-12-09 14:51:26,721 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-12-09 14:51:27,618 INFO L124 PetriNetUnfolderBase]: 3442/9497 cut-off events. [2023-12-09 14:51:27,619 INFO L125 PetriNetUnfolderBase]: For 10405/11050 co-relation queries the response was YES. [2023-12-09 14:51:27,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22712 conditions, 9497 events. 3442/9497 cut-off events. For 10405/11050 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 90325 event pairs, 461 based on Foata normal form. 50/8126 useless extension candidates. Maximal degree in co-relation 22296. Up to 2934 conditions per place. [2023-12-09 14:51:27,685 INFO L140 encePairwiseOnDemand]: 127/131 looper letters, 36 selfloop transitions, 11 changer transitions 60/266 dead transitions. [2023-12-09 14:51:27,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 266 transitions, 1637 flow [2023-12-09 14:51:27,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 14:51:27,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 14:51:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2023-12-09 14:51:27,687 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8702290076335878 [2023-12-09 14:51:27,687 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 570 transitions. [2023-12-09 14:51:27,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 570 transitions. [2023-12-09 14:51:27,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:27,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 570 transitions. [2023-12-09 14:51:27,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 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:51:27,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 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:51:27,692 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 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:51:27,693 INFO L308 CegarLoopForPetriNet]: 102 programPoint places, 21 predicate places. [2023-12-09 14:51:27,694 INFO L500 AbstractCegarLoop]: Abstraction has has 123 places, 266 transitions, 1637 flow [2023-12-09 14:51:27,694 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:51:27,694 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:27,694 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:27,694 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 14:51:27,694 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-09 14:51:27,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:27,695 INFO L85 PathProgramCache]: Analyzing trace with hash 412544957, now seen corresponding path program 1 times [2023-12-09 14:51:27,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:27,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240402076] [2023-12-09 14:51:27,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:27,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:27,780 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:51:27,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:27,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240402076] [2023-12-09 14:51:27,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240402076] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:27,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:27,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 14:51:27,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477535016] [2023-12-09 14:51:27,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:27,781 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 14:51:27,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:27,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 14:51:27,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-09 14:51:27,782 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 131 [2023-12-09 14:51:27,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 266 transitions, 1637 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 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:51:27,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:27,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 131 [2023-12-09 14:51:27,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:27,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([416] L707-->L710: Formula: (= v_~x~0_4 1) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0][58], [122#(= ~X~0 0), 109#L710true, 117#true, 153#(= ~x~0 1), 136#true, 5#L846-4true, thr1Thread1of1ForFork1InUse, thr2Thread1of1ForFork0InUse, 124#true, 143#true, 39#L780true, 160#(= ~b2~0 1), 128#true]) [2023-12-09 14:51:27,926 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-12-09 14:51:27,927 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-12-09 14:51:27,927 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-12-09 14:51:27,927 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-12-09 14:51:28,688 INFO L124 PetriNetUnfolderBase]: 2854/8066 cut-off events. [2023-12-09 14:51:28,688 INFO L125 PetriNetUnfolderBase]: For 14052/14562 co-relation queries the response was YES. [2023-12-09 14:51:28,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20636 conditions, 8066 events. 2854/8066 cut-off events. For 14052/14562 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 76631 event pairs, 407 based on Foata normal form. 19/6977 useless extension candidates. Maximal degree in co-relation 20152. Up to 2697 conditions per place. [2023-12-09 14:51:28,727 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 18 selfloop transitions, 7 changer transitions 113/293 dead transitions. [2023-12-09 14:51:28,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 293 transitions, 2155 flow [2023-12-09 14:51:28,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 14:51:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 14:51:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 556 transitions. [2023-12-09 14:51:28,730 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8488549618320611 [2023-12-09 14:51:28,730 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 556 transitions. [2023-12-09 14:51:28,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 556 transitions. [2023-12-09 14:51:28,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:28,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 556 transitions. [2023-12-09 14:51:28,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 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:51:28,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 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:51:28,733 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 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:51:28,735 INFO L308 CegarLoopForPetriNet]: 102 programPoint places, 25 predicate places. [2023-12-09 14:51:28,735 INFO L500 AbstractCegarLoop]: Abstraction has has 127 places, 293 transitions, 2155 flow [2023-12-09 14:51:28,735 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 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:51:28,736 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:28,736 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:28,736 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 14:51:28,736 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-09 14:51:28,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:28,736 INFO L85 PathProgramCache]: Analyzing trace with hash -177147397, now seen corresponding path program 1 times [2023-12-09 14:51:28,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:28,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927957195] [2023-12-09 14:51:28,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:28,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:28,818 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:51:28,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:28,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927957195] [2023-12-09 14:51:28,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927957195] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:28,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:28,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 14:51:28,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705456653] [2023-12-09 14:51:28,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:28,820 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 14:51:28,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:28,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 14:51:28,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-09 14:51:28,821 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 131 [2023-12-09 14:51:28,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 293 transitions, 2155 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 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:51:28,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:28,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 131 [2023-12-09 14:51:28,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:28,953 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([416] L707-->L710: Formula: (= v_~x~0_4 1) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0][61], [122#(= ~X~0 0), 109#L710true, 117#true, 153#(= ~x~0 1), 167#(= ~b1~0 1), 136#true, 5#L846-4true, thr1Thread1of1ForFork1InUse, thr2Thread1of1ForFork0InUse, 124#true, 143#true, 39#L780true, 160#(= ~b2~0 1), 128#true]) [2023-12-09 14:51:28,953 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-12-09 14:51:28,953 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-12-09 14:51:28,953 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-12-09 14:51:28,953 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-12-09 14:51:29,453 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([452] thr1EXIT-->L847-2: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem8#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thr1Thread1of1ForFork1_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_4, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_4, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][137], [20#L777true, 122#(= ~X~0 0), 47#L847-2true, 117#true, 153#(= ~x~0 1), thr1Thread1of1ForFork1NotInUse, 136#true, 124#true, thr2Thread1of1ForFork0InUse, 143#true, 160#(= ~b2~0 1), 165#true, 128#true]) [2023-12-09 14:51:29,453 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-12-09 14:51:29,454 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-12-09 14:51:29,454 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-12-09 14:51:29,454 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-12-09 14:51:29,502 INFO L124 PetriNetUnfolderBase]: 2241/6321 cut-off events. [2023-12-09 14:51:29,502 INFO L125 PetriNetUnfolderBase]: For 18779/19186 co-relation queries the response was YES. [2023-12-09 14:51:29,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17464 conditions, 6321 events. 2241/6321 cut-off events. For 18779/19186 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 58286 event pairs, 338 based on Foata normal form. 34/5508 useless extension candidates. Maximal degree in co-relation 16796. Up to 1933 conditions per place. [2023-12-09 14:51:29,546 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 0 selfloop transitions, 0 changer transitions 290/290 dead transitions. [2023-12-09 14:51:29,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 290 transitions, 2241 flow [2023-12-09 14:51:29,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 14:51:29,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 14:51:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 557 transitions. [2023-12-09 14:51:29,549 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.850381679389313 [2023-12-09 14:51:29,549 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 557 transitions. [2023-12-09 14:51:29,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 557 transitions. [2023-12-09 14:51:29,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:29,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 557 transitions. [2023-12-09 14:51:29,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 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:51:29,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 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:51:29,552 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 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:51:29,553 INFO L308 CegarLoopForPetriNet]: 102 programPoint places, 25 predicate places. [2023-12-09 14:51:29,553 INFO L500 AbstractCegarLoop]: Abstraction has has 127 places, 290 transitions, 2241 flow [2023-12-09 14:51:29,553 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 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:51:29,559 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/lamport.i_BEv2_AllErrorsAtOnce [2023-12-09 14:51:29,605 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-12-09 14:51:29,605 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-12-09 14:51:29,606 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-12-09 14:51:29,606 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-12-09 14:51:29,606 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-12-09 14:51:29,607 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-12-09 14:51:29,607 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 14:51:29,607 INFO L457 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-12-09 14:51:29,612 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 14:51:29,612 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 14:51:29,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:51:29 BasicIcfg [2023-12-09 14:51:29,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 14:51:29,623 INFO L158 Benchmark]: Toolchain (without parser) took 7014.18ms. Allocated memory was 187.7MB in the beginning and 933.2MB in the end (delta: 745.5MB). Free memory was 135.5MB in the beginning and 578.6MB in the end (delta: -443.1MB). Peak memory consumption was 313.6MB. Max. memory is 8.0GB. [2023-12-09 14:51:29,623 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 187.7MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 14:51:29,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.39ms. Allocated memory is still 187.7MB. Free memory was 135.5MB in the beginning and 114.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-09 14:51:29,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.47ms. Allocated memory is still 187.7MB. Free memory was 114.6MB in the beginning and 112.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 14:51:29,628 INFO L158 Benchmark]: Boogie Preprocessor took 28.96ms. Allocated memory is still 187.7MB. Free memory was 112.5MB in the beginning and 111.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-09 14:51:29,630 INFO L158 Benchmark]: RCFGBuilder took 496.69ms. Allocated memory was 187.7MB in the beginning and 283.1MB in the end (delta: 95.4MB). Free memory was 110.7MB in the beginning and 249.4MB in the end (delta: -138.7MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. [2023-12-09 14:51:29,630 INFO L158 Benchmark]: TraceAbstraction took 6013.57ms. Allocated memory was 283.1MB in the beginning and 933.2MB in the end (delta: 650.1MB). Free memory was 248.9MB in the beginning and 578.6MB in the end (delta: -329.7MB). Peak memory consumption was 330.9MB. Max. memory is 8.0GB. [2023-12-09 14:51:29,633 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 187.7MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 424.39ms. Allocated memory is still 187.7MB. Free memory was 135.5MB in the beginning and 114.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.47ms. Allocated memory is still 187.7MB. Free memory was 114.6MB in the beginning and 112.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.96ms. Allocated memory is still 187.7MB. Free memory was 112.5MB in the beginning and 111.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 496.69ms. Allocated memory was 187.7MB in the beginning and 283.1MB in the end (delta: 95.4MB). Free memory was 110.7MB in the beginning and 249.4MB in the end (delta: -138.7MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. * TraceAbstraction took 6013.57ms. Allocated memory was 283.1MB in the beginning and 933.2MB in the end (delta: 650.1MB). Free memory was 248.9MB in the beginning and 578.6MB in the end (delta: -329.7MB). Peak memory consumption was 330.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 834]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 764]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 176 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 210 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 357 IncrementalHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 142 mSDtfsCounter, 357 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2241occurred in iteration=9, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 400 NumberOfCodeBlocks, 400 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 391 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-09 14:51:29,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...