/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/weaver/chl-simpl-str-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:13:06,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:13:06,628 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 15:13:06,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:13:06,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:13:06,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:13:06,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:13:06,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:13:06,663 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:13:06,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:13:06,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:13:06,666 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:13:06,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:13:06,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:13:06,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:13:06,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:13:06,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:13:06,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:13:06,668 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:13:06,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:13:06,668 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:13:06,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:13:06,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:13:06,669 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:13:06,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:13:06,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:13:06,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:13:06,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:13:06,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:13:06,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:13:06,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:13:06,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:13:06,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:13:06,672 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 15:13:06,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:13:06,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:13:06,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:13:06,842 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:13:06,842 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:13:06,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2023-12-09 15:13:07,796 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:13:07,970 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:13:07,970 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2023-12-09 15:13:07,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb99da4bf/4342da6109094e60bb1f9d18a260a68b/FLAG1c9ffb102 [2023-12-09 15:13:08,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb99da4bf/4342da6109094e60bb1f9d18a260a68b [2023-12-09 15:13:08,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:13:08,387 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:13:08,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:13:08,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:13:08,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:13:08,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:13:08" (1/1) ... [2023-12-09 15:13:08,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca8065c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:13:08, skipping insertion in model container [2023-12-09 15:13:08,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:13:08" (1/1) ... [2023-12-09 15:13:08,415 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:13:08,561 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c[2553,2566] [2023-12-09 15:13:08,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:13:08,585 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:13:08,627 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c[2553,2566] [2023-12-09 15:13:08,628 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:13:08,642 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:13:08,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:13:08 WrapperNode [2023-12-09 15:13:08,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:13:08,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:13:08,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:13:08,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:13:08,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:13:08" (1/1) ... [2023-12-09 15:13:08,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:13:08" (1/1) ... [2023-12-09 15:13:08,705 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 171 [2023-12-09 15:13:08,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:13:08,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:13:08,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:13:08,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:13:08,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:13:08" (1/1) ... [2023-12-09 15:13:08,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:13:08" (1/1) ... [2023-12-09 15:13:08,733 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:13:08" (1/1) ... [2023-12-09 15:13:08,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:13:08" (1/1) ... [2023-12-09 15:13:08,737 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:13:08" (1/1) ... [2023-12-09 15:13:08,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:13:08" (1/1) ... [2023-12-09 15:13:08,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:13:08" (1/1) ... [2023-12-09 15:13:08,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:13:08" (1/1) ... [2023-12-09 15:13:08,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:13:08,754 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:13:08,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:13:08,754 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:13:08,754 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:13:08" (1/1) ... [2023-12-09 15:13:08,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:13:08,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:13:08,778 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 15:13:08,789 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 15:13:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:13:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:13:08,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:13:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:13:08,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:13:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:13:08,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:13:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:13:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:13:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:13:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:13:08,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:13:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:13:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:13:08,806 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 15:13:08,878 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:13:08,880 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:13:09,077 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:13:09,088 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:13:09,088 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-09 15:13:09,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:13:09 BoogieIcfgContainer [2023-12-09 15:13:09,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:13:09,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:13:09,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:13:09,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:13:09,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:13:08" (1/3) ... [2023-12-09 15:13:09,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6ce92d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:13:09, skipping insertion in model container [2023-12-09 15:13:09,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:13:08" (2/3) ... [2023-12-09 15:13:09,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6ce92d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:13:09, skipping insertion in model container [2023-12-09 15:13:09,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:13:09" (3/3) ... [2023-12-09 15:13:09,095 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2023-12-09 15:13:09,108 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:13:09,108 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:13:09,108 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:13:09,264 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:13:09,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 217 transitions, 455 flow [2023-12-09 15:13:09,376 INFO L124 PetriNetUnfolderBase]: 13/214 cut-off events. [2023-12-09 15:13:09,376 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:13:09,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 214 events. 13/214 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2023-12-09 15:13:09,394 INFO L82 GeneralOperation]: Start removeDead. Operand has 214 places, 217 transitions, 455 flow [2023-12-09 15:13:09,398 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 203 transitions, 424 flow [2023-12-09 15:13:09,404 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:13:09,409 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;@319e8689, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:13:09,409 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 15:13:09,442 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:13:09,442 INFO L124 PetriNetUnfolderBase]: 13/202 cut-off events. [2023-12-09 15:13:09,442 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:13:09,443 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:09,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:09,443 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:13:09,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:09,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1717441816, now seen corresponding path program 1 times [2023-12-09 15:13:09,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:09,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860716001] [2023-12-09 15:13:09,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:09,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:10,086 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 15:13:10,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:10,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860716001] [2023-12-09 15:13:10,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860716001] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:10,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:10,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:13:10,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158111999] [2023-12-09 15:13:10,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:10,095 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:13:10,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:10,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:13:10,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:13:10,132 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 217 [2023-12-09 15:13:10,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 203 transitions, 424 flow. Second operand has 8 states, 8 states have (on average 183.875) internal successors, (1471), 8 states have internal predecessors, (1471), 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 15:13:10,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:10,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 217 [2023-12-09 15:13:10,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:13:10,535 INFO L124 PetriNetUnfolderBase]: 220/1293 cut-off events. [2023-12-09 15:13:10,535 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-12-09 15:13:10,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 1293 events. 220/1293 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 10237 event pairs, 65 based on Foata normal form. 91/1258 useless extension candidates. Maximal degree in co-relation 1555. Up to 116 conditions per place. [2023-12-09 15:13:10,553 INFO L140 encePairwiseOnDemand]: 201/217 looper letters, 61 selfloop transitions, 8 changer transitions 9/246 dead transitions. [2023-12-09 15:13:10,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 246 transitions, 714 flow [2023-12-09 15:13:10,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-09 15:13:10,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-09 15:13:10,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2280 transitions. [2023-12-09 15:13:10,572 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8755760368663594 [2023-12-09 15:13:10,572 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2280 transitions. [2023-12-09 15:13:10,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2280 transitions. [2023-12-09 15:13:10,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:13:10,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2280 transitions. [2023-12-09 15:13:10,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 190.0) internal successors, (2280), 12 states have internal predecessors, (2280), 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 15:13:10,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 217.0) internal successors, (2821), 13 states have internal predecessors, (2821), 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 15:13:10,595 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 217.0) internal successors, (2821), 13 states have internal predecessors, (2821), 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 15:13:10,600 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 11 predicate places. [2023-12-09 15:13:10,601 INFO L500 AbstractCegarLoop]: Abstraction has has 211 places, 246 transitions, 714 flow [2023-12-09 15:13:10,602 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 183.875) internal successors, (1471), 8 states have internal predecessors, (1471), 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 15:13:10,602 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:10,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:10,602 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:13:10,602 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:13:10,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1513451416, now seen corresponding path program 2 times [2023-12-09 15:13:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:10,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837349163] [2023-12-09 15:13:10,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:10,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:10,978 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 15:13:10,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:10,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837349163] [2023-12-09 15:13:10,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837349163] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:10,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:10,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:13:10,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794572586] [2023-12-09 15:13:10,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:10,981 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:13:10,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:10,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:13:10,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:13:10,984 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 217 [2023-12-09 15:13:10,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 246 transitions, 714 flow. Second operand has 8 states, 8 states have (on average 182.75) internal successors, (1462), 8 states have internal predecessors, (1462), 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 15:13:10,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:10,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 217 [2023-12-09 15:13:10,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:13:11,820 INFO L124 PetriNetUnfolderBase]: 1221/5528 cut-off events. [2023-12-09 15:13:11,820 INFO L125 PetriNetUnfolderBase]: For 2211/2448 co-relation queries the response was YES. [2023-12-09 15:13:11,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8976 conditions, 5528 events. 1221/5528 cut-off events. For 2211/2448 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 61006 event pairs, 409 based on Foata normal form. 33/4904 useless extension candidates. Maximal degree in co-relation 8283. Up to 1009 conditions per place. [2023-12-09 15:13:11,899 INFO L140 encePairwiseOnDemand]: 205/217 looper letters, 128 selfloop transitions, 16 changer transitions 75/397 dead transitions. [2023-12-09 15:13:11,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 397 transitions, 1906 flow [2023-12-09 15:13:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-09 15:13:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-09 15:13:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2786 transitions. [2023-12-09 15:13:11,904 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8559139784946237 [2023-12-09 15:13:11,904 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2786 transitions. [2023-12-09 15:13:11,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2786 transitions. [2023-12-09 15:13:11,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:13:11,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2786 transitions. [2023-12-09 15:13:11,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 185.73333333333332) internal successors, (2786), 15 states have internal predecessors, (2786), 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 15:13:11,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 217.0) internal successors, (3472), 16 states have internal predecessors, (3472), 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 15:13:11,914 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 217.0) internal successors, (3472), 16 states have internal predecessors, (3472), 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 15:13:11,915 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 25 predicate places. [2023-12-09 15:13:11,915 INFO L500 AbstractCegarLoop]: Abstraction has has 225 places, 397 transitions, 1906 flow [2023-12-09 15:13:11,916 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 182.75) internal successors, (1462), 8 states have internal predecessors, (1462), 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 15:13:11,916 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:11,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:11,916 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:13:11,916 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:13:11,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:11,917 INFO L85 PathProgramCache]: Analyzing trace with hash -248686122, now seen corresponding path program 3 times [2023-12-09 15:13:11,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:11,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149661284] [2023-12-09 15:13:11,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:11,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:12,076 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 15:13:12,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:12,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149661284] [2023-12-09 15:13:12,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149661284] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:12,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:12,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:13:12,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317671820] [2023-12-09 15:13:12,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:12,078 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:13:12,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:12,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:13:12,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:13:12,081 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 217 [2023-12-09 15:13:12,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 397 transitions, 1906 flow. Second operand has 7 states, 7 states have (on average 184.28571428571428) internal successors, (1290), 7 states have internal predecessors, (1290), 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 15:13:12,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:12,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 217 [2023-12-09 15:13:12,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:13:13,076 INFO L124 PetriNetUnfolderBase]: 1597/6971 cut-off events. [2023-12-09 15:13:13,076 INFO L125 PetriNetUnfolderBase]: For 5784/7484 co-relation queries the response was YES. [2023-12-09 15:13:13,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13292 conditions, 6971 events. 1597/6971 cut-off events. For 5784/7484 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 75883 event pairs, 475 based on Foata normal form. 136/6291 useless extension candidates. Maximal degree in co-relation 10623. Up to 1303 conditions per place. [2023-12-09 15:13:13,127 INFO L140 encePairwiseOnDemand]: 200/217 looper letters, 182 selfloop transitions, 24 changer transitions 107/498 dead transitions. [2023-12-09 15:13:13,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 498 transitions, 3229 flow [2023-12-09 15:13:13,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:13:13,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:13:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1880 transitions. [2023-12-09 15:13:13,131 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8663594470046083 [2023-12-09 15:13:13,131 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1880 transitions. [2023-12-09 15:13:13,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1880 transitions. [2023-12-09 15:13:13,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:13:13,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1880 transitions. [2023-12-09 15:13:13,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 188.0) internal successors, (1880), 10 states have internal predecessors, (1880), 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 15:13:13,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 217.0) internal successors, (2387), 11 states have internal predecessors, (2387), 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 15:13:13,138 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 217.0) internal successors, (2387), 11 states have internal predecessors, (2387), 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 15:13:13,139 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 34 predicate places. [2023-12-09 15:13:13,139 INFO L500 AbstractCegarLoop]: Abstraction has has 234 places, 498 transitions, 3229 flow [2023-12-09 15:13:13,139 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 184.28571428571428) internal successors, (1290), 7 states have internal predecessors, (1290), 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 15:13:13,139 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:13,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:13,140 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:13:13,140 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:13:13,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:13,140 INFO L85 PathProgramCache]: Analyzing trace with hash 155791650, now seen corresponding path program 4 times [2023-12-09 15:13:13,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:13,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310222147] [2023-12-09 15:13:13,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:13,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:13,344 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 15:13:13,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:13,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310222147] [2023-12-09 15:13:13,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310222147] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:13,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:13,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:13:13,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842498656] [2023-12-09 15:13:13,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:13,348 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:13:13,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:13,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:13:13,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:13:13,351 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 217 [2023-12-09 15:13:13,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 498 transitions, 3229 flow. Second operand has 7 states, 7 states have (on average 184.28571428571428) internal successors, (1290), 7 states have internal predecessors, (1290), 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 15:13:13,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:13,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 217 [2023-12-09 15:13:13,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:13:14,177 INFO L124 PetriNetUnfolderBase]: 1659/7346 cut-off events. [2023-12-09 15:13:14,177 INFO L125 PetriNetUnfolderBase]: For 9689/14149 co-relation queries the response was YES. [2023-12-09 15:13:14,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15505 conditions, 7346 events. 1659/7346 cut-off events. For 9689/14149 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 81735 event pairs, 521 based on Foata normal form. 234/6772 useless extension candidates. Maximal degree in co-relation 9830. Up to 1360 conditions per place. [2023-12-09 15:13:14,230 INFO L140 encePairwiseOnDemand]: 205/217 looper letters, 197 selfloop transitions, 23 changer transitions 132/537 dead transitions. [2023-12-09 15:13:14,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 537 transitions, 4295 flow [2023-12-09 15:13:14,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:13:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:13:14,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1685 transitions. [2023-12-09 15:13:14,233 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8627752176139273 [2023-12-09 15:13:14,233 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1685 transitions. [2023-12-09 15:13:14,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1685 transitions. [2023-12-09 15:13:14,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:13:14,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1685 transitions. [2023-12-09 15:13:14,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 187.22222222222223) internal successors, (1685), 9 states have internal predecessors, (1685), 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 15:13:14,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 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 15:13:14,240 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 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 15:13:14,240 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 42 predicate places. [2023-12-09 15:13:14,240 INFO L500 AbstractCegarLoop]: Abstraction has has 242 places, 537 transitions, 4295 flow [2023-12-09 15:13:14,241 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 184.28571428571428) internal successors, (1290), 7 states have internal predecessors, (1290), 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 15:13:14,241 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:14,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:14,241 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:13:14,241 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:13:14,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:14,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1563378142, now seen corresponding path program 5 times [2023-12-09 15:13:14,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:14,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296314749] [2023-12-09 15:13:14,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:14,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:14,388 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 15:13:14,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:14,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296314749] [2023-12-09 15:13:14,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296314749] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:14,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:14,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:13:14,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881870894] [2023-12-09 15:13:14,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:14,389 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:13:14,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:14,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:13:14,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:13:14,391 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 217 [2023-12-09 15:13:14,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 537 transitions, 4295 flow. Second operand has 8 states, 8 states have (on average 183.875) internal successors, (1471), 8 states have internal predecessors, (1471), 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 15:13:14,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:14,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 217 [2023-12-09 15:13:14,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:13:15,558 INFO L124 PetriNetUnfolderBase]: 2067/9163 cut-off events. [2023-12-09 15:13:15,559 INFO L125 PetriNetUnfolderBase]: For 17034/24060 co-relation queries the response was YES. [2023-12-09 15:13:15,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21212 conditions, 9163 events. 2067/9163 cut-off events. For 17034/24060 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 105458 event pairs, 610 based on Foata normal form. 465/8670 useless extension candidates. Maximal degree in co-relation 19211. Up to 1879 conditions per place. [2023-12-09 15:13:15,611 INFO L140 encePairwiseOnDemand]: 204/217 looper letters, 234 selfloop transitions, 25 changer transitions 174/618 dead transitions. [2023-12-09 15:13:15,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 618 transitions, 6043 flow [2023-12-09 15:13:15,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:13:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:13:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2071 transitions. [2023-12-09 15:13:15,614 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.867616254713029 [2023-12-09 15:13:15,615 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2071 transitions. [2023-12-09 15:13:15,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2071 transitions. [2023-12-09 15:13:15,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:13:15,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2071 transitions. [2023-12-09 15:13:15,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 188.27272727272728) internal successors, (2071), 11 states have internal predecessors, (2071), 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 15:13:15,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 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 15:13:15,621 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 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 15:13:15,622 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 52 predicate places. [2023-12-09 15:13:15,622 INFO L500 AbstractCegarLoop]: Abstraction has has 252 places, 618 transitions, 6043 flow [2023-12-09 15:13:15,623 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 183.875) internal successors, (1471), 8 states have internal predecessors, (1471), 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 15:13:15,623 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:15,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:15,623 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:13:15,623 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:13:15,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:15,623 INFO L85 PathProgramCache]: Analyzing trace with hash -347305760, now seen corresponding path program 6 times [2023-12-09 15:13:15,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:15,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880118675] [2023-12-09 15:13:15,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:15,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:15,746 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 15:13:15,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:15,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880118675] [2023-12-09 15:13:15,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880118675] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:15,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:15,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:13:15,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215720357] [2023-12-09 15:13:15,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:15,751 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:13:15,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:15,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:13:15,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:13:15,753 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 217 [2023-12-09 15:13:15,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 618 transitions, 6043 flow. Second operand has 8 states, 8 states have (on average 183.875) internal successors, (1471), 8 states have internal predecessors, (1471), 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 15:13:15,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:15,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 217 [2023-12-09 15:13:15,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:13:16,784 INFO L124 PetriNetUnfolderBase]: 2024/8827 cut-off events. [2023-12-09 15:13:16,784 INFO L125 PetriNetUnfolderBase]: For 23159/31374 co-relation queries the response was YES. [2023-12-09 15:13:16,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22807 conditions, 8827 events. 2024/8827 cut-off events. For 23159/31374 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 100818 event pairs, 536 based on Foata normal form. 494/8355 useless extension candidates. Maximal degree in co-relation 13639. Up to 1819 conditions per place. [2023-12-09 15:13:16,860 INFO L140 encePairwiseOnDemand]: 205/217 looper letters, 217 selfloop transitions, 19 changer transitions 194/615 dead transitions. [2023-12-09 15:13:16,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 615 transitions, 6859 flow [2023-12-09 15:13:16,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:13:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:13:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1882 transitions. [2023-12-09 15:13:16,863 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8672811059907835 [2023-12-09 15:13:16,863 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1882 transitions. [2023-12-09 15:13:16,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1882 transitions. [2023-12-09 15:13:16,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:13:16,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1882 transitions. [2023-12-09 15:13:16,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 188.2) internal successors, (1882), 10 states have internal predecessors, (1882), 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 15:13:16,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 217.0) internal successors, (2387), 11 states have internal predecessors, (2387), 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 15:13:16,870 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 217.0) internal successors, (2387), 11 states have internal predecessors, (2387), 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 15:13:16,871 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 61 predicate places. [2023-12-09 15:13:16,872 INFO L500 AbstractCegarLoop]: Abstraction has has 261 places, 615 transitions, 6859 flow [2023-12-09 15:13:16,872 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 183.875) internal successors, (1471), 8 states have internal predecessors, (1471), 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 15:13:16,872 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:16,872 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:16,872 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:13:16,873 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:13:16,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:16,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2019127233, now seen corresponding path program 1 times [2023-12-09 15:13:16,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:16,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251294384] [2023-12-09 15:13:16,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:16,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:16,986 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 15:13:16,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:16,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251294384] [2023-12-09 15:13:16,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251294384] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:16,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:16,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:13:16,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601558921] [2023-12-09 15:13:16,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:16,987 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:13:16,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:16,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:13:16,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:13:16,989 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 217 [2023-12-09 15:13:16,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 615 transitions, 6859 flow. Second operand has 7 states, 7 states have (on average 187.14285714285714) internal successors, (1310), 7 states have internal predecessors, (1310), 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 15:13:16,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:16,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 217 [2023-12-09 15:13:16,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:13:18,832 INFO L124 PetriNetUnfolderBase]: 3576/13609 cut-off events. [2023-12-09 15:13:18,833 INFO L125 PetriNetUnfolderBase]: For 54913/66915 co-relation queries the response was YES. [2023-12-09 15:13:18,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41577 conditions, 13609 events. 3576/13609 cut-off events. For 54913/66915 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 161291 event pairs, 1062 based on Foata normal form. 256/12559 useless extension candidates. Maximal degree in co-relation 25842. Up to 3441 conditions per place. [2023-12-09 15:13:18,954 INFO L140 encePairwiseOnDemand]: 204/217 looper letters, 307 selfloop transitions, 64 changer transitions 233/816 dead transitions. [2023-12-09 15:13:18,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 816 transitions, 11051 flow [2023-12-09 15:13:18,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:13:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:13:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1898 transitions. [2023-12-09 15:13:18,958 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8746543778801843 [2023-12-09 15:13:18,958 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1898 transitions. [2023-12-09 15:13:18,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1898 transitions. [2023-12-09 15:13:18,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:13:18,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1898 transitions. [2023-12-09 15:13:18,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 189.8) internal successors, (1898), 10 states have internal predecessors, (1898), 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 15:13:18,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 217.0) internal successors, (2387), 11 states have internal predecessors, (2387), 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 15:13:18,975 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 217.0) internal successors, (2387), 11 states have internal predecessors, (2387), 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 15:13:18,976 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 70 predicate places. [2023-12-09 15:13:18,976 INFO L500 AbstractCegarLoop]: Abstraction has has 270 places, 816 transitions, 11051 flow [2023-12-09 15:13:18,977 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 187.14285714285714) internal successors, (1310), 7 states have internal predecessors, (1310), 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 15:13:18,977 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:18,977 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:18,977 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 15:13:18,977 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:13:18,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:18,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1553747135, now seen corresponding path program 2 times [2023-12-09 15:13:18,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:18,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088213183] [2023-12-09 15:13:18,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:18,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:19,104 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 15:13:19,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:19,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088213183] [2023-12-09 15:13:19,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088213183] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:19,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:19,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:13:19,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651014445] [2023-12-09 15:13:19,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:19,106 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:13:19,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:19,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:13:19,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:13:19,107 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 217 [2023-12-09 15:13:19,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 816 transitions, 11051 flow. Second operand has 8 states, 8 states have (on average 186.75) internal successors, (1494), 8 states have internal predecessors, (1494), 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 15:13:19,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:19,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 217 [2023-12-09 15:13:19,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:13:20,912 INFO L124 PetriNetUnfolderBase]: 3634/14308 cut-off events. [2023-12-09 15:13:20,912 INFO L125 PetriNetUnfolderBase]: For 72733/84466 co-relation queries the response was YES. [2023-12-09 15:13:20,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47662 conditions, 14308 events. 3634/14308 cut-off events. For 72733/84466 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 171575 event pairs, 1157 based on Foata normal form. 662/13564 useless extension candidates. Maximal degree in co-relation 30198. Up to 3665 conditions per place. [2023-12-09 15:13:21,001 INFO L140 encePairwiseOnDemand]: 206/217 looper letters, 240 selfloop transitions, 16 changer transitions 436/903 dead transitions. [2023-12-09 15:13:21,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 903 transitions, 13915 flow [2023-12-09 15:13:21,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:13:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:13:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2080 transitions. [2023-12-09 15:13:21,005 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8713866778382907 [2023-12-09 15:13:21,005 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2080 transitions. [2023-12-09 15:13:21,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2080 transitions. [2023-12-09 15:13:21,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:13:21,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2080 transitions. [2023-12-09 15:13:21,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 189.0909090909091) internal successors, (2080), 11 states have internal predecessors, (2080), 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 15:13:21,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 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 15:13:21,012 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 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 15:13:21,013 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 80 predicate places. [2023-12-09 15:13:21,013 INFO L500 AbstractCegarLoop]: Abstraction has has 280 places, 903 transitions, 13915 flow [2023-12-09 15:13:21,013 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 186.75) internal successors, (1494), 8 states have internal predecessors, (1494), 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 15:13:21,014 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:21,014 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:21,014 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 15:13:21,014 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:13:21,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:21,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1509947999, now seen corresponding path program 1 times [2023-12-09 15:13:21,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:21,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595287396] [2023-12-09 15:13:21,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:21,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:21,041 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 15:13:21,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:21,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595287396] [2023-12-09 15:13:21,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595287396] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:21,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:21,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:13:21,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869601745] [2023-12-09 15:13:21,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:21,042 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:13:21,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:21,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:13:21,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:13:21,043 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 217 [2023-12-09 15:13:21,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 903 transitions, 13915 flow. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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 15:13:21,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:21,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 217 [2023-12-09 15:13:21,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:13:21,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L43-14-->L43-15: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork2_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][175], [139#L43-15true, 361#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite6#1| 1) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0)), 3#L49-14true, 312#true, 36#$Ultimate##0true, 383#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite6#1| 1) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0)), 275#(= ~length_2~0 0), 217#true, thread3Thread1of1ForFork1InUse, thread2Thread1of1ForFork0InUse, 398#(not (= ~length_0~0 0)), thread1Thread1of1ForFork2InUse, 244#true, 335#(= ~length_2~0 0), 45#L74-4true, 296#true]) [2023-12-09 15:13:21,397 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-12-09 15:13:21,397 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:13:21,397 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:13:21,397 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:13:21,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([532] L49-14-->L49-15: Formula: (= |v_thread2Thread1of1ForFork0_#t~ite6#1_3| v_~result_7~0_1) InVars {thread2Thread1of1ForFork0_#t~ite6#1=|v_thread2Thread1of1ForFork0_#t~ite6#1_3|} OutVars{~result_7~0=v_~result_7~0_1, thread2Thread1of1ForFork0_#t~ite6#1=|v_thread2Thread1of1ForFork0_#t~ite6#1_3|} AuxVars[] AssignedVars[~result_7~0][176], [33#L49-15true, 316#(<= ~result_6~0 0), 385#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite6#1| 1) 0) (<= (+ ~result_7~0 1) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0)), 36#$Ultimate##0true, 105#L43-14true, 275#(= ~length_2~0 0), 363#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite6#1| 1) 0) (or (< ~result_7~0 1) (< 0 ~result_8~0) (< ~result_6~0 1)) (<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0)), thread3Thread1of1ForFork1InUse, thread2Thread1of1ForFork0InUse, 398#(not (= ~length_0~0 0)), thread1Thread1of1ForFork2InUse, 221#(<= ~result_6~0 0), 244#true, 296#true, 45#L74-4true, 342#(and (<= ~result_6~0 0) (= ~length_2~0 0))]) [2023-12-09 15:13:21,397 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-12-09 15:13:21,397 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:13:21,397 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:13:21,397 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:13:21,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([532] L49-14-->L49-15: Formula: (= |v_thread2Thread1of1ForFork0_#t~ite6#1_3| v_~result_7~0_1) InVars {thread2Thread1of1ForFork0_#t~ite6#1=|v_thread2Thread1of1ForFork0_#t~ite6#1_3|} OutVars{~result_7~0=v_~result_7~0_1, thread2Thread1of1ForFork0_#t~ite6#1=|v_thread2Thread1of1ForFork0_#t~ite6#1_3|} AuxVars[] AssignedVars[~result_7~0][176], [33#L49-15true, 316#(<= ~result_6~0 0), 385#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite6#1| 1) 0) (<= (+ ~result_7~0 1) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0)), 131#L55-14true, 105#L43-14true, 275#(= ~length_2~0 0), 363#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite6#1| 1) 0) (or (< ~result_7~0 1) (< 0 ~result_8~0) (< ~result_6~0 1)) (<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0)), thread3Thread1of1ForFork1InUse, thread2Thread1of1ForFork0InUse, 398#(not (= ~length_0~0 0)), thread1Thread1of1ForFork2InUse, 221#(<= ~result_6~0 0), 244#true, 45#L74-4true, 296#true, 342#(and (<= ~result_6~0 0) (= ~length_2~0 0))]) [2023-12-09 15:13:21,752 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-12-09 15:13:21,752 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-12-09 15:13:21,752 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:13:21,752 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:13:21,752 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L55-14-->L55-15: Formula: (= |v_thread3Thread1of1ForFork1_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork1_#t~ite9#1=|v_thread3Thread1of1ForFork1_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite9#1=|v_thread3Thread1of1ForFork1_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][389], [361#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite6#1| 1) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0)), 316#(<= ~result_6~0 0), 3#L49-14true, 383#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite6#1| 1) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0)), 105#L43-14true, 275#(= ~length_2~0 0), thread3Thread1of1ForFork1InUse, 141#L55-15true, thread2Thread1of1ForFork0InUse, 398#(not (= ~length_0~0 0)), thread1Thread1of1ForFork2InUse, 221#(<= ~result_6~0 0), 244#true, 45#L74-4true, 296#true, 342#(and (<= ~result_6~0 0) (= ~length_2~0 0))]) [2023-12-09 15:13:21,752 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-12-09 15:13:21,752 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-12-09 15:13:21,752 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:13:21,752 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:13:23,531 INFO L124 PetriNetUnfolderBase]: 4970/18998 cut-off events. [2023-12-09 15:13:23,532 INFO L125 PetriNetUnfolderBase]: For 141289/164418 co-relation queries the response was YES. [2023-12-09 15:13:23,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67876 conditions, 18998 events. 4970/18998 cut-off events. For 141289/164418 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 241067 event pairs, 1639 based on Foata normal form. 261/17352 useless extension candidates. Maximal degree in co-relation 40299. Up to 4957 conditions per place. [2023-12-09 15:13:23,700 INFO L140 encePairwiseOnDemand]: 213/217 looper letters, 215 selfloop transitions, 2 changer transitions 421/977 dead transitions. [2023-12-09 15:13:23,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 977 transitions, 16209 flow [2023-12-09 15:13:23,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:13:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:13:23,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 612 transitions. [2023-12-09 15:13:23,702 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9400921658986175 [2023-12-09 15:13:23,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 612 transitions. [2023-12-09 15:13:23,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 612 transitions. [2023-12-09 15:13:23,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:13:23,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 612 transitions. [2023-12-09 15:13:23,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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 15:13:23,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 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 15:13:23,704 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 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 15:13:23,704 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 82 predicate places. [2023-12-09 15:13:23,705 INFO L500 AbstractCegarLoop]: Abstraction has has 282 places, 977 transitions, 16209 flow [2023-12-09 15:13:23,705 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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 15:13:23,705 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:23,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:23,705 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 15:13:23,705 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:13:23,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:23,705 INFO L85 PathProgramCache]: Analyzing trace with hash -512679029, now seen corresponding path program 2 times [2023-12-09 15:13:23,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:23,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031470874] [2023-12-09 15:13:23,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:23,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:23,749 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 15:13:23,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:23,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031470874] [2023-12-09 15:13:23,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031470874] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:23,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:23,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:13:23,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425414705] [2023-12-09 15:13:23,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:23,751 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:13:23,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:23,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:13:23,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:13:23,753 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 217 [2023-12-09 15:13:23,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 977 transitions, 16209 flow. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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 15:13:23,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:23,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 217 [2023-12-09 15:13:23,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:13:25,355 INFO L124 PetriNetUnfolderBase]: 3363/13190 cut-off events. [2023-12-09 15:13:25,355 INFO L125 PetriNetUnfolderBase]: For 136110/155667 co-relation queries the response was YES. [2023-12-09 15:13:25,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49495 conditions, 13190 events. 3363/13190 cut-off events. For 136110/155667 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 155241 event pairs, 1210 based on Foata normal form. 244/12117 useless extension candidates. Maximal degree in co-relation 33616. Up to 3540 conditions per place. [2023-12-09 15:13:25,470 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 133 selfloop transitions, 4 changer transitions 459/913 dead transitions. [2023-12-09 15:13:25,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 913 transitions, 15405 flow [2023-12-09 15:13:25,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:13:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:13:25,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 612 transitions. [2023-12-09 15:13:25,472 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9400921658986175 [2023-12-09 15:13:25,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 612 transitions. [2023-12-09 15:13:25,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 612 transitions. [2023-12-09 15:13:25,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:13:25,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 612 transitions. [2023-12-09 15:13:25,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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 15:13:25,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 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 15:13:25,474 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 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 15:13:25,474 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 84 predicate places. [2023-12-09 15:13:25,474 INFO L500 AbstractCegarLoop]: Abstraction has has 284 places, 913 transitions, 15405 flow [2023-12-09 15:13:25,474 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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 15:13:25,474 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:25,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:25,475 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-09 15:13:25,475 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:13:25,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash 531259536, now seen corresponding path program 1 times [2023-12-09 15:13:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:25,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894291611] [2023-12-09 15:13:25,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:25,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:25,589 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 15:13:25,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:25,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894291611] [2023-12-09 15:13:25,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894291611] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:25,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:25,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:13:25,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163179930] [2023-12-09 15:13:25,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:25,589 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:13:25,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:25,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:13:25,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:13:25,591 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 217 [2023-12-09 15:13:25,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 913 transitions, 15405 flow. Second operand has 7 states, 7 states have (on average 190.57142857142858) internal successors, (1334), 7 states have internal predecessors, (1334), 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 15:13:25,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:25,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 217 [2023-12-09 15:13:25,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:13:27,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} AuxVars[] AssignedVars[][782], [361#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite6#1| 1) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0)), 3#L49-14true, 312#true, 84#L75-2true, 149#L55-16true, 383#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite6#1| 1) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0)), 273#true, 217#true, thread3Thread1of1ForFork1InUse, 400#true, thread2Thread1of1ForFork0InUse, 404#true, 398#(not (= ~length_0~0 0)), thread1Thread1of1ForFork2NotInUse, 244#true, 296#true, 333#true]) [2023-12-09 15:13:27,588 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-12-09 15:13:27,588 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:13:27,588 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:13:27,588 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:13:27,921 INFO L124 PetriNetUnfolderBase]: 4258/16457 cut-off events. [2023-12-09 15:13:27,921 INFO L125 PetriNetUnfolderBase]: For 207418/250204 co-relation queries the response was YES. [2023-12-09 15:13:27,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65453 conditions, 16457 events. 4258/16457 cut-off events. For 207418/250204 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 199250 event pairs, 1455 based on Foata normal form. 342/15155 useless extension candidates. Maximal degree in co-relation 39445. Up to 4379 conditions per place. [2023-12-09 15:13:28,039 INFO L140 encePairwiseOnDemand]: 208/217 looper letters, 124 selfloop transitions, 2 changer transitions 590/970 dead transitions. [2023-12-09 15:13:28,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 970 transitions, 17883 flow [2023-12-09 15:13:28,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:13:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:13:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1923 transitions. [2023-12-09 15:13:28,042 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8861751152073732 [2023-12-09 15:13:28,042 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1923 transitions. [2023-12-09 15:13:28,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1923 transitions. [2023-12-09 15:13:28,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:13:28,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1923 transitions. [2023-12-09 15:13:28,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 192.3) internal successors, (1923), 10 states have internal predecessors, (1923), 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 15:13:28,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 217.0) internal successors, (2387), 11 states have internal predecessors, (2387), 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 15:13:28,048 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 217.0) internal successors, (2387), 11 states have internal predecessors, (2387), 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 15:13:28,049 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 93 predicate places. [2023-12-09 15:13:28,049 INFO L500 AbstractCegarLoop]: Abstraction has has 293 places, 970 transitions, 17883 flow [2023-12-09 15:13:28,049 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 190.57142857142858) internal successors, (1334), 7 states have internal predecessors, (1334), 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 15:13:28,049 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:28,049 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:28,049 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-09 15:13:28,050 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:13:28,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1929700756, now seen corresponding path program 1 times [2023-12-09 15:13:28,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:28,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026412944] [2023-12-09 15:13:28,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:28,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:28,152 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 15:13:28,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:28,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026412944] [2023-12-09 15:13:28,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026412944] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:28,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:28,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:13:28,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618529538] [2023-12-09 15:13:28,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:28,152 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:13:28,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:28,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:13:28,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:13:28,154 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 217 [2023-12-09 15:13:28,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 970 transitions, 17883 flow. Second operand has 7 states, 7 states have (on average 183.28571428571428) internal successors, (1283), 7 states have internal predecessors, (1283), 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 15:13:28,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:28,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 217 [2023-12-09 15:13:28,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:13:29,365 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} AuxVars[] AssignedVars[][620], [408#(<= (+ ~result_6~0 1) 0), 425#true, 376#(<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0), 312#true, 84#L75-2true, 149#L55-16true, 275#(= ~length_2~0 0), 217#true, 57#L49-13true, thread3Thread1of1ForFork1InUse, 400#true, thread2Thread1of1ForFork0InUse, thread1Thread1of1ForFork2NotInUse, 398#(not (= ~length_0~0 0)), 335#(= ~length_2~0 0), 244#true, 296#true, 355#(<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0)]) [2023-12-09 15:13:29,365 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is not cut-off event [2023-12-09 15:13:29,365 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-12-09 15:13:29,365 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-12-09 15:13:29,365 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-12-09 15:13:31,498 INFO L124 PetriNetUnfolderBase]: 5567/22567 cut-off events. [2023-12-09 15:13:31,498 INFO L125 PetriNetUnfolderBase]: For 292244/325164 co-relation queries the response was YES. [2023-12-09 15:13:31,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92682 conditions, 22567 events. 5567/22567 cut-off events. For 292244/325164 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 288508 event pairs, 1251 based on Foata normal form. 490/21186 useless extension candidates. Maximal degree in co-relation 59153. Up to 5856 conditions per place. [2023-12-09 15:13:31,658 INFO L140 encePairwiseOnDemand]: 202/217 looper letters, 256 selfloop transitions, 27 changer transitions 761/1235 dead transitions. [2023-12-09 15:13:31,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 1235 transitions, 25335 flow [2023-12-09 15:13:31,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:13:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:13:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2052 transitions. [2023-12-09 15:13:31,684 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8596564725596983 [2023-12-09 15:13:31,684 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2052 transitions. [2023-12-09 15:13:31,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2052 transitions. [2023-12-09 15:13:31,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:13:31,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2052 transitions. [2023-12-09 15:13:31,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 186.54545454545453) internal successors, (2052), 11 states have internal predecessors, (2052), 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 15:13:31,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 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 15:13:31,691 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 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 15:13:31,691 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 103 predicate places. [2023-12-09 15:13:31,691 INFO L500 AbstractCegarLoop]: Abstraction has has 303 places, 1235 transitions, 25335 flow [2023-12-09 15:13:31,692 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 183.28571428571428) internal successors, (1283), 7 states have internal predecessors, (1283), 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 15:13:31,692 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:31,692 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:31,692 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-09 15:13:31,692 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:13:31,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:31,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1769251496, now seen corresponding path program 2 times [2023-12-09 15:13:31,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:31,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226697999] [2023-12-09 15:13:31,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:31,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:31,819 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 15:13:31,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:31,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226697999] [2023-12-09 15:13:31,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226697999] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:31,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:31,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:13:31,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231423285] [2023-12-09 15:13:31,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:31,820 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:13:31,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:31,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:13:31,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:13:31,822 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 217 [2023-12-09 15:13:31,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 1235 transitions, 25335 flow. Second operand has 7 states, 7 states have (on average 186.71428571428572) internal successors, (1307), 7 states have internal predecessors, (1307), 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 15:13:31,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:31,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 217 [2023-12-09 15:13:31,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:13:35,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} AuxVars[] AssignedVars[][1020], [122#L49-6true, 312#true, 84#L75-2true, 149#L55-16true, 273#true, 217#true, 353#true, thread3Thread1of1ForFork1InUse, 400#true, 427#(not (= ~length_4~0 0)), thread2Thread1of1ForFork0InUse, 398#(not (= ~length_0~0 0)), thread1Thread1of1ForFork2NotInUse, 404#true, 445#true, 244#true, 296#true, 374#true, 333#true]) [2023-12-09 15:13:35,361 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2023-12-09 15:13:35,361 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-12-09 15:13:35,361 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-12-09 15:13:35,361 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-12-09 15:13:35,828 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} AuxVars[] AssignedVars[][1020], [312#true, 84#L75-2true, 149#L55-16true, 273#true, 217#true, 57#L49-13true, 353#true, 400#true, thread3Thread1of1ForFork1InUse, 427#(not (= ~length_4~0 0)), thread2Thread1of1ForFork0InUse, 398#(not (= ~length_0~0 0)), 404#true, thread1Thread1of1ForFork2NotInUse, 445#true, 244#true, 296#true, 374#true, 333#true]) [2023-12-09 15:13:35,828 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2023-12-09 15:13:35,829 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-12-09 15:13:35,829 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-12-09 15:13:35,829 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-12-09 15:13:35,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} AuxVars[] AssignedVars[][1020], [3#L49-14true, 312#true, 84#L75-2true, 149#L55-16true, 273#true, 217#true, 353#true, 400#true, thread3Thread1of1ForFork1InUse, 427#(not (= ~length_4~0 0)), thread2Thread1of1ForFork0InUse, thread1Thread1of1ForFork2NotInUse, 398#(not (= ~length_0~0 0)), 404#true, 445#true, 244#true, 296#true, 374#true, 333#true]) [2023-12-09 15:13:35,833 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-12-09 15:13:35,833 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-12-09 15:13:35,833 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-12-09 15:13:35,833 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-12-09 15:13:35,856 INFO L124 PetriNetUnfolderBase]: 5645/22878 cut-off events. [2023-12-09 15:13:35,856 INFO L125 PetriNetUnfolderBase]: For 381160/466371 co-relation queries the response was YES. [2023-12-09 15:13:35,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100544 conditions, 22878 events. 5645/22878 cut-off events. For 381160/466371 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 290722 event pairs, 1247 based on Foata normal form. 604/21626 useless extension candidates. Maximal degree in co-relation 63855. Up to 5919 conditions per place. [2023-12-09 15:13:36,017 INFO L140 encePairwiseOnDemand]: 209/217 looper letters, 245 selfloop transitions, 22 changer transitions 910/1421 dead transitions. [2023-12-09 15:13:36,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 1421 transitions, 32384 flow [2023-12-09 15:13:36,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:13:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:13:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2085 transitions. [2023-12-09 15:13:36,020 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8734813573523251 [2023-12-09 15:13:36,020 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2085 transitions. [2023-12-09 15:13:36,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2085 transitions. [2023-12-09 15:13:36,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:13:36,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2085 transitions. [2023-12-09 15:13:36,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 189.54545454545453) internal successors, (2085), 11 states have internal predecessors, (2085), 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 15:13:36,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 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 15:13:36,025 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 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 15:13:36,026 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 113 predicate places. [2023-12-09 15:13:36,026 INFO L500 AbstractCegarLoop]: Abstraction has has 313 places, 1421 transitions, 32384 flow [2023-12-09 15:13:36,026 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 186.71428571428572) internal successors, (1307), 7 states have internal predecessors, (1307), 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 15:13:36,026 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:36,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:36,027 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-09 15:13:36,027 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:13:36,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:36,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1480232134, now seen corresponding path program 3 times [2023-12-09 15:13:36,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:36,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012257992] [2023-12-09 15:13:36,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:36,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:36,141 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 15:13:36,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:36,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012257992] [2023-12-09 15:13:36,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012257992] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:36,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:36,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:13:36,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261790695] [2023-12-09 15:13:36,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:36,142 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:13:36,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:36,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:13:36,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:13:36,144 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 217 [2023-12-09 15:13:36,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 1421 transitions, 32384 flow. Second operand has 8 states, 8 states have (on average 182.875) internal successors, (1463), 8 states have internal predecessors, (1463), 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 15:13:36,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:36,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 217 [2023-12-09 15:13:36,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:13:37,149 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L43-14-->L43-15: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork2_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][637], [139#L43-15true, 378#(<= (+ ~result_7~0 1) 0), 161#L49-17true, 470#(not (= ~length_4~0 0)), 312#true, 275#(= ~length_2~0 0), 217#true, 353#true, 400#true, thread3Thread1of1ForFork1InUse, 427#(not (= ~length_4~0 0)), thread2Thread1of1ForFork0InUse, 414#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite3#1| 1) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite2#1| 1) 0)), 398#(not (= ~length_0~0 0)), thread1Thread1of1ForFork2InUse, 445#true, 244#true, 335#(= ~length_2~0 0), 168#L55-6true, 296#true, 45#L74-4true]) [2023-12-09 15:13:37,149 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-12-09 15:13:37,149 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:13:37,154 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:13:37,154 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:13:39,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L43-14-->L43-15: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork2_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][637], [139#L43-15true, 378#(<= (+ ~result_7~0 1) 0), 161#L49-17true, 470#(not (= ~length_4~0 0)), 131#L55-14true, 312#true, 275#(= ~length_2~0 0), 217#true, 353#true, thread3Thread1of1ForFork1InUse, 400#true, 427#(not (= ~length_4~0 0)), thread2Thread1of1ForFork0InUse, 414#(and (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite3#1| 1) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite2#1| 1) 0)), 398#(not (= ~length_0~0 0)), thread1Thread1of1ForFork2InUse, 445#true, 244#true, 335#(= ~length_2~0 0), 45#L74-4true, 296#true]) [2023-12-09 15:13:39,112 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-12-09 15:13:39,112 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-12-09 15:13:39,112 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-12-09 15:13:39,112 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-12-09 15:13:39,190 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L55-14-->L55-15: Formula: (= |v_thread3Thread1of1ForFork1_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork1_#t~ite9#1=|v_thread3Thread1of1ForFork1_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite9#1=|v_thread3Thread1of1ForFork1_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][1059], [378#(<= (+ ~result_7~0 1) 0), 161#L49-17true, 316#(<= ~result_6~0 0), 470#(not (= ~length_4~0 0)), 105#L43-14true, 275#(= ~length_2~0 0), 353#true, thread3Thread1of1ForFork1InUse, 400#true, 427#(not (= ~length_4~0 0)), 141#L55-15true, thread2Thread1of1ForFork0InUse, 398#(not (= ~length_0~0 0)), 445#true, thread1Thread1of1ForFork2InUse, 221#(<= ~result_6~0 0), 412#(and (<= (+ |thread1Thread1of1ForFork2_#t~ite3#1| 1) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite2#1| 1) 0)), 244#true, 45#L74-4true, 296#true, 342#(and (<= ~result_6~0 0) (= ~length_2~0 0))]) [2023-12-09 15:13:39,190 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is not cut-off event [2023-12-09 15:13:39,190 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is not cut-off event [2023-12-09 15:13:39,190 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is not cut-off event [2023-12-09 15:13:39,190 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is not cut-off event [2023-12-09 15:13:40,611 INFO L124 PetriNetUnfolderBase]: 5792/24028 cut-off events. [2023-12-09 15:13:40,612 INFO L125 PetriNetUnfolderBase]: For 412896/508886 co-relation queries the response was YES. [2023-12-09 15:13:40,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111383 conditions, 24028 events. 5792/24028 cut-off events. For 412896/508886 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 314315 event pairs, 1256 based on Foata normal form. 861/23067 useless extension candidates. Maximal degree in co-relation 68846. Up to 6138 conditions per place. [2023-12-09 15:13:40,776 INFO L140 encePairwiseOnDemand]: 206/217 looper letters, 240 selfloop transitions, 14 changer transitions 997/1441 dead transitions. [2023-12-09 15:13:40,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 1441 transitions, 35344 flow [2023-12-09 15:13:40,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:13:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:13:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2049 transitions. [2023-12-09 15:13:40,789 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8583996648512777 [2023-12-09 15:13:40,789 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2049 transitions. [2023-12-09 15:13:40,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2049 transitions. [2023-12-09 15:13:40,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:13:40,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2049 transitions. [2023-12-09 15:13:40,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 186.27272727272728) internal successors, (2049), 11 states have internal predecessors, (2049), 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 15:13:40,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 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 15:13:40,794 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 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 15:13:40,794 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 123 predicate places. [2023-12-09 15:13:40,794 INFO L500 AbstractCegarLoop]: Abstraction has has 323 places, 1441 transitions, 35344 flow [2023-12-09 15:13:40,794 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 182.875) internal successors, (1463), 8 states have internal predecessors, (1463), 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 15:13:40,794 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:40,795 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:40,795 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-09 15:13:40,795 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:13:40,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:40,795 INFO L85 PathProgramCache]: Analyzing trace with hash -272972626, now seen corresponding path program 4 times [2023-12-09 15:13:40,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:40,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767148617] [2023-12-09 15:13:40,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:40,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:40,892 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 15:13:40,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:40,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767148617] [2023-12-09 15:13:40,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767148617] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:40,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:40,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:13:40,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513564588] [2023-12-09 15:13:40,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:40,893 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:13:40,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:40,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:13:40,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:13:40,894 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 217 [2023-12-09 15:13:40,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 1441 transitions, 35344 flow. Second operand has 7 states, 7 states have (on average 186.71428571428572) internal successors, (1307), 7 states have internal predecessors, (1307), 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 15:13:40,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:40,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 217 [2023-12-09 15:13:40,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:13:45,359 INFO L124 PetriNetUnfolderBase]: 5733/23498 cut-off events. [2023-12-09 15:13:45,359 INFO L125 PetriNetUnfolderBase]: For 466844/546490 co-relation queries the response was YES. [2023-12-09 15:13:45,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115812 conditions, 23498 events. 5733/23498 cut-off events. For 466844/546490 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 304772 event pairs, 1249 based on Foata normal form. 662/22252 useless extension candidates. Maximal degree in co-relation 79870. Up to 6094 conditions per place. [2023-12-09 15:13:45,526 INFO L140 encePairwiseOnDemand]: 209/217 looper letters, 161 selfloop transitions, 0 changer transitions 1069/1435 dead transitions. [2023-12-09 15:13:45,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 1435 transitions, 37356 flow [2023-12-09 15:13:45,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:13:45,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:13:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1703 transitions. [2023-12-09 15:13:45,548 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8719918074756784 [2023-12-09 15:13:45,549 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1703 transitions. [2023-12-09 15:13:45,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1703 transitions. [2023-12-09 15:13:45,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:13:45,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1703 transitions. [2023-12-09 15:13:45,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 189.22222222222223) internal successors, (1703), 9 states have internal predecessors, (1703), 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 15:13:45,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 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 15:13:45,553 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 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 15:13:45,553 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 131 predicate places. [2023-12-09 15:13:45,553 INFO L500 AbstractCegarLoop]: Abstraction has has 331 places, 1435 transitions, 37356 flow [2023-12-09 15:13:45,553 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 186.71428571428572) internal successors, (1307), 7 states have internal predecessors, (1307), 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 15:13:45,553 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:45,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:45,554 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-09 15:13:45,554 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:13:45,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:45,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1219111073, now seen corresponding path program 1 times [2023-12-09 15:13:45,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:45,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226083657] [2023-12-09 15:13:45,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:45,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:45,709 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 15:13:45,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:45,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226083657] [2023-12-09 15:13:45,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226083657] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:45,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:45,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:13:45,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029668802] [2023-12-09 15:13:45,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:45,712 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:13:45,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:45,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:13:45,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:13:45,713 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 217 [2023-12-09 15:13:45,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 1435 transitions, 37356 flow. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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 15:13:45,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:45,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 217 [2023-12-09 15:13:45,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:13:47,784 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L55-14-->L55-15: Formula: (= |v_thread3Thread1of1ForFork1_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork1_#t~ite9#1=|v_thread3Thread1of1ForFork1_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite9#1=|v_thread3Thread1of1ForFork1_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][960], [425#true, 376#(<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0), 492#true, 312#true, 510#(not (= ~length_2~0 0)), 273#true, 217#true, 57#L49-13true, 400#true, thread3Thread1of1ForFork1InUse, 141#L55-15true, thread2Thread1of1ForFork0InUse, 404#true, 398#(not (= ~length_0~0 0)), thread1Thread1of1ForFork2InUse, 445#true, 244#true, 296#true, 45#L74-4true, 468#true, 144#L43-16true, 333#true, 355#(<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0)]) [2023-12-09 15:13:47,784 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-12-09 15:13:47,784 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-12-09 15:13:47,784 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-12-09 15:13:47,784 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-12-09 15:13:47,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} AuxVars[] AssignedVars[][463], [220#(or (and (= ~result_6~0 0) (= ~length_2~0 0)) (and (not (= ~length_2~0 0)) (= ~result_6~0 1))), 470#(not (= ~length_4~0 0)), 492#true, 3#L49-14true, 312#true, 84#L75-2true, 510#(not (= ~length_2~0 0)), 273#true, 353#true, 396#true, thread3Thread1of1ForFork1InUse, 427#(not (= ~length_4~0 0)), thread2Thread1of1ForFork0InUse, thread1Thread1of1ForFork2NotInUse, 404#true, 445#true, 35#L55-1true, 244#true, 296#true, 374#true, 402#(= ~length_0~0 0), 333#true]) [2023-12-09 15:13:47,990 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is not cut-off event [2023-12-09 15:13:47,990 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2023-12-09 15:13:47,990 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2023-12-09 15:13:47,990 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2023-12-09 15:13:48,144 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} AuxVars[] AssignedVars[][941], [376#(<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0), 425#true, 492#true, 312#true, 131#L55-14true, 510#(not (= ~length_2~0 0)), 84#L75-2true, 273#true, 217#true, 57#L49-13true, thread3Thread1of1ForFork1InUse, 400#true, thread2Thread1of1ForFork0InUse, 404#true, 398#(not (= ~length_0~0 0)), thread1Thread1of1ForFork2NotInUse, 445#true, 244#true, 296#true, 468#true, 333#true, 355#(<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0)]) [2023-12-09 15:13:48,145 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-12-09 15:13:48,145 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-12-09 15:13:48,145 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-12-09 15:13:48,145 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-12-09 15:13:48,340 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} AuxVars[] AssignedVars[][941], [376#(<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0), 425#true, 492#true, 312#true, 84#L75-2true, 510#(not (= ~length_2~0 0)), 149#L55-16true, 273#true, 217#true, 57#L49-13true, thread3Thread1of1ForFork1InUse, 400#true, thread2Thread1of1ForFork0InUse, thread1Thread1of1ForFork2NotInUse, 404#true, 398#(not (= ~length_0~0 0)), 445#true, 244#true, 296#true, 468#true, 333#true, 355#(<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0)]) [2023-12-09 15:13:48,340 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is not cut-off event [2023-12-09 15:13:48,340 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2023-12-09 15:13:48,340 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2023-12-09 15:13:48,340 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2023-12-09 15:13:48,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} AuxVars[] AssignedVars[][958], [361#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite6#1| 1) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0)), 492#true, 470#(not (= ~length_4~0 0)), 3#L49-14true, 312#true, 510#(not (= ~length_2~0 0)), 84#L75-2true, 149#L55-16true, 383#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite6#1| 1) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0)), 273#true, 217#true, thread3Thread1of1ForFork1InUse, 400#true, 427#(not (= ~length_4~0 0)), thread2Thread1of1ForFork0InUse, thread1Thread1of1ForFork2NotInUse, 398#(not (= ~length_0~0 0)), 404#true, 445#true, 244#true, 296#true, 333#true]) [2023-12-09 15:13:48,915 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2023-12-09 15:13:48,915 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-12-09 15:13:48,915 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-12-09 15:13:48,915 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-12-09 15:13:49,037 INFO L124 PetriNetUnfolderBase]: 4543/18044 cut-off events. [2023-12-09 15:13:49,037 INFO L125 PetriNetUnfolderBase]: For 423246/468704 co-relation queries the response was YES. [2023-12-09 15:13:49,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93626 conditions, 18044 events. 4543/18044 cut-off events. For 423246/468704 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 220892 event pairs, 964 based on Foata normal form. 444/16990 useless extension candidates. Maximal degree in co-relation 79037. Up to 4808 conditions per place. [2023-12-09 15:13:49,304 INFO L140 encePairwiseOnDemand]: 213/217 looper letters, 42 selfloop transitions, 2 changer transitions 974/1240 dead transitions. [2023-12-09 15:13:49,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 1240 transitions, 32757 flow [2023-12-09 15:13:49,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:13:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:13:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2023-12-09 15:13:49,305 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9385560675883257 [2023-12-09 15:13:49,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 611 transitions. [2023-12-09 15:13:49,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 611 transitions. [2023-12-09 15:13:49,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:13:49,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 611 transitions. [2023-12-09 15:13:49,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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 15:13:49,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 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 15:13:49,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 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 15:13:49,308 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 133 predicate places. [2023-12-09 15:13:49,308 INFO L500 AbstractCegarLoop]: Abstraction has has 333 places, 1240 transitions, 32757 flow [2023-12-09 15:13:49,309 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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 15:13:49,309 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:49,310 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:49,310 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-09 15:13:49,310 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:13:49,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:49,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2050031697, now seen corresponding path program 1 times [2023-12-09 15:13:49,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:49,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404912834] [2023-12-09 15:13:49,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:49,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:49,347 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 15:13:49,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:49,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404912834] [2023-12-09 15:13:49,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404912834] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:49,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:49,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:13:49,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570765405] [2023-12-09 15:13:49,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:49,349 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:13:49,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:49,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:13:49,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:13:49,350 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 217 [2023-12-09 15:13:49,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 1240 transitions, 32757 flow. Second operand has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 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 15:13:49,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:49,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 217 [2023-12-09 15:13:49,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:13:51,519 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_6|} AuxVars[] AssignedVars[][952], [361#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite6#1| 1) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0)), 425#true, 492#true, 3#L49-14true, 312#true, 84#L75-2true, 510#(not (= ~length_2~0 0)), 149#L55-16true, 383#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite6#1| 1) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite5#1| 1) 0)), 273#true, 217#true, 514#(= ~length_4~0 0), thread3Thread1of1ForFork1InUse, 400#true, thread2Thread1of1ForFork0InUse, 398#(not (= ~length_0~0 0)), 404#true, thread1Thread1of1ForFork2NotInUse, 445#true, 244#true, 296#true, 468#true, 333#true]) [2023-12-09 15:13:51,520 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-12-09 15:13:51,520 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:13:51,520 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:13:51,520 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:13:51,983 INFO L124 PetriNetUnfolderBase]: 3651/14547 cut-off events. [2023-12-09 15:13:51,983 INFO L125 PetriNetUnfolderBase]: For 432066/504138 co-relation queries the response was YES. [2023-12-09 15:13:52,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80813 conditions, 14547 events. 3651/14547 cut-off events. For 432066/504138 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 170763 event pairs, 901 based on Foata normal form. 358/13870 useless extension candidates. Maximal degree in co-relation 47411. Up to 3868 conditions per place. [2023-12-09 15:13:52,107 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 60 selfloop transitions, 8 changer transitions 874/1183 dead transitions. [2023-12-09 15:13:52,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 1183 transitions, 32414 flow [2023-12-09 15:13:52,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:13:52,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:13:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2023-12-09 15:13:52,109 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2023-12-09 15:13:52,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 609 transitions. [2023-12-09 15:13:52,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 609 transitions. [2023-12-09 15:13:52,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:13:52,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 609 transitions. [2023-12-09 15:13:52,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 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 15:13:52,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 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 15:13:52,110 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 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 15:13:52,111 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 135 predicate places. [2023-12-09 15:13:52,111 INFO L500 AbstractCegarLoop]: Abstraction has has 335 places, 1183 transitions, 32414 flow [2023-12-09 15:13:52,111 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 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 15:13:52,111 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:13:52,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:52,111 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-09 15:13:52,111 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:13:52,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:13:52,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2080037600, now seen corresponding path program 1 times [2023-12-09 15:13:52,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:13:52,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974007862] [2023-12-09 15:13:52,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:13:52,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:13:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:13:52,830 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 15:13:52,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:13:52,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974007862] [2023-12-09 15:13:52,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974007862] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:13:52,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:13:52,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-12-09 15:13:52,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758800543] [2023-12-09 15:13:52,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:13:52,831 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-09 15:13:52,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:13:52,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-09 15:13:52,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2023-12-09 15:13:52,833 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 217 [2023-12-09 15:13:52,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 1183 transitions, 32414 flow. Second operand has 28 states, 28 states have (on average 129.67857142857142) internal successors, (3631), 28 states have internal predecessors, (3631), 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 15:13:52,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:13:52,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 217 [2023-12-09 15:13:52,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:14:25,046 INFO L124 PetriNetUnfolderBase]: 42045/87197 cut-off events. [2023-12-09 15:14:25,047 INFO L125 PetriNetUnfolderBase]: For 1206107/1242064 co-relation queries the response was YES. [2023-12-09 15:14:25,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379222 conditions, 87197 events. 42045/87197 cut-off events. For 1206107/1242064 co-relation queries the response was YES. Maximal size of possible extension queue 1411. Compared 927585 event pairs, 9728 based on Foata normal form. 186/84059 useless extension candidates. Maximal degree in co-relation 367935. Up to 24230 conditions per place. [2023-12-09 15:14:25,869 INFO L140 encePairwiseOnDemand]: 174/217 looper letters, 1727 selfloop transitions, 125 changer transitions 2097/4070 dead transitions. [2023-12-09 15:14:25,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 4070 transitions, 72942 flow [2023-12-09 15:14:25,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 280 states. [2023-12-09 15:14:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2023-12-09 15:14:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 37946 transitions. [2023-12-09 15:14:25,892 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6245227123107308 [2023-12-09 15:14:25,892 INFO L72 ComplementDD]: Start complementDD. Operand 280 states and 37946 transitions. [2023-12-09 15:14:25,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 280 states and 37946 transitions. [2023-12-09 15:14:25,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:14:25,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 280 states and 37946 transitions. [2023-12-09 15:14:25,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 281 states, 280 states have (on average 135.52142857142857) internal successors, (37946), 280 states have internal predecessors, (37946), 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 15:14:26,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 281 states, 281 states have (on average 217.0) internal successors, (60977), 281 states have internal predecessors, (60977), 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 15:14:26,030 INFO L81 ComplementDD]: Finished complementDD. Result has 281 states, 281 states have (on average 217.0) internal successors, (60977), 281 states have internal predecessors, (60977), 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 15:14:26,032 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 414 predicate places. [2023-12-09 15:14:26,032 INFO L500 AbstractCegarLoop]: Abstraction has has 614 places, 4070 transitions, 72942 flow [2023-12-09 15:14:26,033 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 129.67857142857142) internal successors, (3631), 28 states have internal predecessors, (3631), 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 15:14:26,033 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:14:26,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:26,033 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-09 15:14:26,033 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:14:26,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:14:26,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1556593694, now seen corresponding path program 2 times [2023-12-09 15:14:26,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:14:26,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59652613] [2023-12-09 15:14:26,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:14:26,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:14:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:14:26,656 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 15:14:26,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:14:26,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59652613] [2023-12-09 15:14:26,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59652613] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:14:26,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:14:26,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-12-09 15:14:26,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736216829] [2023-12-09 15:14:26,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:14:26,657 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-09 15:14:26,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:14:26,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-09 15:14:26,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2023-12-09 15:14:26,659 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 217 [2023-12-09 15:14:26,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 4070 transitions, 72942 flow. Second operand has 28 states, 28 states have (on average 129.67857142857142) internal successors, (3631), 28 states have internal predecessors, (3631), 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 15:14:26,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:14:26,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 217 [2023-12-09 15:14:26,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:15:27,340 INFO L124 PetriNetUnfolderBase]: 50445/102387 cut-off events. [2023-12-09 15:15:27,340 INFO L125 PetriNetUnfolderBase]: For 1526784/1783700 co-relation queries the response was YES. [2023-12-09 15:15:28,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529190 conditions, 102387 events. 50445/102387 cut-off events. For 1526784/1783700 co-relation queries the response was YES. Maximal size of possible extension queue 1443. Compared 1072733 event pairs, 4735 based on Foata normal form. 364/99521 useless extension candidates. Maximal degree in co-relation 410318. Up to 25133 conditions per place. [2023-12-09 15:15:28,574 INFO L140 encePairwiseOnDemand]: 174/217 looper letters, 6928 selfloop transitions, 1596 changer transitions 3256/11904 dead transitions. [2023-12-09 15:15:28,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 881 places, 11904 transitions, 184189 flow [2023-12-09 15:15:28,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 268 states. [2023-12-09 15:15:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2023-12-09 15:15:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 36094 transitions. [2023-12-09 15:15:28,607 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6206410344590412 [2023-12-09 15:15:28,607 INFO L72 ComplementDD]: Start complementDD. Operand 268 states and 36094 transitions. [2023-12-09 15:15:28,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 36094 transitions. [2023-12-09 15:15:28,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:15:28,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 268 states and 36094 transitions. [2023-12-09 15:15:28,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 269 states, 268 states have (on average 134.67910447761193) internal successors, (36094), 268 states have internal predecessors, (36094), 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 15:15:28,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 269 states, 269 states have (on average 217.0) internal successors, (58373), 269 states have internal predecessors, (58373), 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 15:15:28,701 INFO L81 ComplementDD]: Finished complementDD. Result has 269 states, 269 states have (on average 217.0) internal successors, (58373), 269 states have internal predecessors, (58373), 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 15:15:28,702 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, 681 predicate places. [2023-12-09 15:15:28,702 INFO L500 AbstractCegarLoop]: Abstraction has has 881 places, 11904 transitions, 184189 flow [2023-12-09 15:15:28,703 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 129.67857142857142) internal successors, (3631), 28 states have internal predecessors, (3631), 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 15:15:28,703 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:15:28,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:15:28,703 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-09 15:15:28,703 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:15:28,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:15:28,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1717034292, now seen corresponding path program 3 times [2023-12-09 15:15:28,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:15:28,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067429587] [2023-12-09 15:15:28,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:15:28,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:15:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:15:29,398 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 15:15:29,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:15:29,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067429587] [2023-12-09 15:15:29,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067429587] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:15:29,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:15:29,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-12-09 15:15:29,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422901896] [2023-12-09 15:15:29,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:15:29,399 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-09 15:15:29,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:15:29,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-09 15:15:29,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2023-12-09 15:15:29,402 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 217 [2023-12-09 15:15:29,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 881 places, 11904 transitions, 184189 flow. Second operand has 28 states, 28 states have (on average 129.67857142857142) internal successors, (3631), 28 states have internal predecessors, (3631), 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 15:15:29,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:15:29,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 217 [2023-12-09 15:15:29,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-12-09 15:17:20,768 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:17:21,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-09 15:17:21,148 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-12-09 15:17:21,148 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-09 15:17:21,148 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (28states, 127/217 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 389242 conditions, 67052 events (32031/67051 cut-off events. For 1134976/1449705 co-relation queries the response was YES. Maximal size of possible extension queue 1590. Compared 746627 event pairs, 4391 based on Foata normal form. 244/65562 useless extension candidates. Maximal degree in co-relation 318880. Up to 35838 conditions per place.). [2023-12-09 15:17:21,149 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-12-09 15:17:21,149 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-12-09 15:17:21,149 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-12-09 15:17:21,150 INFO L457 BasicCegarLoop]: Path program histogram: [6, 4, 3, 2, 2, 1, 1, 1] [2023-12-09 15:17:21,152 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:17:21,152 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:17:21,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:17:21 BasicIcfg [2023-12-09 15:17:21,155 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:17:21,156 INFO L158 Benchmark]: Toolchain (without parser) took 252768.73ms. Allocated memory was 243.3MB in the beginning and 6.8GB in the end (delta: 6.5GB). Free memory was 195.2MB in the beginning and 3.5GB in the end (delta: -3.3GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2023-12-09 15:17:21,156 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 202.4MB. Free memory is still 156.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:17:21,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.05ms. Allocated memory is still 243.3MB. Free memory was 195.2MB in the beginning and 183.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-09 15:17:21,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.58ms. Allocated memory is still 243.3MB. Free memory was 183.7MB in the beginning and 181.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:17:21,156 INFO L158 Benchmark]: Boogie Preprocessor took 47.43ms. Allocated memory is still 243.3MB. Free memory was 181.4MB in the beginning and 180.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-09 15:17:21,156 INFO L158 Benchmark]: RCFGBuilder took 335.81ms. Allocated memory is still 243.3MB. Free memory was 179.9MB in the beginning and 161.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-09 15:17:21,157 INFO L158 Benchmark]: TraceAbstraction took 252064.26ms. Allocated memory was 243.3MB in the beginning and 6.8GB in the end (delta: 6.5GB). Free memory was 160.1MB in the beginning and 3.5GB in the end (delta: -3.3GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2023-12-09 15:17:21,157 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.10ms. Allocated memory is still 202.4MB. Free memory is still 156.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.05ms. Allocated memory is still 243.3MB. Free memory was 195.2MB in the beginning and 183.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.58ms. Allocated memory is still 243.3MB. Free memory was 183.7MB in the beginning and 181.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.43ms. Allocated memory is still 243.3MB. Free memory was 181.4MB in the beginning and 180.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 335.81ms. Allocated memory is still 243.3MB. Free memory was 179.9MB in the beginning and 161.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 252064.26ms. Allocated memory was 243.3MB in the beginning and 6.8GB in the end (delta: 6.5GB). Free memory was 160.1MB in the beginning and 3.5GB in the end (delta: -3.3GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (28states, 127/217 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 389242 conditions, 67052 events (32031/67051 cut-off events. For 1134976/1449705 co-relation queries the response was YES. Maximal size of possible extension queue 1590. Compared 746627 event pairs, 4391 based on Foata normal form. 244/65562 useless extension candidates. Maximal degree in co-relation 318880. Up to 35838 conditions per place.). - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (28states, 127/217 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 389242 conditions, 67052 events (32031/67051 cut-off events. For 1134976/1449705 co-relation queries the response was YES. Maximal size of possible extension queue 1590. Compared 746627 event pairs, 4391 based on Foata normal form. 244/65562 useless extension candidates. Maximal degree in co-relation 318880. Up to 35838 conditions per place.). - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (28states, 127/217 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 389242 conditions, 67052 events (32031/67051 cut-off events. For 1134976/1449705 co-relation queries the response was YES. Maximal size of possible extension queue 1590. Compared 746627 event pairs, 4391 based on Foata normal form. 244/65562 useless extension candidates. Maximal degree in co-relation 318880. Up to 35838 conditions per place.). - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (28states, 127/217 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 389242 conditions, 67052 events (32031/67051 cut-off events. For 1134976/1449705 co-relation queries the response was YES. Maximal size of possible extension queue 1590. Compared 746627 event pairs, 4391 based on Foata normal form. 244/65562 useless extension candidates. Maximal degree in co-relation 318880. Up to 35838 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 322 locations, 4 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: 251.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 246.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6486 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6486 mSDsluCounter, 33119 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31246 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12417 IncrementalHoareTripleChecker+Invalid, 12479 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 1873 mSDtfsCounter, 12417 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 881 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 798 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70363 ImplicationChecksByTransitivity, 20.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184189occurred in iteration=19, InterpolantAutomatonStates: 700, 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.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2500 NumberOfCodeBlocks, 2500 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2480 ConstructedInterpolants, 0 QuantifiedInterpolants, 7791 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown