/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 21:07:22,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 21:07:22,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-29 21:07:22,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 21:07:22,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 21:07:22,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 21:07:22,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 21:07:22,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 21:07:22,389 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 21:07:22,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 21:07:22,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 21:07:22,390 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 21:07:22,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 21:07:22,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 21:07:22,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 21:07:22,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 21:07:22,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 21:07:22,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 21:07:22,391 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 21:07:22,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 21:07:22,392 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 21:07:22,392 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 21:07:22,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 21:07:22,392 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 21:07:22,393 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 21:07:22,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 21:07:22,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 21:07:22,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 21:07:22,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 21:07:22,394 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 21:07:22,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 21:07:22,394 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 21:07:22,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 21:07:22,394 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-11-29 21:07:22,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 21:07:22,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 21:07:22,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 21:07:22,546 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 21:07:22,546 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 21:07:22,547 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-11-29 21:07:23,572 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 21:07:23,719 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 21:07:23,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2023-11-29 21:07:23,725 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e2c460df/211ea71bdfb641089d2690fc73f873d3/FLAG87eb7cb76 [2023-11-29 21:07:23,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e2c460df/211ea71bdfb641089d2690fc73f873d3 [2023-11-29 21:07:23,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 21:07:23,738 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 21:07:23,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 21:07:23,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 21:07:23,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 21:07:23,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:07:23" (1/1) ... [2023-11-29 21:07:23,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@307ca4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:07:23, skipping insertion in model container [2023-11-29 21:07:23,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:07:23" (1/1) ... [2023-11-29 21:07:23,757 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 21:07:23,858 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-11-29 21:07:23,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 21:07:23,877 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 21:07:23,892 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-11-29 21:07:23,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 21:07:23,907 INFO L206 MainTranslator]: Completed translation [2023-11-29 21:07:23,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:07:23 WrapperNode [2023-11-29 21:07:23,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 21:07:23,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 21:07:23,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 21:07:23,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 21:07:23,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:07:23" (1/1) ... [2023-11-29 21:07:23,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:07:23" (1/1) ... [2023-11-29 21:07:23,933 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 171 [2023-11-29 21:07:23,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 21:07:23,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 21:07:23,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 21:07:23,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 21:07:23,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:07:23" (1/1) ... [2023-11-29 21:07:23,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:07:23" (1/1) ... [2023-11-29 21:07:23,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:07:23" (1/1) ... [2023-11-29 21:07:23,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:07:23" (1/1) ... [2023-11-29 21:07:23,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:07:23" (1/1) ... [2023-11-29 21:07:23,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:07:23" (1/1) ... [2023-11-29 21:07:23,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:07:23" (1/1) ... [2023-11-29 21:07:23,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:07:23" (1/1) ... [2023-11-29 21:07:23,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 21:07:23,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 21:07:23,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 21:07:23,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 21:07:23,952 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:07:23" (1/1) ... [2023-11-29 21:07:23,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 21:07:23,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:07:23,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-29 21:07:23,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-29 21:07:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 21:07:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 21:07:24,004 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 21:07:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 21:07:24,005 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 21:07:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 21:07:24,005 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 21:07:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 21:07:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 21:07:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 21:07:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 21:07:24,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 21:07:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 21:07:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 21:07:24,006 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 21:07:24,076 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 21:07:24,077 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 21:07:24,281 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 21:07:24,290 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 21:07:24,290 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 21:07:24,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:07:24 BoogieIcfgContainer [2023-11-29 21:07:24,292 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 21:07:24,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 21:07:24,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 21:07:24,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 21:07:24,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 09:07:23" (1/3) ... [2023-11-29 21:07:24,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281cfdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 09:07:24, skipping insertion in model container [2023-11-29 21:07:24,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:07:23" (2/3) ... [2023-11-29 21:07:24,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281cfdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 09:07:24, skipping insertion in model container [2023-11-29 21:07:24,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:07:24" (3/3) ... [2023-11-29 21:07:24,297 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2023-11-29 21:07:24,309 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 21:07:24,309 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 21:07:24,309 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 21:07:24,378 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 21:07:24,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 217 transitions, 455 flow [2023-11-29 21:07:24,485 INFO L124 PetriNetUnfolderBase]: 13/214 cut-off events. [2023-11-29 21:07:24,485 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 21:07:24,490 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-11-29 21:07:24,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 214 places, 217 transitions, 455 flow [2023-11-29 21:07:24,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 203 transitions, 424 flow [2023-11-29 21:07:24,501 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 21:07:24,505 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;@45db7a51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 21:07:24,506 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-29 21:07:24,540 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 21:07:24,541 INFO L124 PetriNetUnfolderBase]: 13/202 cut-off events. [2023-11-29 21:07:24,541 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 21:07:24,541 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:07:24,542 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:07:24,542 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-11-29 21:07:24,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:07:24,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1717441816, now seen corresponding path program 1 times [2023-11-29 21:07:24,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:07:24,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841510189] [2023-11-29 21:07:24,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:07:24,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:07:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:07:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:07:25,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:07:25,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841510189] [2023-11-29 21:07:25,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841510189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:07:25,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:07:25,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 21:07:25,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46310562] [2023-11-29 21:07:25,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:07:25,114 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 21:07:25,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:07:25,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 21:07:25,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 21:07:25,141 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 217 [2023-11-29 21:07:25,146 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-11-29 21:07:25,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:07:25,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 217 [2023-11-29 21:07:25,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:07:25,441 INFO L124 PetriNetUnfolderBase]: 220/1293 cut-off events. [2023-11-29 21:07:25,442 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-11-29 21:07:25,451 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-11-29 21:07:25,456 INFO L140 encePairwiseOnDemand]: 201/217 looper letters, 61 selfloop transitions, 8 changer transitions 9/246 dead transitions. [2023-11-29 21:07:25,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 246 transitions, 714 flow [2023-11-29 21:07:25,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 21:07:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 21:07:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2280 transitions. [2023-11-29 21:07:25,470 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8755760368663594 [2023-11-29 21:07:25,470 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2280 transitions. [2023-11-29 21:07:25,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2280 transitions. [2023-11-29 21:07:25,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:07:25,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2280 transitions. [2023-11-29 21:07:25,480 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-11-29 21:07:25,486 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-11-29 21:07:25,487 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-11-29 21:07:25,490 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 11 predicate places. [2023-11-29 21:07:25,490 INFO L500 AbstractCegarLoop]: Abstraction has has 211 places, 246 transitions, 714 flow [2023-11-29 21:07:25,491 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-11-29 21:07:25,491 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:07:25,491 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:07:25,491 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 21:07:25,491 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-11-29 21:07:25,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:07:25,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1513451416, now seen corresponding path program 2 times [2023-11-29 21:07:25,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:07:25,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102163426] [2023-11-29 21:07:25,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:07:25,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:07:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:07:25,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:07:25,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:07:25,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102163426] [2023-11-29 21:07:25,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102163426] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:07:25,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:07:25,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 21:07:25,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629582383] [2023-11-29 21:07:25,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:07:25,764 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 21:07:25,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:07:25,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 21:07:25,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 21:07:25,767 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 217 [2023-11-29 21:07:25,768 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-11-29 21:07:25,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:07:25,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 217 [2023-11-29 21:07:25,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:07:26,510 INFO L124 PetriNetUnfolderBase]: 1221/5528 cut-off events. [2023-11-29 21:07:26,510 INFO L125 PetriNetUnfolderBase]: For 2211/2448 co-relation queries the response was YES. [2023-11-29 21:07:26,522 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-11-29 21:07:26,537 INFO L140 encePairwiseOnDemand]: 205/217 looper letters, 128 selfloop transitions, 16 changer transitions 75/397 dead transitions. [2023-11-29 21:07:26,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 397 transitions, 1906 flow [2023-11-29 21:07:26,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 21:07:26,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-29 21:07:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2786 transitions. [2023-11-29 21:07:26,542 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8559139784946237 [2023-11-29 21:07:26,542 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2786 transitions. [2023-11-29 21:07:26,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2786 transitions. [2023-11-29 21:07:26,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:07:26,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2786 transitions. [2023-11-29 21:07:26,547 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-11-29 21:07:26,551 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-11-29 21:07:26,553 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-11-29 21:07:26,553 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 25 predicate places. [2023-11-29 21:07:26,553 INFO L500 AbstractCegarLoop]: Abstraction has has 225 places, 397 transitions, 1906 flow [2023-11-29 21:07:26,554 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-11-29 21:07:26,554 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:07:26,554 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:07:26,554 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 21:07:26,555 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-11-29 21:07:26,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:07:26,556 INFO L85 PathProgramCache]: Analyzing trace with hash -248686122, now seen corresponding path program 3 times [2023-11-29 21:07:26,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:07:26,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832941123] [2023-11-29 21:07:26,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:07:26,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:07:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:07:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:07:26,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:07:26,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832941123] [2023-11-29 21:07:26,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832941123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:07:26,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:07:26,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 21:07:26,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703405844] [2023-11-29 21:07:26,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:07:26,691 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 21:07:26,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:07:26,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 21:07:26,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 21:07:26,693 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 217 [2023-11-29 21:07:26,693 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-11-29 21:07:26,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:07:26,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 217 [2023-11-29 21:07:26,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:07:27,399 INFO L124 PetriNetUnfolderBase]: 1597/6971 cut-off events. [2023-11-29 21:07:27,400 INFO L125 PetriNetUnfolderBase]: For 5784/7484 co-relation queries the response was YES. [2023-11-29 21:07:27,421 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-11-29 21:07:27,527 INFO L140 encePairwiseOnDemand]: 200/217 looper letters, 182 selfloop transitions, 24 changer transitions 107/498 dead transitions. [2023-11-29 21:07:27,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 498 transitions, 3229 flow [2023-11-29 21:07:27,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 21:07:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 21:07:27,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1880 transitions. [2023-11-29 21:07:27,531 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8663594470046083 [2023-11-29 21:07:27,531 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1880 transitions. [2023-11-29 21:07:27,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1880 transitions. [2023-11-29 21:07:27,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:07:27,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1880 transitions. [2023-11-29 21:07:27,534 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-11-29 21:07:27,537 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-11-29 21:07:27,537 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-11-29 21:07:27,538 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 34 predicate places. [2023-11-29 21:07:27,538 INFO L500 AbstractCegarLoop]: Abstraction has has 234 places, 498 transitions, 3229 flow [2023-11-29 21:07:27,538 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-11-29 21:07:27,538 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:07:27,538 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:07:27,539 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 21:07:27,539 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-11-29 21:07:27,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:07:27,539 INFO L85 PathProgramCache]: Analyzing trace with hash 155791650, now seen corresponding path program 4 times [2023-11-29 21:07:27,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:07:27,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980128991] [2023-11-29 21:07:27,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:07:27,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:07:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:07:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:07:27,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:07:27,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980128991] [2023-11-29 21:07:27,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980128991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:07:27,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:07:27,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 21:07:27,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776054025] [2023-11-29 21:07:27,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:07:27,708 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 21:07:27,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:07:27,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 21:07:27,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 21:07:27,711 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 217 [2023-11-29 21:07:27,713 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-11-29 21:07:27,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:07:27,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 217 [2023-11-29 21:07:27,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:07:28,497 INFO L124 PetriNetUnfolderBase]: 1659/7346 cut-off events. [2023-11-29 21:07:28,497 INFO L125 PetriNetUnfolderBase]: For 9689/14149 co-relation queries the response was YES. [2023-11-29 21:07:28,511 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-11-29 21:07:28,531 INFO L140 encePairwiseOnDemand]: 205/217 looper letters, 197 selfloop transitions, 23 changer transitions 132/537 dead transitions. [2023-11-29 21:07:28,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 537 transitions, 4295 flow [2023-11-29 21:07:28,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 21:07:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 21:07:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1685 transitions. [2023-11-29 21:07:28,534 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8627752176139273 [2023-11-29 21:07:28,535 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1685 transitions. [2023-11-29 21:07:28,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1685 transitions. [2023-11-29 21:07:28,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:07:28,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1685 transitions. [2023-11-29 21:07:28,538 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-11-29 21:07:28,539 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-11-29 21:07:28,540 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-11-29 21:07:28,541 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 42 predicate places. [2023-11-29 21:07:28,541 INFO L500 AbstractCegarLoop]: Abstraction has has 242 places, 537 transitions, 4295 flow [2023-11-29 21:07:28,542 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-11-29 21:07:28,542 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:07:28,542 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:07:28,542 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 21:07:28,542 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-11-29 21:07:28,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:07:28,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1563378142, now seen corresponding path program 5 times [2023-11-29 21:07:28,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:07:28,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621960967] [2023-11-29 21:07:28,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:07:28,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:07:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:07:28,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:07:28,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:07:28,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621960967] [2023-11-29 21:07:28,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621960967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:07:28,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:07:28,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 21:07:28,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052963660] [2023-11-29 21:07:28,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:07:28,749 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 21:07:28,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:07:28,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 21:07:28,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 21:07:28,752 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 217 [2023-11-29 21:07:28,753 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-11-29 21:07:28,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:07:28,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 217 [2023-11-29 21:07:28,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:07:29,667 INFO L124 PetriNetUnfolderBase]: 2067/9163 cut-off events. [2023-11-29 21:07:29,668 INFO L125 PetriNetUnfolderBase]: For 17034/24060 co-relation queries the response was YES. [2023-11-29 21:07:29,688 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-11-29 21:07:29,709 INFO L140 encePairwiseOnDemand]: 204/217 looper letters, 234 selfloop transitions, 25 changer transitions 174/618 dead transitions. [2023-11-29 21:07:29,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 618 transitions, 6043 flow [2023-11-29 21:07:29,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 21:07:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 21:07:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2071 transitions. [2023-11-29 21:07:29,713 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.867616254713029 [2023-11-29 21:07:29,713 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2071 transitions. [2023-11-29 21:07:29,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2071 transitions. [2023-11-29 21:07:29,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:07:29,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2071 transitions. [2023-11-29 21:07:29,717 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-11-29 21:07:29,720 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-11-29 21:07:29,720 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-11-29 21:07:29,722 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 52 predicate places. [2023-11-29 21:07:29,722 INFO L500 AbstractCegarLoop]: Abstraction has has 252 places, 618 transitions, 6043 flow [2023-11-29 21:07:29,723 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-11-29 21:07:29,723 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:07:29,723 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:07:29,723 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 21:07:29,723 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-11-29 21:07:29,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:07:29,724 INFO L85 PathProgramCache]: Analyzing trace with hash -347305760, now seen corresponding path program 6 times [2023-11-29 21:07:29,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:07:29,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459788165] [2023-11-29 21:07:29,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:07:29,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:07:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:07:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:07:29,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:07:29,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459788165] [2023-11-29 21:07:29,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459788165] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:07:29,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:07:29,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 21:07:29,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499863601] [2023-11-29 21:07:29,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:07:29,836 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 21:07:29,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:07:29,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 21:07:29,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 21:07:29,837 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 217 [2023-11-29 21:07:29,838 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-11-29 21:07:29,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:07:29,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 217 [2023-11-29 21:07:29,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:07:30,644 INFO L124 PetriNetUnfolderBase]: 2024/8827 cut-off events. [2023-11-29 21:07:30,644 INFO L125 PetriNetUnfolderBase]: For 23159/31374 co-relation queries the response was YES. [2023-11-29 21:07:30,684 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-11-29 21:07:30,715 INFO L140 encePairwiseOnDemand]: 205/217 looper letters, 217 selfloop transitions, 19 changer transitions 194/615 dead transitions. [2023-11-29 21:07:30,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 615 transitions, 6859 flow [2023-11-29 21:07:30,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 21:07:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 21:07:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1882 transitions. [2023-11-29 21:07:30,719 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8672811059907835 [2023-11-29 21:07:30,719 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1882 transitions. [2023-11-29 21:07:30,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1882 transitions. [2023-11-29 21:07:30,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:07:30,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1882 transitions. [2023-11-29 21:07:30,722 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-11-29 21:07:30,724 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-11-29 21:07:30,725 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-11-29 21:07:30,727 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 61 predicate places. [2023-11-29 21:07:30,727 INFO L500 AbstractCegarLoop]: Abstraction has has 261 places, 615 transitions, 6859 flow [2023-11-29 21:07:30,728 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-11-29 21:07:30,728 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:07:30,728 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:07:30,728 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 21:07:30,728 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-11-29 21:07:30,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:07:30,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2019127233, now seen corresponding path program 1 times [2023-11-29 21:07:30,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:07:30,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345900261] [2023-11-29 21:07:30,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:07:30,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:07:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:07:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:07:31,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:07:31,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345900261] [2023-11-29 21:07:31,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345900261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:07:31,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:07:31,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 21:07:31,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137102693] [2023-11-29 21:07:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:07:31,027 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 21:07:31,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:07:31,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 21:07:31,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 21:07:31,029 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 217 [2023-11-29 21:07:31,029 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-11-29 21:07:31,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:07:31,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 217 [2023-11-29 21:07:31,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:07:32,559 INFO L124 PetriNetUnfolderBase]: 3576/13609 cut-off events. [2023-11-29 21:07:32,562 INFO L125 PetriNetUnfolderBase]: For 54913/66915 co-relation queries the response was YES. [2023-11-29 21:07:32,596 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-11-29 21:07:32,636 INFO L140 encePairwiseOnDemand]: 204/217 looper letters, 307 selfloop transitions, 64 changer transitions 233/816 dead transitions. [2023-11-29 21:07:32,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 816 transitions, 11051 flow [2023-11-29 21:07:32,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 21:07:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 21:07:32,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1898 transitions. [2023-11-29 21:07:32,639 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8746543778801843 [2023-11-29 21:07:32,639 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1898 transitions. [2023-11-29 21:07:32,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1898 transitions. [2023-11-29 21:07:32,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:07:32,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1898 transitions. [2023-11-29 21:07:32,642 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-11-29 21:07:32,644 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-11-29 21:07:32,645 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-11-29 21:07:32,645 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 70 predicate places. [2023-11-29 21:07:32,645 INFO L500 AbstractCegarLoop]: Abstraction has has 270 places, 816 transitions, 11051 flow [2023-11-29 21:07:32,646 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-11-29 21:07:32,646 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:07:32,646 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:07:32,646 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 21:07:32,646 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-11-29 21:07:32,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:07:32,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1553747135, now seen corresponding path program 2 times [2023-11-29 21:07:32,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:07:32,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727703906] [2023-11-29 21:07:32,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:07:32,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:07:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:07:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:07:32,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:07:32,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727703906] [2023-11-29 21:07:32,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727703906] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:07:32,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:07:32,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 21:07:32,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77965426] [2023-11-29 21:07:32,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:07:32,745 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 21:07:32,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:07:32,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 21:07:32,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 21:07:32,746 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 217 [2023-11-29 21:07:32,752 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-11-29 21:07:32,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:07:32,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 217 [2023-11-29 21:07:32,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:07:34,297 INFO L124 PetriNetUnfolderBase]: 3634/14308 cut-off events. [2023-11-29 21:07:34,298 INFO L125 PetriNetUnfolderBase]: For 72733/84466 co-relation queries the response was YES. [2023-11-29 21:07:34,348 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-11-29 21:07:34,385 INFO L140 encePairwiseOnDemand]: 206/217 looper letters, 240 selfloop transitions, 16 changer transitions 436/903 dead transitions. [2023-11-29 21:07:34,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 903 transitions, 13915 flow [2023-11-29 21:07:34,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 21:07:34,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 21:07:34,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2080 transitions. [2023-11-29 21:07:34,389 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8713866778382907 [2023-11-29 21:07:34,389 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2080 transitions. [2023-11-29 21:07:34,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2080 transitions. [2023-11-29 21:07:34,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:07:34,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2080 transitions. [2023-11-29 21:07:34,392 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-11-29 21:07:34,395 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-11-29 21:07:34,395 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-11-29 21:07:34,395 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 80 predicate places. [2023-11-29 21:07:34,396 INFO L500 AbstractCegarLoop]: Abstraction has has 280 places, 903 transitions, 13915 flow [2023-11-29 21:07:34,396 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-11-29 21:07:34,396 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:07:34,396 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:07:34,396 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 21:07:34,396 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-11-29 21:07:34,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:07:34,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1509947999, now seen corresponding path program 1 times [2023-11-29 21:07:34,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:07:34,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935059897] [2023-11-29 21:07:34,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:07:34,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:07:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:07:34,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:07:34,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:07:34,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935059897] [2023-11-29 21:07:34,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935059897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:07:34,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:07:34,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 21:07:34,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867124848] [2023-11-29 21:07:34,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:07:34,420 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 21:07:34,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:07:34,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 21:07:34,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 21:07:34,421 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 217 [2023-11-29 21:07:34,422 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-11-29 21:07:34,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:07:34,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 217 [2023-11-29 21:07:34,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:07:34,610 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-11-29 21:07:34,611 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-11-29 21:07:34,611 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:07:34,611 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:07:34,611 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:07:34,611 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-11-29 21:07:34,611 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-11-29 21:07:34,611 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:07:34,611 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:07:34,611 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:07:35,109 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-11-29 21:07:35,110 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 21:07:35,110 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-29 21:07:35,110 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:07:35,110 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:07:35,110 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-11-29 21:07:35,110 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 21:07:35,110 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-29 21:07:35,110 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:07:35,110 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:07:36,777 INFO L124 PetriNetUnfolderBase]: 4970/18998 cut-off events. [2023-11-29 21:07:36,777 INFO L125 PetriNetUnfolderBase]: For 141289/164418 co-relation queries the response was YES. [2023-11-29 21:07:36,826 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-11-29 21:07:36,874 INFO L140 encePairwiseOnDemand]: 213/217 looper letters, 215 selfloop transitions, 2 changer transitions 421/977 dead transitions. [2023-11-29 21:07:36,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 977 transitions, 16209 flow [2023-11-29 21:07:36,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 21:07:36,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 21:07:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 612 transitions. [2023-11-29 21:07:36,876 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9400921658986175 [2023-11-29 21:07:36,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 612 transitions. [2023-11-29 21:07:36,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 612 transitions. [2023-11-29 21:07:36,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:07:36,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 612 transitions. [2023-11-29 21:07:36,877 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-11-29 21:07:36,878 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-11-29 21:07:36,878 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-11-29 21:07:36,878 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 82 predicate places. [2023-11-29 21:07:36,878 INFO L500 AbstractCegarLoop]: Abstraction has has 282 places, 977 transitions, 16209 flow [2023-11-29 21:07:36,878 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-11-29 21:07:36,878 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:07:36,878 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:07:36,879 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 21:07:36,879 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-11-29 21:07:36,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:07:36,879 INFO L85 PathProgramCache]: Analyzing trace with hash -512679029, now seen corresponding path program 2 times [2023-11-29 21:07:36,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:07:36,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006841886] [2023-11-29 21:07:36,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:07:36,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:07:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:07:36,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:07:36,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:07:36,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006841886] [2023-11-29 21:07:36,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006841886] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:07:36,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:07:36,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 21:07:36,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490776808] [2023-11-29 21:07:36,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:07:36,905 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 21:07:36,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:07:36,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 21:07:36,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 21:07:36,906 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 217 [2023-11-29 21:07:36,907 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-11-29 21:07:36,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:07:36,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 217 [2023-11-29 21:07:36,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:07:38,285 INFO L124 PetriNetUnfolderBase]: 3363/13190 cut-off events. [2023-11-29 21:07:38,285 INFO L125 PetriNetUnfolderBase]: For 136110/155667 co-relation queries the response was YES. [2023-11-29 21:07:38,332 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-11-29 21:07:38,370 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 133 selfloop transitions, 4 changer transitions 459/913 dead transitions. [2023-11-29 21:07:38,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 913 transitions, 15405 flow [2023-11-29 21:07:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 21:07:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 21:07:38,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 612 transitions. [2023-11-29 21:07:38,372 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9400921658986175 [2023-11-29 21:07:38,372 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 612 transitions. [2023-11-29 21:07:38,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 612 transitions. [2023-11-29 21:07:38,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:07:38,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 612 transitions. [2023-11-29 21:07:38,373 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-11-29 21:07:38,374 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-11-29 21:07:38,374 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-11-29 21:07:38,375 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 84 predicate places. [2023-11-29 21:07:38,375 INFO L500 AbstractCegarLoop]: Abstraction has has 284 places, 913 transitions, 15405 flow [2023-11-29 21:07:38,375 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-11-29 21:07:38,375 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:07:38,375 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:07:38,375 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 21:07:38,375 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-11-29 21:07:38,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:07:38,376 INFO L85 PathProgramCache]: Analyzing trace with hash 531259536, now seen corresponding path program 1 times [2023-11-29 21:07:38,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:07:38,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850794090] [2023-11-29 21:07:38,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:07:38,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:07:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:07:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:07:38,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:07:38,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850794090] [2023-11-29 21:07:38,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850794090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:07:38,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:07:38,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 21:07:38,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800054785] [2023-11-29 21:07:38,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:07:38,608 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 21:07:38,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:07:38,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 21:07:38,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 21:07:38,610 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 217 [2023-11-29 21:07:38,611 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-11-29 21:07:38,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:07:38,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 217 [2023-11-29 21:07:38,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:07:40,436 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-11-29 21:07:40,437 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-29 21:07:40,437 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 21:07:40,437 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 21:07:40,437 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 21:07:40,714 INFO L124 PetriNetUnfolderBase]: 4258/16457 cut-off events. [2023-11-29 21:07:40,715 INFO L125 PetriNetUnfolderBase]: For 207418/250204 co-relation queries the response was YES. [2023-11-29 21:07:40,767 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-11-29 21:07:40,802 INFO L140 encePairwiseOnDemand]: 208/217 looper letters, 124 selfloop transitions, 2 changer transitions 590/970 dead transitions. [2023-11-29 21:07:40,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 970 transitions, 17883 flow [2023-11-29 21:07:40,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 21:07:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 21:07:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1923 transitions. [2023-11-29 21:07:40,805 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8861751152073732 [2023-11-29 21:07:40,805 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1923 transitions. [2023-11-29 21:07:40,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1923 transitions. [2023-11-29 21:07:40,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:07:40,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1923 transitions. [2023-11-29 21:07:40,808 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-11-29 21:07:40,810 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-11-29 21:07:40,811 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-11-29 21:07:40,811 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 93 predicate places. [2023-11-29 21:07:40,811 INFO L500 AbstractCegarLoop]: Abstraction has has 293 places, 970 transitions, 17883 flow [2023-11-29 21:07:40,811 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-11-29 21:07:40,811 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:07:40,812 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:07:40,812 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 21:07:40,812 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-11-29 21:07:40,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:07:40,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1929700756, now seen corresponding path program 1 times [2023-11-29 21:07:40,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:07:40,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577235302] [2023-11-29 21:07:40,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:07:40,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:07:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:07:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:07:40,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:07:40,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577235302] [2023-11-29 21:07:40,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577235302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:07:40,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:07:40,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 21:07:40,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474426064] [2023-11-29 21:07:40,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:07:40,905 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 21:07:40,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:07:40,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 21:07:40,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 21:07:40,906 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 217 [2023-11-29 21:07:40,907 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-11-29 21:07:40,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:07:40,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 217 [2023-11-29 21:07:40,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:07:42,078 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-11-29 21:07:42,079 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is not cut-off event [2023-11-29 21:07:42,079 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-11-29 21:07:42,079 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-11-29 21:07:42,079 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-11-29 21:07:43,952 INFO L124 PetriNetUnfolderBase]: 5567/22567 cut-off events. [2023-11-29 21:07:43,952 INFO L125 PetriNetUnfolderBase]: For 292244/325164 co-relation queries the response was YES. [2023-11-29 21:07:44,032 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-11-29 21:07:44,083 INFO L140 encePairwiseOnDemand]: 202/217 looper letters, 256 selfloop transitions, 27 changer transitions 761/1235 dead transitions. [2023-11-29 21:07:44,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 1235 transitions, 25335 flow [2023-11-29 21:07:44,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 21:07:44,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 21:07:44,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2052 transitions. [2023-11-29 21:07:44,085 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8596564725596983 [2023-11-29 21:07:44,085 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2052 transitions. [2023-11-29 21:07:44,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2052 transitions. [2023-11-29 21:07:44,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:07:44,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2052 transitions. [2023-11-29 21:07:44,088 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-11-29 21:07:44,091 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-11-29 21:07:44,091 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-11-29 21:07:44,092 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 103 predicate places. [2023-11-29 21:07:44,092 INFO L500 AbstractCegarLoop]: Abstraction has has 303 places, 1235 transitions, 25335 flow [2023-11-29 21:07:44,092 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-11-29 21:07:44,092 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:07:44,092 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:07:44,093 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 21:07:44,093 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-11-29 21:07:44,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:07:44,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1769251496, now seen corresponding path program 2 times [2023-11-29 21:07:44,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:07:44,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338009295] [2023-11-29 21:07:44,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:07:44,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:07:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:07:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:07:44,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:07:44,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338009295] [2023-11-29 21:07:44,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338009295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:07:44,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:07:44,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 21:07:44,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183746014] [2023-11-29 21:07:44,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:07:44,420 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 21:07:44,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:07:44,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 21:07:44,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 21:07:44,421 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 217 [2023-11-29 21:07:44,422 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-11-29 21:07:44,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:07:44,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 217 [2023-11-29 21:07:44,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:07:47,876 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-11-29 21:07:47,876 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2023-11-29 21:07:47,876 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 21:07:47,876 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 21:07:47,876 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 21:07:48,209 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-11-29 21:07:48,209 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2023-11-29 21:07:48,209 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-29 21:07:48,209 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-29 21:07:48,209 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-29 21:07:48,213 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-11-29 21:07:48,213 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 21:07:48,213 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 21:07:48,213 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 21:07:48,213 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 21:07:48,233 INFO L124 PetriNetUnfolderBase]: 5645/22878 cut-off events. [2023-11-29 21:07:48,234 INFO L125 PetriNetUnfolderBase]: For 381182/466393 co-relation queries the response was YES. [2023-11-29 21:07:48,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100544 conditions, 22878 events. 5645/22878 cut-off events. For 381182/466393 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-11-29 21:07:48,395 INFO L140 encePairwiseOnDemand]: 209/217 looper letters, 245 selfloop transitions, 22 changer transitions 910/1421 dead transitions. [2023-11-29 21:07:48,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 1421 transitions, 32384 flow [2023-11-29 21:07:48,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 21:07:48,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 21:07:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2085 transitions. [2023-11-29 21:07:48,397 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8734813573523251 [2023-11-29 21:07:48,397 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2085 transitions. [2023-11-29 21:07:48,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2085 transitions. [2023-11-29 21:07:48,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:07:48,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2085 transitions. [2023-11-29 21:07:48,400 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-11-29 21:07:48,401 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-11-29 21:07:48,402 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-11-29 21:07:48,402 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 113 predicate places. [2023-11-29 21:07:48,402 INFO L500 AbstractCegarLoop]: Abstraction has has 313 places, 1421 transitions, 32384 flow [2023-11-29 21:07:48,402 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-11-29 21:07:48,402 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:07:48,403 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:07:48,403 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 21:07:48,403 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-11-29 21:07:48,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:07:48,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1480232134, now seen corresponding path program 3 times [2023-11-29 21:07:48,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:07:48,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619474269] [2023-11-29 21:07:48,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:07:48,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:07:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:07:48,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:07:48,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:07:48,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619474269] [2023-11-29 21:07:48,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619474269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:07:48,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:07:48,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 21:07:48,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611853943] [2023-11-29 21:07:48,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:07:48,506 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 21:07:48,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:07:48,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 21:07:48,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 21:07:48,507 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 217 [2023-11-29 21:07:48,507 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-11-29 21:07:48,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:07:48,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 217 [2023-11-29 21:07:48,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:07:49,459 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-11-29 21:07:49,459 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-29 21:07:49,459 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-29 21:07:49,459 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-29 21:07:49,459 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-29 21:07:51,290 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-11-29 21:07:51,290 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-11-29 21:07:51,290 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 21:07:51,290 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 21:07:51,290 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 21:07:51,372 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-11-29 21:07:51,372 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is not cut-off event [2023-11-29 21:07:51,372 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is not cut-off event [2023-11-29 21:07:51,372 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is not cut-off event [2023-11-29 21:07:51,372 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is not cut-off event [2023-11-29 21:07:52,686 INFO L124 PetriNetUnfolderBase]: 5792/24028 cut-off events. [2023-11-29 21:07:52,686 INFO L125 PetriNetUnfolderBase]: For 412896/508886 co-relation queries the response was YES. [2023-11-29 21:07:52,767 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-11-29 21:07:52,816 INFO L140 encePairwiseOnDemand]: 206/217 looper letters, 240 selfloop transitions, 14 changer transitions 997/1441 dead transitions. [2023-11-29 21:07:52,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 1441 transitions, 35344 flow [2023-11-29 21:07:52,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 21:07:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 21:07:52,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2049 transitions. [2023-11-29 21:07:52,818 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8583996648512777 [2023-11-29 21:07:52,818 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2049 transitions. [2023-11-29 21:07:52,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2049 transitions. [2023-11-29 21:07:52,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:07:52,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2049 transitions. [2023-11-29 21:07:52,821 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-11-29 21:07:52,822 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-11-29 21:07:52,823 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-11-29 21:07:52,823 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 123 predicate places. [2023-11-29 21:07:52,823 INFO L500 AbstractCegarLoop]: Abstraction has has 323 places, 1441 transitions, 35344 flow [2023-11-29 21:07:52,823 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-11-29 21:07:52,823 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:07:52,824 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:07:52,824 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 21:07:52,824 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-11-29 21:07:52,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:07:52,824 INFO L85 PathProgramCache]: Analyzing trace with hash -272972626, now seen corresponding path program 4 times [2023-11-29 21:07:52,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:07:52,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842464173] [2023-11-29 21:07:52,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:07:52,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:07:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:07:52,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:07:52,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:07:52,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842464173] [2023-11-29 21:07:52,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842464173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:07:52,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:07:52,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 21:07:52,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598279841] [2023-11-29 21:07:52,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:07:52,934 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 21:07:52,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:07:52,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 21:07:52,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 21:07:52,935 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 217 [2023-11-29 21:07:52,936 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-11-29 21:07:52,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:07:52,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 217 [2023-11-29 21:07:52,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:07:56,855 INFO L124 PetriNetUnfolderBase]: 5733/23498 cut-off events. [2023-11-29 21:07:56,856 INFO L125 PetriNetUnfolderBase]: For 466866/546512 co-relation queries the response was YES. [2023-11-29 21:07:56,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115812 conditions, 23498 events. 5733/23498 cut-off events. For 466866/546512 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-11-29 21:07:57,010 INFO L140 encePairwiseOnDemand]: 209/217 looper letters, 161 selfloop transitions, 0 changer transitions 1069/1435 dead transitions. [2023-11-29 21:07:57,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 1435 transitions, 37356 flow [2023-11-29 21:07:57,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 21:07:57,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 21:07:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1703 transitions. [2023-11-29 21:07:57,028 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8719918074756784 [2023-11-29 21:07:57,028 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1703 transitions. [2023-11-29 21:07:57,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1703 transitions. [2023-11-29 21:07:57,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:07:57,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1703 transitions. [2023-11-29 21:07:57,030 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-11-29 21:07:57,032 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-11-29 21:07:57,032 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-11-29 21:07:57,032 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 131 predicate places. [2023-11-29 21:07:57,032 INFO L500 AbstractCegarLoop]: Abstraction has has 331 places, 1435 transitions, 37356 flow [2023-11-29 21:07:57,040 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-11-29 21:07:57,040 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:07:57,040 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:07:57,040 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 21:07:57,041 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-11-29 21:07:57,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:07:57,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1219111073, now seen corresponding path program 1 times [2023-11-29 21:07:57,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:07:57,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229207380] [2023-11-29 21:07:57,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:07:57,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:07:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:07:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:07:57,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:07:57,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229207380] [2023-11-29 21:07:57,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229207380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:07:57,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:07:57,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 21:07:57,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219061400] [2023-11-29 21:07:57,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:07:57,069 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 21:07:57,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:07:57,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 21:07:57,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 21:07:57,070 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 217 [2023-11-29 21:07:57,071 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-11-29 21:07:57,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:07:57,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 217 [2023-11-29 21:07:57,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:07:58,899 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-11-29 21:07:58,899 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-29 21:07:58,899 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-29 21:07:58,900 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-29 21:07:58,900 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-29 21:07:59,069 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-11-29 21:07:59,069 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is not cut-off event [2023-11-29 21:07:59,069 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2023-11-29 21:07:59,070 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2023-11-29 21:07:59,070 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2023-11-29 21:07:59,188 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-11-29 21:07:59,189 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 21:07:59,189 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 21:07:59,189 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 21:07:59,189 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 21:07:59,265 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-11-29 21:07:59,265 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is not cut-off event [2023-11-29 21:07:59,265 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2023-11-29 21:07:59,265 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2023-11-29 21:07:59,265 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2023-11-29 21:07:59,932 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-11-29 21:07:59,932 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2023-11-29 21:07:59,932 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 21:07:59,932 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 21:07:59,932 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 21:08:00,033 INFO L124 PetriNetUnfolderBase]: 4543/18044 cut-off events. [2023-11-29 21:08:00,034 INFO L125 PetriNetUnfolderBase]: For 423246/468704 co-relation queries the response was YES. [2023-11-29 21:08:00,106 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-11-29 21:08:00,145 INFO L140 encePairwiseOnDemand]: 213/217 looper letters, 42 selfloop transitions, 2 changer transitions 974/1240 dead transitions. [2023-11-29 21:08:00,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 1240 transitions, 32757 flow [2023-11-29 21:08:00,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 21:08:00,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 21:08:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2023-11-29 21:08:00,159 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9385560675883257 [2023-11-29 21:08:00,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 611 transitions. [2023-11-29 21:08:00,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 611 transitions. [2023-11-29 21:08:00,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:08:00,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 611 transitions. [2023-11-29 21:08:00,160 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-11-29 21:08:00,161 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-11-29 21:08:00,161 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-11-29 21:08:00,161 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 133 predicate places. [2023-11-29 21:08:00,161 INFO L500 AbstractCegarLoop]: Abstraction has has 333 places, 1240 transitions, 32757 flow [2023-11-29 21:08:00,162 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-11-29 21:08:00,162 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:08:00,162 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:08:00,162 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 21:08:00,162 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-11-29 21:08:00,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:08:00,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2050031697, now seen corresponding path program 1 times [2023-11-29 21:08:00,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:08:00,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783551444] [2023-11-29 21:08:00,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:08:00,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:08:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:08:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:08:00,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:08:00,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783551444] [2023-11-29 21:08:00,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783551444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:08:00,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:08:00,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 21:08:00,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702489659] [2023-11-29 21:08:00,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:08:00,188 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 21:08:00,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:08:00,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 21:08:00,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 21:08:00,189 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 217 [2023-11-29 21:08:00,189 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-11-29 21:08:00,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:08:00,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 217 [2023-11-29 21:08:00,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:08:02,038 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-11-29 21:08:02,038 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-29 21:08:02,038 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 21:08:02,038 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 21:08:02,038 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 21:08:02,416 INFO L124 PetriNetUnfolderBase]: 3651/14547 cut-off events. [2023-11-29 21:08:02,416 INFO L125 PetriNetUnfolderBase]: For 432079/504151 co-relation queries the response was YES. [2023-11-29 21:08:02,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80813 conditions, 14547 events. 3651/14547 cut-off events. For 432079/504151 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-11-29 21:08:02,506 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 60 selfloop transitions, 8 changer transitions 874/1183 dead transitions. [2023-11-29 21:08:02,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 1183 transitions, 32414 flow [2023-11-29 21:08:02,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 21:08:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 21:08:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2023-11-29 21:08:02,507 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2023-11-29 21:08:02,507 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 609 transitions. [2023-11-29 21:08:02,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 609 transitions. [2023-11-29 21:08:02,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:08:02,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 609 transitions. [2023-11-29 21:08:02,508 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-11-29 21:08:02,524 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-11-29 21:08:02,524 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-11-29 21:08:02,525 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 135 predicate places. [2023-11-29 21:08:02,525 INFO L500 AbstractCegarLoop]: Abstraction has has 335 places, 1183 transitions, 32414 flow [2023-11-29 21:08:02,525 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-11-29 21:08:02,525 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:08:02,526 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:08:02,526 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 21:08:02,526 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-11-29 21:08:02,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:08:02,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2080037600, now seen corresponding path program 1 times [2023-11-29 21:08:02,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:08:02,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335897349] [2023-11-29 21:08:02,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:08:02,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:08:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:08:03,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:08:03,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:08:03,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335897349] [2023-11-29 21:08:03,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335897349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:08:03,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:08:03,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-11-29 21:08:03,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632550194] [2023-11-29 21:08:03,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:08:03,241 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 21:08:03,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:08:03,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 21:08:03,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2023-11-29 21:08:03,244 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 217 [2023-11-29 21:08:03,246 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-11-29 21:08:03,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:08:03,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 217 [2023-11-29 21:08:03,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:08:32,252 INFO L124 PetriNetUnfolderBase]: 42045/87197 cut-off events. [2023-11-29 21:08:32,253 INFO L125 PetriNetUnfolderBase]: For 1206107/1242064 co-relation queries the response was YES. [2023-11-29 21:08:32,649 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-11-29 21:08:32,896 INFO L140 encePairwiseOnDemand]: 174/217 looper letters, 1727 selfloop transitions, 125 changer transitions 2097/4070 dead transitions. [2023-11-29 21:08:32,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 4070 transitions, 72942 flow [2023-11-29 21:08:32,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 280 states. [2023-11-29 21:08:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2023-11-29 21:08:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 37946 transitions. [2023-11-29 21:08:32,944 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6245227123107308 [2023-11-29 21:08:32,945 INFO L72 ComplementDD]: Start complementDD. Operand 280 states and 37946 transitions. [2023-11-29 21:08:32,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 280 states and 37946 transitions. [2023-11-29 21:08:32,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:08:32,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 280 states and 37946 transitions. [2023-11-29 21:08:32,984 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-11-29 21:08:33,026 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-11-29 21:08:33,038 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-11-29 21:08:33,039 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 414 predicate places. [2023-11-29 21:08:33,039 INFO L500 AbstractCegarLoop]: Abstraction has has 614 places, 4070 transitions, 72942 flow [2023-11-29 21:08:33,039 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-11-29 21:08:33,039 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:08:33,039 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:08:33,040 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 21:08:33,040 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-11-29 21:08:33,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:08:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1556593694, now seen corresponding path program 2 times [2023-11-29 21:08:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:08:33,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004238981] [2023-11-29 21:08:33,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:08:33,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:08:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:08:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:08:33,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:08:33,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004238981] [2023-11-29 21:08:33,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004238981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:08:33,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:08:33,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-11-29 21:08:33,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307981416] [2023-11-29 21:08:33,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:08:33,585 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 21:08:33,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:08:33,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 21:08:33,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2023-11-29 21:08:33,587 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 217 [2023-11-29 21:08:33,589 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-11-29 21:08:33,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:08:33,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 217 [2023-11-29 21:08:33,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:09:25,597 INFO L124 PetriNetUnfolderBase]: 50445/102387 cut-off events. [2023-11-29 21:09:25,597 INFO L125 PetriNetUnfolderBase]: For 1526784/1783700 co-relation queries the response was YES. [2023-11-29 21:09:26,089 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-11-29 21:09:26,480 INFO L140 encePairwiseOnDemand]: 174/217 looper letters, 6928 selfloop transitions, 1596 changer transitions 3256/11904 dead transitions. [2023-11-29 21:09:26,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 881 places, 11904 transitions, 184189 flow [2023-11-29 21:09:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 268 states. [2023-11-29 21:09:26,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2023-11-29 21:09:26,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 36094 transitions. [2023-11-29 21:09:26,497 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6206410344590412 [2023-11-29 21:09:26,497 INFO L72 ComplementDD]: Start complementDD. Operand 268 states and 36094 transitions. [2023-11-29 21:09:26,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 36094 transitions. [2023-11-29 21:09:26,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:09:26,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 268 states and 36094 transitions. [2023-11-29 21:09:26,528 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-11-29 21:09:26,563 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-11-29 21:09:26,573 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-11-29 21:09:26,574 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 681 predicate places. [2023-11-29 21:09:26,574 INFO L500 AbstractCegarLoop]: Abstraction has has 881 places, 11904 transitions, 184189 flow [2023-11-29 21:09:26,575 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-11-29 21:09:26,575 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:09:26,575 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:09:26,575 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 21:09:26,575 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-11-29 21:09:26,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:09:26,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1717034292, now seen corresponding path program 3 times [2023-11-29 21:09:26,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:09:26,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677785403] [2023-11-29 21:09:26,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:09:26,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:09:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:09:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:09:27,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:09:27,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677785403] [2023-11-29 21:09:27,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677785403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:09:27,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:09:27,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-11-29 21:09:27,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511775118] [2023-11-29 21:09:27,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:09:27,112 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 21:09:27,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:09:27,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 21:09:27,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2023-11-29 21:09:27,115 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 217 [2023-11-29 21:09:27,116 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-11-29 21:09:27,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:09:27,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 217 [2023-11-29 21:09:27,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:11:29,827 INFO L124 PetriNetUnfolderBase]: 55666/112229 cut-off events. [2023-11-29 21:11:29,827 INFO L125 PetriNetUnfolderBase]: For 1635555/1950575 co-relation queries the response was YES. [2023-11-29 21:11:30,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653871 conditions, 112229 events. 55666/112229 cut-off events. For 1635555/1950575 co-relation queries the response was YES. Maximal size of possible extension queue 1590. Compared 1187152 event pairs, 4444 based on Foata normal form. 254/109084 useless extension candidates. Maximal degree in co-relation 522644. Up to 61948 conditions per place. [2023-11-29 21:11:30,989 INFO L140 encePairwiseOnDemand]: 174/217 looper letters, 10617 selfloop transitions, 1375 changer transitions 3460/15576 dead transitions. [2023-11-29 21:11:30,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 944 places, 15576 transitions, 244846 flow [2023-11-29 21:11:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-11-29 21:11:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2023-11-29 21:11:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 8986 transitions. [2023-11-29 21:11:30,994 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6470334101382489 [2023-11-29 21:11:30,994 INFO L72 ComplementDD]: Start complementDD. Operand 64 states and 8986 transitions. [2023-11-29 21:11:30,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 8986 transitions. [2023-11-29 21:11:30,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:11:30,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 64 states and 8986 transitions. [2023-11-29 21:11:31,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 65 states, 64 states have (on average 140.40625) internal successors, (8986), 64 states have internal predecessors, (8986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:11:31,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 65 states, 65 states have (on average 217.0) internal successors, (14105), 65 states have internal predecessors, (14105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:11:31,009 INFO L81 ComplementDD]: Finished complementDD. Result has 65 states, 65 states have (on average 217.0) internal successors, (14105), 65 states have internal predecessors, (14105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:11:31,009 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 744 predicate places. [2023-11-29 21:11:31,009 INFO L500 AbstractCegarLoop]: Abstraction has has 944 places, 15576 transitions, 244846 flow [2023-11-29 21:11:31,010 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-11-29 21:11:31,010 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:11:31,010 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:11:31,010 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 21:11:31,010 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:11:31,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:11:31,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1402060904, now seen corresponding path program 4 times [2023-11-29 21:11:31,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:11:31,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359217579] [2023-11-29 21:11:31,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:11:31,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:11:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:11:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:11:31,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:11:31,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359217579] [2023-11-29 21:11:31,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359217579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:11:31,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:11:31,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-11-29 21:11:31,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875547692] [2023-11-29 21:11:31,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:11:31,524 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 21:11:31,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:11:31,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 21:11:31,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2023-11-29 21:11:31,526 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 217 [2023-11-29 21:11:31,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 944 places, 15576 transitions, 244846 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-11-29 21:11:31,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:11:31,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 217 [2023-11-29 21:11:31,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:14:54,666 INFO L124 PetriNetUnfolderBase]: 63075/126431 cut-off events. [2023-11-29 21:14:54,666 INFO L125 PetriNetUnfolderBase]: For 1637872/1767516 co-relation queries the response was YES. [2023-11-29 21:14:55,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816637 conditions, 126431 events. 63075/126431 cut-off events. For 1637872/1767516 co-relation queries the response was YES. Maximal size of possible extension queue 1865. Compared 1353772 event pairs, 3875 based on Foata normal form. 420/123112 useless extension candidates. Maximal degree in co-relation 673140. Up to 63003 conditions per place. [2023-11-29 21:14:56,045 INFO L140 encePairwiseOnDemand]: 172/217 looper letters, 14293 selfloop transitions, 2866 changer transitions 3686/20969 dead transitions. [2023-11-29 21:14:56,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1011 places, 20969 transitions, 340961 flow [2023-11-29 21:14:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-11-29 21:14:56,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2023-11-29 21:14:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 9562 transitions. [2023-11-29 21:14:56,050 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6480075901328273 [2023-11-29 21:14:56,050 INFO L72 ComplementDD]: Start complementDD. Operand 68 states and 9562 transitions. [2023-11-29 21:14:56,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 9562 transitions. [2023-11-29 21:14:56,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:14:56,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 68 states and 9562 transitions. [2023-11-29 21:14:56,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 69 states, 68 states have (on average 140.61764705882354) internal successors, (9562), 68 states have internal predecessors, (9562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:14:56,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 69 states, 69 states have (on average 217.0) internal successors, (14973), 69 states have internal predecessors, (14973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:14:56,064 INFO L81 ComplementDD]: Finished complementDD. Result has 69 states, 69 states have (on average 217.0) internal successors, (14973), 69 states have internal predecessors, (14973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:14:56,064 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 811 predicate places. [2023-11-29 21:14:56,064 INFO L500 AbstractCegarLoop]: Abstraction has has 1011 places, 20969 transitions, 340961 flow [2023-11-29 21:14:56,064 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-11-29 21:14:56,064 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:14:56,065 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:14:56,065 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 21:14:56,065 INFO L425 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:14:56,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:14:56,065 INFO L85 PathProgramCache]: Analyzing trace with hash -834717622, now seen corresponding path program 5 times [2023-11-29 21:14:56,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:14:56,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460649677] [2023-11-29 21:14:56,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:14:56,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:14:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:14:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:14:56,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:14:56,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460649677] [2023-11-29 21:14:56,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460649677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:14:56,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:14:56,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-11-29 21:14:56,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569330297] [2023-11-29 21:14:56,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:14:56,561 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 21:14:56,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:14:56,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 21:14:56,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2023-11-29 21:14:56,564 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 217 [2023-11-29 21:14:56,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1011 places, 20969 transitions, 340961 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-11-29 21:14:56,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:14:56,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 217 [2023-11-29 21:14:56,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:20:49,833 INFO L124 PetriNetUnfolderBase]: 73862/146959 cut-off events. [2023-11-29 21:20:49,833 INFO L125 PetriNetUnfolderBase]: For 1783430/1959781 co-relation queries the response was YES. [2023-11-29 21:20:50,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037921 conditions, 146959 events. 73862/146959 cut-off events. For 1783430/1959781 co-relation queries the response was YES. Maximal size of possible extension queue 2313. Compared 1589136 event pairs, 4065 based on Foata normal form. 855/143521 useless extension candidates. Maximal degree in co-relation 882106. Up to 63940 conditions per place. [2023-11-29 21:20:51,898 INFO L140 encePairwiseOnDemand]: 174/217 looper letters, 20542 selfloop transitions, 4236 changer transitions 3895/28800 dead transitions. [2023-11-29 21:20:51,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1083 places, 28800 transitions, 492304 flow [2023-11-29 21:20:51,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-29 21:20:51,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2023-11-29 21:20:51,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 10306 transitions. [2023-11-29 21:20:51,903 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.650590240515119 [2023-11-29 21:20:51,903 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 10306 transitions. [2023-11-29 21:20:51,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 10306 transitions. [2023-11-29 21:20:51,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:20:51,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 10306 transitions. [2023-11-29 21:20:51,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 74 states, 73 states have (on average 141.17808219178082) internal successors, (10306), 73 states have internal predecessors, (10306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:20:51,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 74 states, 74 states have (on average 217.0) internal successors, (16058), 74 states have internal predecessors, (16058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:20:51,918 INFO L81 ComplementDD]: Finished complementDD. Result has 74 states, 74 states have (on average 217.0) internal successors, (16058), 74 states have internal predecessors, (16058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:20:51,918 INFO L307 CegarLoopForPetriNet]: 200 programPoint places, 883 predicate places. [2023-11-29 21:20:51,918 INFO L500 AbstractCegarLoop]: Abstraction has has 1083 places, 28800 transitions, 492304 flow [2023-11-29 21:20:51,919 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-11-29 21:20:51,919 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:20:51,919 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:20:51,919 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 21:20:51,919 INFO L425 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:20:51,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:20:51,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1898025212, now seen corresponding path program 6 times [2023-11-29 21:20:51,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:20:51,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441859046] [2023-11-29 21:20:51,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:20:51,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:20:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:20:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:20:52,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:20:52,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441859046] [2023-11-29 21:20:52,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441859046] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:20:52,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:20:52,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-11-29 21:20:52,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992517829] [2023-11-29 21:20:52,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:20:52,394 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 21:20:52,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:20:52,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 21:20:52,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2023-11-29 21:20:52,396 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 217 [2023-11-29 21:20:52,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1083 places, 28800 transitions, 492304 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-11-29 21:20:52,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:20:52,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 217 [2023-11-29 21:20:52,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-29 21:21:07,919 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-11-29 21:21:07,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 21:21:07,939 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-29 21:21:07,939 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 21:21:07,939 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (28states, 127/217 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 53833 conditions, 4899 events (2455/4898 cut-off events. For 464974/986872 co-relation queries the response was YES. Maximal size of possible extension queue 991. Compared 49217 event pairs, 594 based on Foata normal form. 67/5500 useless extension candidates. Maximal degree in co-relation 53269. Up to 3635 conditions per place.). [2023-11-29 21:21:07,940 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-29 21:21:07,941 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-29 21:21:07,941 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-29 21:21:07,941 INFO L457 BasicCegarLoop]: Path program histogram: [6, 6, 4, 2, 2, 1, 1, 1] [2023-11-29 21:21:07,943 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 21:21:07,943 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 21:21:07,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 09:21:07 BasicIcfg [2023-11-29 21:21:07,946 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 21:21:07,946 INFO L158 Benchmark]: Toolchain (without parser) took 824208.37ms. Allocated memory was 421.5MB in the beginning and 12.4GB in the end (delta: 12.0GB). Free memory was 368.2MB in the beginning and 7.1GB in the end (delta: -6.7GB). Peak memory consumption was 6.3GB. Max. memory is 16.0GB. [2023-11-29 21:21:07,946 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 421.5MB. Free memory was 371.6MB in the beginning and 371.5MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 21:21:07,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.15ms. Allocated memory is still 421.5MB. Free memory was 367.8MB in the beginning and 356.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-11-29 21:21:07,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.74ms. Allocated memory is still 421.5MB. Free memory was 356.6MB in the beginning and 354.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-29 21:21:07,946 INFO L158 Benchmark]: Boogie Preprocessor took 17.26ms. Allocated memory is still 421.5MB. Free memory was 354.1MB in the beginning and 352.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 21:21:07,947 INFO L158 Benchmark]: RCFGBuilder took 339.73ms. Allocated memory is still 421.5MB. Free memory was 352.7MB in the beginning and 333.5MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-11-29 21:21:07,947 INFO L158 Benchmark]: TraceAbstraction took 823652.29ms. Allocated memory was 421.5MB in the beginning and 12.4GB in the end (delta: 12.0GB). Free memory was 332.6MB in the beginning and 7.1GB in the end (delta: -6.8GB). Peak memory consumption was 6.3GB. Max. memory is 16.0GB. [2023-11-29 21:21:07,947 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.11ms. Allocated memory is still 421.5MB. Free memory was 371.6MB in the beginning and 371.5MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 169.15ms. Allocated memory is still 421.5MB. Free memory was 367.8MB in the beginning and 356.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 25.74ms. Allocated memory is still 421.5MB. Free memory was 356.6MB in the beginning and 354.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 17.26ms. Allocated memory is still 421.5MB. Free memory was 354.1MB in the beginning and 352.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 339.73ms. Allocated memory is still 421.5MB. Free memory was 352.7MB in the beginning and 333.5MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 823652.29ms. Allocated memory was 421.5MB in the beginning and 12.4GB in the end (delta: 12.0GB). Free memory was 332.6MB in the beginning and 7.1GB in the end (delta: -6.8GB). Peak memory consumption was 6.3GB. Max. memory is 16.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 23,while PetriNetUnfolder was constructing finite prefix that currently has 53833 conditions, 4899 events (2455/4898 cut-off events. For 464974/986872 co-relation queries the response was YES. Maximal size of possible extension queue 991. Compared 49217 event pairs, 594 based on Foata normal form. 67/5500 useless extension candidates. Maximal degree in co-relation 53269. Up to 3635 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 23,while PetriNetUnfolder was constructing finite prefix that currently has 53833 conditions, 4899 events (2455/4898 cut-off events. For 464974/986872 co-relation queries the response was YES. Maximal size of possible extension queue 991. Compared 49217 event pairs, 594 based on Foata normal form. 67/5500 useless extension candidates. Maximal degree in co-relation 53269. Up to 3635 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 23,while PetriNetUnfolder was constructing finite prefix that currently has 53833 conditions, 4899 events (2455/4898 cut-off events. For 464974/986872 co-relation queries the response was YES. Maximal size of possible extension queue 991. Compared 49217 event pairs, 594 based on Foata normal form. 67/5500 useless extension candidates. Maximal degree in co-relation 53269. Up to 3635 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 23,while PetriNetUnfolder was constructing finite prefix that currently has 53833 conditions, 4899 events (2455/4898 cut-off events. For 464974/986872 co-relation queries the response was YES. Maximal size of possible extension queue 991. Compared 49217 event pairs, 594 based on Foata normal form. 67/5500 useless extension candidates. Maximal degree in co-relation 53269. Up to 3635 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: 823.5s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 817.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8984 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8984 mSDsluCounter, 54515 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51608 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22287 IncrementalHoareTripleChecker+Invalid, 22353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 2907 mSDtfsCounter, 22287 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1128 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1039 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75442 ImplicationChecksByTransitivity, 24.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=492304occurred in iteration=22, InterpolantAutomatonStates: 905, 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, 5.4s InterpolantComputationTime, 3031 NumberOfCodeBlocks, 3031 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3008 ConstructedInterpolants, 0 QuantifiedInterpolants, 10416 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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