/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:11:14,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:11:14,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-09 15:11:14,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:11:14,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:11:14,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:11:14,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:11:14,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:11:14,654 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:11:14,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:11:14,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:11:14,655 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:11:14,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:11:14,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:11:14,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:11:14,656 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:11:14,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:11:14,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:11:14,657 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:11:14,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:11:14,658 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:11:14,658 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:11:14,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:11:14,659 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:11:14,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:11:14,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:11:14,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:11:14,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:11:14,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:11:14,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:11:14,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:11:14,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:11:14,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:11:14,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 15:11:14,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:11:14,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:11:14,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:11:14,886 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:11:14,887 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:11:14,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c [2023-12-09 15:11:15,913 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:11:16,127 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:11:16,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c [2023-12-09 15:11:16,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0d4c16b/9dfd1cc9755b4685b1a9d1d4237e5ec5/FLAGaac978be4 [2023-12-09 15:11:16,161 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0d4c16b/9dfd1cc9755b4685b1a9d1d4237e5ec5 [2023-12-09 15:11:16,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:11:16,165 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:11:16,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:11:16,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:11:16,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:11:16,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:11:16" (1/1) ... [2023-12-09 15:11:16,170 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707d7ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:11:16, skipping insertion in model container [2023-12-09 15:11:16,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:11:16" (1/1) ... [2023-12-09 15:11:16,205 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:11:16,332 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-nzb-file-subst.wvr.c[6540,6553] [2023-12-09 15:11:16,339 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:11:16,346 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:11:16,381 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-nzb-file-subst.wvr.c[6540,6553] [2023-12-09 15:11:16,383 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:11:16,394 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:11:16,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:11:16 WrapperNode [2023-12-09 15:11:16,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:11:16,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:11:16,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:11:16,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:11:16,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:11:16" (1/1) ... [2023-12-09 15:11:16,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:11:16" (1/1) ... [2023-12-09 15:11:16,445 INFO L138 Inliner]: procedures = 26, calls = 76, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 606 [2023-12-09 15:11:16,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:11:16,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:11:16,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:11:16,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:11:16,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:11:16" (1/1) ... [2023-12-09 15:11:16,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:11:16" (1/1) ... [2023-12-09 15:11:16,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:11:16" (1/1) ... [2023-12-09 15:11:16,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:11:16" (1/1) ... [2023-12-09 15:11:16,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:11:16" (1/1) ... [2023-12-09 15:11:16,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:11:16" (1/1) ... [2023-12-09 15:11:16,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:11:16" (1/1) ... [2023-12-09 15:11:16,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:11:16" (1/1) ... [2023-12-09 15:11:16,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:11:16,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:11:16,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:11:16,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:11:16,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:11:16" (1/1) ... [2023-12-09 15:11:16,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:11:16,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:11:16,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-09 15:11:16,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-09 15:11:16,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:11:16,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:11:16,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:11:16,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:11:16,639 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:11:16,639 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:11:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:11:16,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:11:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:11:16,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:11:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:11:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:11:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:11:16,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:11:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:11:16,642 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:11:16,788 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:11:16,789 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:11:17,386 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:11:17,409 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:11:17,410 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-09 15:11:17,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:11:17 BoogieIcfgContainer [2023-12-09 15:11:17,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:11:17,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:11:17,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:11:17,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:11:17,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:11:16" (1/3) ... [2023-12-09 15:11:17,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b0ffac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:11:17, skipping insertion in model container [2023-12-09 15:11:17,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:11:16" (2/3) ... [2023-12-09 15:11:17,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b0ffac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:11:17, skipping insertion in model container [2023-12-09 15:11:17,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:11:17" (3/3) ... [2023-12-09 15:11:17,417 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-subst.wvr.c [2023-12-09 15:11:17,430 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:11:17,430 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:11:17,430 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:11:17,583 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:11:17,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 727 places, 790 transitions, 1601 flow [2023-12-09 15:11:17,868 INFO L124 PetriNetUnfolderBase]: 73/787 cut-off events. [2023-12-09 15:11:17,869 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:11:17,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 787 events. 73/787 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2726 event pairs, 0 based on Foata normal form. 0/713 useless extension candidates. Maximal degree in co-relation 585. Up to 2 conditions per place. [2023-12-09 15:11:17,897 INFO L82 GeneralOperation]: Start removeDead. Operand has 727 places, 790 transitions, 1601 flow [2023-12-09 15:11:17,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 713 places, 776 transitions, 1570 flow [2023-12-09 15:11:17,921 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:11:17,926 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;@661d2c5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:11:17,926 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 15:11:18,076 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:11:18,077 INFO L124 PetriNetUnfolderBase]: 73/775 cut-off events. [2023-12-09 15:11:18,077 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:11:18,077 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:11:18,078 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:11:18,078 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:11:18,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:11:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash -571994113, now seen corresponding path program 1 times [2023-12-09 15:11:18,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:11:18,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265177263] [2023-12-09 15:11:18,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:11:18,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:11:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:11:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:11:18,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:11:18,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265177263] [2023-12-09 15:11:18,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265177263] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:11:18,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:11:18,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:11:18,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325089050] [2023-12-09 15:11:18,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:11:18,462 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:11:18,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:11:18,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:11:18,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:11:18,487 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 790 [2023-12-09 15:11:18,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 776 transitions, 1570 flow. Second operand has 3 states, 3 states have (on average 736.0) internal successors, (2208), 3 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:18,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:11:18,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 790 [2023-12-09 15:11:18,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:11:19,103 INFO L124 PetriNetUnfolderBase]: 161/2043 cut-off events. [2023-12-09 15:11:19,104 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2023-12-09 15:11:19,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2271 conditions, 2043 events. 161/2043 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 15701 event pairs, 45 based on Foata normal form. 531/2367 useless extension candidates. Maximal degree in co-relation 1776. Up to 108 conditions per place. [2023-12-09 15:11:19,148 INFO L140 encePairwiseOnDemand]: 747/790 looper letters, 31 selfloop transitions, 4 changer transitions 7/754 dead transitions. [2023-12-09 15:11:19,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 754 transitions, 1611 flow [2023-12-09 15:11:19,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:11:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:11:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2298 transitions. [2023-12-09 15:11:19,164 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9696202531645569 [2023-12-09 15:11:19,165 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2298 transitions. [2023-12-09 15:11:19,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2298 transitions. [2023-12-09 15:11:19,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:11:19,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2298 transitions. [2023-12-09 15:11:19,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 766.0) internal successors, (2298), 3 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:19,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 790.0) internal successors, (3160), 4 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:19,185 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 790.0) internal successors, (3160), 4 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:19,188 INFO L308 CegarLoopForPetriNet]: 713 programPoint places, 2 predicate places. [2023-12-09 15:11:19,188 INFO L500 AbstractCegarLoop]: Abstraction has has 715 places, 754 transitions, 1611 flow [2023-12-09 15:11:19,189 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 736.0) internal successors, (2208), 3 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:19,189 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:11:19,189 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:11:19,190 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:11:19,190 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:11:19,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:11:19,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1245393981, now seen corresponding path program 2 times [2023-12-09 15:11:19,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:11:19,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415103102] [2023-12-09 15:11:19,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:11:19,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:11:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:11:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:11:19,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:11:19,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415103102] [2023-12-09 15:11:19,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415103102] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:11:19,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:11:19,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:11:19,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827587684] [2023-12-09 15:11:19,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:11:19,431 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:11:19,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:11:19,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:11:19,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:11:19,435 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 790 [2023-12-09 15:11:19,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 754 transitions, 1611 flow. Second operand has 3 states, 3 states have (on average 736.0) internal successors, (2208), 3 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:19,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:11:19,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 790 [2023-12-09 15:11:19,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:11:19,960 INFO L124 PetriNetUnfolderBase]: 162/2142 cut-off events. [2023-12-09 15:11:19,960 INFO L125 PetriNetUnfolderBase]: For 307/347 co-relation queries the response was YES. [2023-12-09 15:11:19,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2592 conditions, 2142 events. 162/2142 cut-off events. For 307/347 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 16646 event pairs, 36 based on Foata normal form. 0/1937 useless extension candidates. Maximal degree in co-relation 1916. Up to 134 conditions per place. [2023-12-09 15:11:20,005 INFO L140 encePairwiseOnDemand]: 786/790 looper letters, 48 selfloop transitions, 2 changer transitions 7/769 dead transitions. [2023-12-09 15:11:20,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 769 transitions, 1786 flow [2023-12-09 15:11:20,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:11:20,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:11:20,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2233 transitions. [2023-12-09 15:11:20,009 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9421940928270042 [2023-12-09 15:11:20,009 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2233 transitions. [2023-12-09 15:11:20,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2233 transitions. [2023-12-09 15:11:20,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:11:20,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2233 transitions. [2023-12-09 15:11:20,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:20,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 790.0) internal successors, (3160), 4 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:20,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 790.0) internal successors, (3160), 4 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:20,018 INFO L308 CegarLoopForPetriNet]: 713 programPoint places, 4 predicate places. [2023-12-09 15:11:20,018 INFO L500 AbstractCegarLoop]: Abstraction has has 717 places, 769 transitions, 1786 flow [2023-12-09 15:11:20,020 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 736.0) internal successors, (2208), 3 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:20,020 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:11:20,020 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:11:20,020 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:11:20,021 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:11:20,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:11:20,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2100685215, now seen corresponding path program 1 times [2023-12-09 15:11:20,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:11:20,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663989848] [2023-12-09 15:11:20,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:11:20,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:11:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:11:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:11:20,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:11:20,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663989848] [2023-12-09 15:11:20,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663989848] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:11:20,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:11:20,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:11:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317158625] [2023-12-09 15:11:20,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:11:20,121 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:11:20,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:11:20,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:11:20,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:11:20,124 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 790 [2023-12-09 15:11:20,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 769 transitions, 1786 flow. Second operand has 3 states, 3 states have (on average 736.3333333333334) internal successors, (2209), 3 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:20,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:11:20,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 790 [2023-12-09 15:11:20,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:11:21,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2411] thread1EXIT-->L159-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem94#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][546], [734#true, 588#$Ultimate##0true, thread3Thread1of1ForFork0InUse, 738#true, 730#true, thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork1NotInUse, 86#L96-4true, 642#L159-2true]) [2023-12-09 15:11:21,939 INFO L294 olderBase$Statistics]: this new event has 256 ancestors and is cut-off event [2023-12-09 15:11:21,939 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2023-12-09 15:11:21,940 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-12-09 15:11:21,940 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-12-09 15:11:21,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2411] thread1EXIT-->L159-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem94#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][546], [734#true, 588#$Ultimate##0true, thread3Thread1of1ForFork0InUse, 738#true, 730#true, thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork1NotInUse, 642#L159-2true, 563#L96-6true]) [2023-12-09 15:11:21,940 INFO L294 olderBase$Statistics]: this new event has 256 ancestors and is cut-off event [2023-12-09 15:11:21,940 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2023-12-09 15:11:21,940 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-12-09 15:11:21,940 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-12-09 15:11:22,537 INFO L124 PetriNetUnfolderBase]: 1432/11542 cut-off events. [2023-12-09 15:11:22,537 INFO L125 PetriNetUnfolderBase]: For 4358/6419 co-relation queries the response was YES. [2023-12-09 15:11:22,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15576 conditions, 11542 events. 1432/11542 cut-off events. For 4358/6419 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 142340 event pairs, 576 based on Foata normal form. 6/10012 useless extension candidates. Maximal degree in co-relation 14588. Up to 957 conditions per place. [2023-12-09 15:11:22,701 INFO L140 encePairwiseOnDemand]: 786/790 looper letters, 68 selfloop transitions, 3 changer transitions 7/800 dead transitions. [2023-12-09 15:11:22,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 800 transitions, 2130 flow [2023-12-09 15:11:22,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:11:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:11:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2232 transitions. [2023-12-09 15:11:22,705 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9417721518987342 [2023-12-09 15:11:22,706 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2232 transitions. [2023-12-09 15:11:22,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2232 transitions. [2023-12-09 15:11:22,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:11:22,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2232 transitions. [2023-12-09 15:11:22,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 744.0) internal successors, (2232), 3 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:22,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 790.0) internal successors, (3160), 4 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:22,714 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 790.0) internal successors, (3160), 4 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:22,714 INFO L308 CegarLoopForPetriNet]: 713 programPoint places, 6 predicate places. [2023-12-09 15:11:22,715 INFO L500 AbstractCegarLoop]: Abstraction has has 719 places, 800 transitions, 2130 flow [2023-12-09 15:11:22,716 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 736.3333333333334) internal successors, (2209), 3 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:22,716 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:11:22,716 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:11:22,716 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:11:22,716 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:11:22,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:11:22,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1612279927, now seen corresponding path program 2 times [2023-12-09 15:11:22,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:11:22,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838886723] [2023-12-09 15:11:22,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:11:22,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:11:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:11:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:11:22,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:11:22,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838886723] [2023-12-09 15:11:22,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838886723] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:11:22,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:11:22,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:11:22,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497452100] [2023-12-09 15:11:22,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:11:22,784 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:11:22,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:11:22,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:11:22,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:11:22,786 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 790 [2023-12-09 15:11:22,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 800 transitions, 2130 flow. Second operand has 3 states, 3 states have (on average 736.3333333333334) internal successors, (2209), 3 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:22,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:11:22,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 790 [2023-12-09 15:11:22,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:11:24,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2411] thread1EXIT-->L159-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem94#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][565], [734#true, 588#$Ultimate##0true, 738#true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 730#true, thread1Thread1of1ForFork1NotInUse, 642#L159-2true, 563#L96-6true, 742#true]) [2023-12-09 15:11:24,269 INFO L294 olderBase$Statistics]: this new event has 256 ancestors and is cut-off event [2023-12-09 15:11:24,272 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-12-09 15:11:24,273 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2023-12-09 15:11:24,273 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-12-09 15:11:24,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2411] thread1EXIT-->L159-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem94#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][564], [744#(= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))), 588#$Ultimate##0true, 734#true, thread3Thread1of1ForFork0InUse, 738#true, thread2Thread1of1ForFork2InUse, 730#true, thread1Thread1of1ForFork1NotInUse, 86#L96-4true, 642#L159-2true]) [2023-12-09 15:11:24,274 INFO L294 olderBase$Statistics]: this new event has 256 ancestors and is cut-off event [2023-12-09 15:11:24,274 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-12-09 15:11:24,274 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2023-12-09 15:11:24,274 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-12-09 15:11:24,760 INFO L124 PetriNetUnfolderBase]: 1359/10996 cut-off events. [2023-12-09 15:11:24,760 INFO L125 PetriNetUnfolderBase]: For 6529/11646 co-relation queries the response was YES. [2023-12-09 15:11:24,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16427 conditions, 10996 events. 1359/10996 cut-off events. For 6529/11646 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 134392 event pairs, 476 based on Foata normal form. 27/9622 useless extension candidates. Maximal degree in co-relation 15104. Up to 996 conditions per place. [2023-12-09 15:11:25,078 INFO L140 encePairwiseOnDemand]: 784/790 looper letters, 97 selfloop transitions, 5 changer transitions 7/831 dead transitions. [2023-12-09 15:11:25,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 831 transitions, 2598 flow [2023-12-09 15:11:25,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:11:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:11:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2232 transitions. [2023-12-09 15:11:25,082 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9417721518987342 [2023-12-09 15:11:25,082 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2232 transitions. [2023-12-09 15:11:25,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2232 transitions. [2023-12-09 15:11:25,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:11:25,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2232 transitions. [2023-12-09 15:11:25,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 744.0) internal successors, (2232), 3 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:25,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 790.0) internal successors, (3160), 4 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:25,091 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 790.0) internal successors, (3160), 4 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:25,092 INFO L308 CegarLoopForPetriNet]: 713 programPoint places, 8 predicate places. [2023-12-09 15:11:25,092 INFO L500 AbstractCegarLoop]: Abstraction has has 721 places, 831 transitions, 2598 flow [2023-12-09 15:11:25,093 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 736.3333333333334) internal successors, (2209), 3 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:25,093 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:11:25,094 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:11:25,094 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:11:25,094 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:11:25,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:11:25,094 INFO L85 PathProgramCache]: Analyzing trace with hash 516818029, now seen corresponding path program 1 times [2023-12-09 15:11:25,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:11:25,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581328302] [2023-12-09 15:11:25,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:11:25,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:11:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:11:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:11:25,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:11:25,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581328302] [2023-12-09 15:11:25,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581328302] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:11:25,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:11:25,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:11:25,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594679004] [2023-12-09 15:11:25,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:11:25,156 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:11:25,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:11:25,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:11:25,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:11:25,158 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 790 [2023-12-09 15:11:25,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 831 transitions, 2598 flow. Second operand has 3 states, 3 states have (on average 736.3333333333334) internal successors, (2209), 3 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:25,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:11:25,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 790 [2023-12-09 15:11:25,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:11:26,807 INFO L124 PetriNetUnfolderBase]: 1241/11543 cut-off events. [2023-12-09 15:11:26,808 INFO L125 PetriNetUnfolderBase]: For 8680/13587 co-relation queries the response was YES. [2023-12-09 15:11:26,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17238 conditions, 11543 events. 1241/11543 cut-off events. For 8680/13587 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 145366 event pairs, 341 based on Foata normal form. 88/10464 useless extension candidates. Maximal degree in co-relation 15768. Up to 867 conditions per place. [2023-12-09 15:11:27,027 INFO L140 encePairwiseOnDemand]: 786/790 looper letters, 94 selfloop transitions, 4 changer transitions 7/855 dead transitions. [2023-12-09 15:11:27,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 855 transitions, 2980 flow [2023-12-09 15:11:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:11:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:11:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2233 transitions. [2023-12-09 15:11:27,031 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9421940928270042 [2023-12-09 15:11:27,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2233 transitions. [2023-12-09 15:11:27,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2233 transitions. [2023-12-09 15:11:27,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:11:27,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2233 transitions. [2023-12-09 15:11:27,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:27,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 790.0) internal successors, (3160), 4 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:27,041 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 790.0) internal successors, (3160), 4 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:27,041 INFO L308 CegarLoopForPetriNet]: 713 programPoint places, 10 predicate places. [2023-12-09 15:11:27,041 INFO L500 AbstractCegarLoop]: Abstraction has has 723 places, 855 transitions, 2980 flow [2023-12-09 15:11:27,042 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 736.3333333333334) internal successors, (2209), 3 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:27,042 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:11:27,043 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:11:27,043 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:11:27,043 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:11:27,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:11:27,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1028376627, now seen corresponding path program 2 times [2023-12-09 15:11:27,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:11:27,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671490156] [2023-12-09 15:11:27,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:11:27,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:11:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:11:27,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:11:27,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:11:27,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671490156] [2023-12-09 15:11:27,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671490156] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:11:27,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:11:27,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:11:27,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107115262] [2023-12-09 15:11:27,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:11:27,107 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:11:27,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:11:27,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:11:27,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:11:27,109 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 790 [2023-12-09 15:11:27,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 855 transitions, 2980 flow. Second operand has 3 states, 3 states have (on average 736.3333333333334) internal successors, (2209), 3 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:27,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:11:27,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 790 [2023-12-09 15:11:27,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:11:28,857 INFO L124 PetriNetUnfolderBase]: 1115/10070 cut-off events. [2023-12-09 15:11:28,858 INFO L125 PetriNetUnfolderBase]: For 11571/16976 co-relation queries the response was YES. [2023-12-09 15:11:29,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16418 conditions, 10070 events. 1115/10070 cut-off events. For 11571/16976 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 122782 event pairs, 264 based on Foata normal form. 83/9174 useless extension candidates. Maximal degree in co-relation 14991. Up to 832 conditions per place. [2023-12-09 15:11:29,087 INFO L140 encePairwiseOnDemand]: 784/790 looper letters, 114 selfloop transitions, 6 changer transitions 7/867 dead transitions. [2023-12-09 15:11:29,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 867 transitions, 3324 flow [2023-12-09 15:11:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:11:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:11:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2233 transitions. [2023-12-09 15:11:29,091 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9421940928270042 [2023-12-09 15:11:29,091 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2233 transitions. [2023-12-09 15:11:29,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2233 transitions. [2023-12-09 15:11:29,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:11:29,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2233 transitions. [2023-12-09 15:11:29,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:29,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 790.0) internal successors, (3160), 4 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:29,099 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 790.0) internal successors, (3160), 4 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:29,100 INFO L308 CegarLoopForPetriNet]: 713 programPoint places, 12 predicate places. [2023-12-09 15:11:29,100 INFO L500 AbstractCegarLoop]: Abstraction has has 725 places, 867 transitions, 3324 flow [2023-12-09 15:11:29,101 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 736.3333333333334) internal successors, (2209), 3 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:29,101 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:11:29,101 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:11:29,101 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:11:29,101 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:11:29,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:11:29,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1029930190, now seen corresponding path program 1 times [2023-12-09 15:11:29,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:11:29,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899769407] [2023-12-09 15:11:29,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:11:29,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:11:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:11:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:11:29,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:11:29,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899769407] [2023-12-09 15:11:29,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899769407] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:11:29,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:11:29,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:11:29,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273034658] [2023-12-09 15:11:29,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:11:29,234 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:11:29,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:11:29,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:11:29,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:11:29,237 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 704 out of 790 [2023-12-09 15:11:29,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 725 places, 867 transitions, 3324 flow. Second operand has 5 states, 5 states have (on average 711.2) internal successors, (3556), 5 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:29,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:11:29,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 704 of 790 [2023-12-09 15:11:29,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:11:31,092 INFO L124 PetriNetUnfolderBase]: 1115/10033 cut-off events. [2023-12-09 15:11:31,092 INFO L125 PetriNetUnfolderBase]: For 16262/20379 co-relation queries the response was YES. [2023-12-09 15:11:31,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16709 conditions, 10033 events. 1115/10033 cut-off events. For 16262/20379 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 121884 event pairs, 264 based on Foata normal form. 33/9087 useless extension candidates. Maximal degree in co-relation 15140. Up to 832 conditions per place. [2023-12-09 15:11:31,314 INFO L140 encePairwiseOnDemand]: 769/790 looper letters, 86 selfloop transitions, 18 changer transitions 7/879 dead transitions. [2023-12-09 15:11:31,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 729 places, 879 transitions, 3556 flow [2023-12-09 15:11:31,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:11:31,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:11:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3583 transitions. [2023-12-09 15:11:31,320 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9070886075949367 [2023-12-09 15:11:31,320 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3583 transitions. [2023-12-09 15:11:31,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3583 transitions. [2023-12-09 15:11:31,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:11:31,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3583 transitions. [2023-12-09 15:11:31,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 716.6) internal successors, (3583), 5 states have internal predecessors, (3583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:31,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 790.0) internal successors, (4740), 6 states have internal predecessors, (4740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:31,332 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 790.0) internal successors, (4740), 6 states have internal predecessors, (4740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:31,332 INFO L308 CegarLoopForPetriNet]: 713 programPoint places, 16 predicate places. [2023-12-09 15:11:31,332 INFO L500 AbstractCegarLoop]: Abstraction has has 729 places, 879 transitions, 3556 flow [2023-12-09 15:11:31,333 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 711.2) internal successors, (3556), 5 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:31,333 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:11:31,333 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:11:31,333 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 15:11:31,334 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:11:31,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:11:31,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1051396794, now seen corresponding path program 1 times [2023-12-09 15:11:31,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:11:31,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996092253] [2023-12-09 15:11:31,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:11:31,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:11:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:11:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:11:31,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:11:31,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996092253] [2023-12-09 15:11:31,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996092253] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:11:31,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797719274] [2023-12-09 15:11:31,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:11:31,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:11:31,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:11:31,521 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:11:31,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-09 15:11:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:11:31,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:11:31,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:11:31,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:11:31,867 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:11:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:11:31,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797719274] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:11:31,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:11:31,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2023-12-09 15:11:31,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870543067] [2023-12-09 15:11:31,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:11:31,951 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-09 15:11:31,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:11:31,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-09 15:11:31,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-12-09 15:11:31,958 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 701 out of 790 [2023-12-09 15:11:31,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 729 places, 879 transitions, 3556 flow. Second operand has 15 states, 15 states have (on average 705.6666666666666) internal successors, (10585), 15 states have internal predecessors, (10585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:31,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:11:31,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 701 of 790 [2023-12-09 15:11:31,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:11:34,054 INFO L124 PetriNetUnfolderBase]: 1115/10115 cut-off events. [2023-12-09 15:11:34,054 INFO L125 PetriNetUnfolderBase]: For 22504/26812 co-relation queries the response was YES. [2023-12-09 15:11:34,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17158 conditions, 10115 events. 1115/10115 cut-off events. For 22504/26812 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 122655 event pairs, 264 based on Foata normal form. 35/9171 useless extension candidates. Maximal degree in co-relation 15399. Up to 832 conditions per place. [2023-12-09 15:11:34,190 INFO L140 encePairwiseOnDemand]: 760/790 looper letters, 89 selfloop transitions, 39 changer transitions 7/900 dead transitions. [2023-12-09 15:11:34,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 739 places, 900 transitions, 3884 flow [2023-12-09 15:11:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:11:34,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:11:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 7801 transitions. [2023-12-09 15:11:34,200 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.897698504027618 [2023-12-09 15:11:34,200 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 7801 transitions. [2023-12-09 15:11:34,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 7801 transitions. [2023-12-09 15:11:34,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:11:34,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 7801 transitions. [2023-12-09 15:11:34,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 709.1818181818181) internal successors, (7801), 11 states have internal predecessors, (7801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:34,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 790.0) internal successors, (9480), 12 states have internal predecessors, (9480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:34,224 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 790.0) internal successors, (9480), 12 states have internal predecessors, (9480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:34,224 INFO L308 CegarLoopForPetriNet]: 713 programPoint places, 26 predicate places. [2023-12-09 15:11:34,224 INFO L500 AbstractCegarLoop]: Abstraction has has 739 places, 900 transitions, 3884 flow [2023-12-09 15:11:34,226 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 705.6666666666666) internal successors, (10585), 15 states have internal predecessors, (10585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:34,227 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:11:34,227 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:11:34,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-09 15:11:34,432 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:11:34,432 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:11:34,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:11:34,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1312038274, now seen corresponding path program 2 times [2023-12-09 15:11:34,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:11:34,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049339896] [2023-12-09 15:11:34,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:11:34,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:11:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:11:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-09 15:11:34,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:11:34,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049339896] [2023-12-09 15:11:34,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049339896] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:11:34,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742228591] [2023-12-09 15:11:34,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:11:34,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:11:34,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:11:34,710 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:11:34,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-09 15:11:34,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-09 15:11:34,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:11:34,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-09 15:11:34,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:11:34,993 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-09 15:11:34,993 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:11:34,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742228591] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:11:34,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:11:34,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2023-12-09 15:11:34,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021760836] [2023-12-09 15:11:34,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:11:34,997 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:11:34,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:11:34,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:11:34,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-12-09 15:11:35,001 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 675 out of 790 [2023-12-09 15:11:35,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 739 places, 900 transitions, 3884 flow. Second operand has 8 states, 8 states have (on average 682.25) internal successors, (5458), 8 states have internal predecessors, (5458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:35,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:11:35,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 675 of 790 [2023-12-09 15:11:35,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:11:41,366 INFO L124 PetriNetUnfolderBase]: 5632/32033 cut-off events. [2023-12-09 15:11:41,366 INFO L125 PetriNetUnfolderBase]: For 255929/324983 co-relation queries the response was YES. [2023-12-09 15:11:41,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60992 conditions, 32033 events. 5632/32033 cut-off events. For 255929/324983 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 429744 event pairs, 2123 based on Foata normal form. 485/28777 useless extension candidates. Maximal degree in co-relation 57224. Up to 5489 conditions per place. [2023-12-09 15:11:41,815 INFO L140 encePairwiseOnDemand]: 774/790 looper letters, 159 selfloop transitions, 12 changer transitions 22/972 dead transitions. [2023-12-09 15:11:41,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 753 places, 972 transitions, 4889 flow [2023-12-09 15:11:41,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-09 15:11:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-09 15:11:41,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 10268 transitions. [2023-12-09 15:11:41,828 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8664978902953586 [2023-12-09 15:11:41,828 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 10268 transitions. [2023-12-09 15:11:41,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 10268 transitions. [2023-12-09 15:11:41,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:11:41,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 10268 transitions. [2023-12-09 15:11:41,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 684.5333333333333) internal successors, (10268), 15 states have internal predecessors, (10268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:41,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 790.0) internal successors, (12640), 16 states have internal predecessors, (12640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:41,855 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 790.0) internal successors, (12640), 16 states have internal predecessors, (12640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:41,856 INFO L308 CegarLoopForPetriNet]: 713 programPoint places, 40 predicate places. [2023-12-09 15:11:41,856 INFO L500 AbstractCegarLoop]: Abstraction has has 753 places, 972 transitions, 4889 flow [2023-12-09 15:11:41,857 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 682.25) internal successors, (5458), 8 states have internal predecessors, (5458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:41,857 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:11:41,858 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:11:41,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-09 15:11:42,062 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-12-09 15:11:42,062 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:11:42,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:11:42,065 INFO L85 PathProgramCache]: Analyzing trace with hash 594471718, now seen corresponding path program 3 times [2023-12-09 15:11:42,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:11:42,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278473875] [2023-12-09 15:11:42,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:11:42,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:11:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:11:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-09 15:11:42,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:11:42,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278473875] [2023-12-09 15:11:42,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278473875] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:11:42,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310253267] [2023-12-09 15:11:42,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:11:42,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:11:42,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:11:42,297 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:11:42,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-09 15:11:42,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-12-09 15:11:42,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:11:42,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-09 15:11:42,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:11:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-09 15:11:42,607 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:11:42,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310253267] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:11:42,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:11:42,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2023-12-09 15:11:42,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862072731] [2023-12-09 15:11:42,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:11:42,608 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:11:42,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:11:42,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:11:42,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-12-09 15:11:42,611 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 675 out of 790 [2023-12-09 15:11:42,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 753 places, 972 transitions, 4889 flow. Second operand has 8 states, 8 states have (on average 682.25) internal successors, (5458), 8 states have internal predecessors, (5458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:42,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:11:42,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 675 of 790 [2023-12-09 15:11:42,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:11:49,621 INFO L124 PetriNetUnfolderBase]: 5596/31625 cut-off events. [2023-12-09 15:11:49,621 INFO L125 PetriNetUnfolderBase]: For 272795/377084 co-relation queries the response was YES. [2023-12-09 15:11:50,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67290 conditions, 31625 events. 5596/31625 cut-off events. For 272795/377084 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 422865 event pairs, 1910 based on Foata normal form. 640/28693 useless extension candidates. Maximal degree in co-relation 63257. Up to 5578 conditions per place. [2023-12-09 15:11:50,256 INFO L140 encePairwiseOnDemand]: 774/790 looper letters, 228 selfloop transitions, 25 changer transitions 42/1074 dead transitions. [2023-12-09 15:11:50,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 767 places, 1074 transitions, 6571 flow [2023-12-09 15:11:50,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-09 15:11:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-09 15:11:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 10266 transitions. [2023-12-09 15:11:50,269 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8663291139240507 [2023-12-09 15:11:50,269 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 10266 transitions. [2023-12-09 15:11:50,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 10266 transitions. [2023-12-09 15:11:50,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:11:50,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 10266 transitions. [2023-12-09 15:11:50,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 684.4) internal successors, (10266), 15 states have internal predecessors, (10266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:50,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 790.0) internal successors, (12640), 16 states have internal predecessors, (12640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:50,298 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 790.0) internal successors, (12640), 16 states have internal predecessors, (12640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:50,298 INFO L308 CegarLoopForPetriNet]: 713 programPoint places, 54 predicate places. [2023-12-09 15:11:50,298 INFO L500 AbstractCegarLoop]: Abstraction has has 767 places, 1074 transitions, 6571 flow [2023-12-09 15:11:50,299 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 682.25) internal successors, (5458), 8 states have internal predecessors, (5458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:50,299 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:11:50,300 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:11:50,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-09 15:11:50,509 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:11:50,509 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:11:50,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:11:50,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1386377368, now seen corresponding path program 4 times [2023-12-09 15:11:50,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:11:50,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153262073] [2023-12-09 15:11:50,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:11:50,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:11:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:11:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-09 15:11:50,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:11:50,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153262073] [2023-12-09 15:11:50,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153262073] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:11:50,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220334895] [2023-12-09 15:11:50,806 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-09 15:11:50,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:11:50,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:11:50,822 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:11:50,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-09 15:11:50,975 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-09 15:11:50,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:11:50,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-09 15:11:50,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:11:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-09 15:11:51,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:11:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-09 15:11:51,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220334895] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:11:51,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:11:51,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2023-12-09 15:11:51,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809515259] [2023-12-09 15:11:51,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:11:51,221 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-09 15:11:51,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:11:51,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-09 15:11:51,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2023-12-09 15:11:51,230 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 701 out of 790 [2023-12-09 15:11:51,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 767 places, 1074 transitions, 6571 flow. Second operand has 22 states, 22 states have (on average 705.0909090909091) internal successors, (15512), 22 states have internal predecessors, (15512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:51,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:11:51,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 701 of 790 [2023-12-09 15:11:51,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:11:57,952 INFO L124 PetriNetUnfolderBase]: 5493/30378 cut-off events. [2023-12-09 15:11:57,952 INFO L125 PetriNetUnfolderBase]: For 395089/491253 co-relation queries the response was YES. [2023-12-09 15:11:58,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68025 conditions, 30378 events. 5493/30378 cut-off events. For 395089/491253 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 400913 event pairs, 1870 based on Foata normal form. 367/27331 useless extension candidates. Maximal degree in co-relation 63465. Up to 5551 conditions per place. [2023-12-09 15:11:58,470 INFO L140 encePairwiseOnDemand]: 760/790 looper letters, 138 selfloop transitions, 57 changer transitions 42/1104 dead transitions. [2023-12-09 15:11:58,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 783 places, 1104 transitions, 7177 flow [2023-12-09 15:11:58,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-09 15:11:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-12-09 15:11:58,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 12037 transitions. [2023-12-09 15:11:58,487 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.896276991809382 [2023-12-09 15:11:58,487 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 12037 transitions. [2023-12-09 15:11:58,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 12037 transitions. [2023-12-09 15:11:58,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:11:58,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 12037 transitions. [2023-12-09 15:11:58,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 708.0588235294117) internal successors, (12037), 17 states have internal predecessors, (12037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:58,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 790.0) internal successors, (14220), 18 states have internal predecessors, (14220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:58,532 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 790.0) internal successors, (14220), 18 states have internal predecessors, (14220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:58,533 INFO L308 CegarLoopForPetriNet]: 713 programPoint places, 70 predicate places. [2023-12-09 15:11:58,533 INFO L500 AbstractCegarLoop]: Abstraction has has 783 places, 1104 transitions, 7177 flow [2023-12-09 15:11:58,536 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 705.0909090909091) internal successors, (15512), 22 states have internal predecessors, (15512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:58,536 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:11:58,536 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:11:58,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-09 15:11:58,741 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:11:58,741 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:11:58,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:11:58,742 INFO L85 PathProgramCache]: Analyzing trace with hash 830472306, now seen corresponding path program 5 times [2023-12-09 15:11:58,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:11:58,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593387620] [2023-12-09 15:11:58,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:11:58,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:11:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:11:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2023-12-09 15:11:58,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:11:58,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593387620] [2023-12-09 15:11:58,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593387620] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:11:58,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:11:58,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:11:58,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610215271] [2023-12-09 15:11:58,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:11:58,954 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:11:58,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:11:58,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:11:58,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:11:58,955 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 790 [2023-12-09 15:11:58,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 783 places, 1104 transitions, 7177 flow. Second operand has 3 states, 3 states have (on average 735.6666666666666) internal successors, (2207), 3 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:58,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:11:58,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 790 [2023-12-09 15:11:58,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:12:06,832 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2411] thread1EXIT-->L159-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem94#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][971], [6831#(= ~break_14~0 0), 738#true, 262#L92-11true, 542#L110-7true, 754#true, 742#true, 2596#true, 734#true, thread3Thread1of1ForFork0InUse, 3661#true, thread2Thread1of1ForFork2InUse, 730#true, thread1Thread1of1ForFork1NotInUse, 642#L159-2true, 746#true, 764#true, 750#true, 4726#true]) [2023-12-09 15:12:06,832 INFO L294 olderBase$Statistics]: this new event has 406 ancestors and is cut-off event [2023-12-09 15:12:06,832 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is cut-off event [2023-12-09 15:12:06,832 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is cut-off event [2023-12-09 15:12:06,832 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is cut-off event [2023-12-09 15:12:06,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2411] thread1EXIT-->L159-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem94#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][971], [6831#(= ~break_14~0 0), 738#true, 262#L92-11true, 754#true, 742#true, 2596#true, 734#true, thread3Thread1of1ForFork0InUse, 3661#true, thread2Thread1of1ForFork2InUse, 730#true, thread1Thread1of1ForFork1NotInUse, 642#L159-2true, 764#true, 746#true, 750#true, 578#L119-10true, 4726#true]) [2023-12-09 15:12:06,833 INFO L294 olderBase$Statistics]: this new event has 404 ancestors and is cut-off event [2023-12-09 15:12:06,833 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is cut-off event [2023-12-09 15:12:06,833 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is cut-off event [2023-12-09 15:12:06,833 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is cut-off event [2023-12-09 15:12:06,835 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2411] thread1EXIT-->L159-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem94#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][975], [6831#(= ~break_14~0 0), 262#L92-11true, 740#(not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), 742#true, 754#true, 2596#true, 564#L123-14true, 4620#(<= (+ |thread3Thread1of1ForFork0_#t~ite66#1| 995) 0), 734#true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 732#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), thread1Thread1of1ForFork1NotInUse, 642#L159-2true, 746#true, 764#true, 750#true, 4726#true]) [2023-12-09 15:12:06,836 INFO L294 olderBase$Statistics]: this new event has 393 ancestors and is cut-off event [2023-12-09 15:12:06,836 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2023-12-09 15:12:06,836 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2023-12-09 15:12:06,836 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2023-12-09 15:12:08,143 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2411] thread1EXIT-->L159-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem94#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][973], [6831#(= ~break_14~0 0), 738#true, 262#L92-11true, 754#true, 2596#true, 564#L123-14true, 744#(= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))), 736#(not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)), thread3Thread1of1ForFork0InUse, 3661#true, thread2Thread1of1ForFork2InUse, 730#true, thread1Thread1of1ForFork1NotInUse, 642#L159-2true, 746#true, 764#true, 750#true, 4726#true]) [2023-12-09 15:12:08,143 INFO L294 olderBase$Statistics]: this new event has 395 ancestors and is cut-off event [2023-12-09 15:12:08,143 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2023-12-09 15:12:08,143 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2023-12-09 15:12:08,143 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2023-12-09 15:12:08,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2411] thread1EXIT-->L159-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem94#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][974], [6831#(= ~break_14~0 0), 262#L92-11true, 4705#(and (<= (+ |thread3Thread1of1ForFork0_#t~ite66#1| 995) 0) (<= (+ ~result_18~0 995) 0)), 740#(not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), 754#true, 742#true, 2596#true, 734#true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 732#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), thread1Thread1of1ForFork1NotInUse, 445#L123-15true, 642#L159-2true, 764#true, 746#true, 750#true, 4726#true]) [2023-12-09 15:12:08,296 INFO L294 olderBase$Statistics]: this new event has 394 ancestors and is cut-off event [2023-12-09 15:12:08,296 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2023-12-09 15:12:08,296 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2023-12-09 15:12:08,296 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2023-12-09 15:12:08,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2411] thread1EXIT-->L159-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem94#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][973], [6831#(= ~break_14~0 0), 738#true, 262#L92-11true, 754#true, 2596#true, 744#(= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))), 736#(not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)), thread3Thread1of1ForFork0InUse, 3661#true, thread2Thread1of1ForFork2InUse, 730#true, 445#L123-15true, thread1Thread1of1ForFork1NotInUse, 746#true, 764#true, 642#L159-2true, 750#true, 4726#true]) [2023-12-09 15:12:08,739 INFO L294 olderBase$Statistics]: this new event has 396 ancestors and is cut-off event [2023-12-09 15:12:08,739 INFO L297 olderBase$Statistics]: existing Event has 396 ancestors and is cut-off event [2023-12-09 15:12:08,739 INFO L297 olderBase$Statistics]: existing Event has 396 ancestors and is cut-off event [2023-12-09 15:12:08,739 INFO L297 olderBase$Statistics]: existing Event has 396 ancestors and is cut-off event [2023-12-09 15:12:08,740 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2411] thread1EXIT-->L159-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem94#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][970], [6831#(= ~break_14~0 0), 262#L92-11true, 740#(not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), 742#true, 4624#(<= (+ ~result_18~0 995) 0), 754#true, 2596#true, 734#true, 101#L123-16true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 732#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), thread1Thread1of1ForFork1NotInUse, 764#true, 746#true, 642#L159-2true, 750#true, 4726#true]) [2023-12-09 15:12:08,740 INFO L294 olderBase$Statistics]: this new event has 395 ancestors and is not cut-off event [2023-12-09 15:12:08,740 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is not cut-off event [2023-12-09 15:12:08,740 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is not cut-off event [2023-12-09 15:12:08,740 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is not cut-off event [2023-12-09 15:12:08,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2411] thread1EXIT-->L159-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem94#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][973], [6831#(= ~break_14~0 0), 738#true, 262#L92-11true, 754#true, 2596#true, 744#(= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))), 736#(not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)), 101#L123-16true, thread3Thread1of1ForFork0InUse, 3661#true, thread2Thread1of1ForFork2InUse, 730#true, thread1Thread1of1ForFork1NotInUse, 746#true, 642#L159-2true, 764#true, 750#true, 4726#true]) [2023-12-09 15:12:08,884 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2023-12-09 15:12:08,885 INFO L297 olderBase$Statistics]: existing Event has 397 ancestors and is cut-off event [2023-12-09 15:12:08,885 INFO L297 olderBase$Statistics]: existing Event has 397 ancestors and is cut-off event [2023-12-09 15:12:08,885 INFO L297 olderBase$Statistics]: existing Event has 397 ancestors and is cut-off event [2023-12-09 15:12:09,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2411] thread1EXIT-->L159-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem94#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][971], [6831#(= ~break_14~0 0), 738#true, 262#L92-11true, 754#true, 742#true, 564#L123-14true, 2596#true, 734#true, thread3Thread1of1ForFork0InUse, 3661#true, thread2Thread1of1ForFork2InUse, 730#true, thread1Thread1of1ForFork1NotInUse, 764#true, 746#true, 642#L159-2true, 750#true, 4726#true]) [2023-12-09 15:12:09,061 INFO L294 olderBase$Statistics]: this new event has 417 ancestors and is cut-off event [2023-12-09 15:12:09,061 INFO L297 olderBase$Statistics]: existing Event has 417 ancestors and is cut-off event [2023-12-09 15:12:09,061 INFO L297 olderBase$Statistics]: existing Event has 417 ancestors and is cut-off event [2023-12-09 15:12:09,061 INFO L297 olderBase$Statistics]: existing Event has 417 ancestors and is cut-off event [2023-12-09 15:12:10,474 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2411] thread1EXIT-->L159-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem94#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][971], [6831#(= ~break_14~0 0), 738#true, 262#L92-11true, 84#L119-11true, 742#true, 754#true, 2596#true, 734#true, thread3Thread1of1ForFork0InUse, 3661#true, thread2Thread1of1ForFork2InUse, 730#true, thread1Thread1of1ForFork1NotInUse, 642#L159-2true, 764#true, 746#true, 750#true, 4726#true]) [2023-12-09 15:12:10,474 INFO L294 olderBase$Statistics]: this new event has 405 ancestors and is cut-off event [2023-12-09 15:12:10,474 INFO L297 olderBase$Statistics]: existing Event has 405 ancestors and is cut-off event [2023-12-09 15:12:10,474 INFO L297 olderBase$Statistics]: existing Event has 405 ancestors and is cut-off event [2023-12-09 15:12:10,474 INFO L297 olderBase$Statistics]: existing Event has 405 ancestors and is cut-off event [2023-12-09 15:12:12,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2411] thread1EXIT-->L159-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem94#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][971], [6831#(= ~break_14~0 0), 738#true, 262#L92-11true, 754#true, 742#true, 2596#true, 734#true, thread3Thread1of1ForFork0InUse, 3661#true, thread2Thread1of1ForFork2InUse, 730#true, 445#L123-15true, thread1Thread1of1ForFork1NotInUse, 746#true, 642#L159-2true, 764#true, 750#true, 4726#true]) [2023-12-09 15:12:12,646 INFO L294 olderBase$Statistics]: this new event has 418 ancestors and is cut-off event [2023-12-09 15:12:12,646 INFO L297 olderBase$Statistics]: existing Event has 418 ancestors and is cut-off event [2023-12-09 15:12:12,646 INFO L297 olderBase$Statistics]: existing Event has 418 ancestors and is cut-off event [2023-12-09 15:12:12,646 INFO L297 olderBase$Statistics]: existing Event has 418 ancestors and is cut-off event [2023-12-09 15:12:12,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2411] thread1EXIT-->L159-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem94#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][971], [6831#(= ~break_14~0 0), 738#true, 262#L92-11true, 742#true, 754#true, 2596#true, 734#true, 227#L112-6true, thread3Thread1of1ForFork0InUse, 3661#true, thread2Thread1of1ForFork2InUse, 730#true, thread1Thread1of1ForFork1NotInUse, 642#L159-2true, 746#true, 764#true, 750#true, 4726#true]) [2023-12-09 15:12:12,793 INFO L294 olderBase$Statistics]: this new event has 419 ancestors and is cut-off event [2023-12-09 15:12:12,793 INFO L297 olderBase$Statistics]: existing Event has 419 ancestors and is cut-off event [2023-12-09 15:12:12,793 INFO L297 olderBase$Statistics]: existing Event has 419 ancestors and is cut-off event [2023-12-09 15:12:12,793 INFO L297 olderBase$Statistics]: existing Event has 419 ancestors and is cut-off event [2023-12-09 15:12:12,800 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2411] thread1EXIT-->L159-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem94#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][971], [6831#(= ~break_14~0 0), 738#true, 262#L92-11true, 742#true, 754#true, 2596#true, 734#true, 101#L123-16true, thread3Thread1of1ForFork0InUse, 3661#true, thread2Thread1of1ForFork2InUse, 730#true, thread1Thread1of1ForFork1NotInUse, 642#L159-2true, 746#true, 764#true, 750#true, 4726#true]) [2023-12-09 15:12:12,801 INFO L294 olderBase$Statistics]: this new event has 419 ancestors and is cut-off event [2023-12-09 15:12:12,801 INFO L297 olderBase$Statistics]: existing Event has 419 ancestors and is cut-off event [2023-12-09 15:12:12,801 INFO L297 olderBase$Statistics]: existing Event has 419 ancestors and is cut-off event [2023-12-09 15:12:12,801 INFO L297 olderBase$Statistics]: existing Event has 419 ancestors and is cut-off event [2023-12-09 15:12:12,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2095] L96-13-->L96-14: Formula: (= |v_thread2Thread1of1ForFork2_#t~ite43#1_3| |v_thread2Thread1of1ForFork2_#t~ite44#1_7|) InVars {thread2Thread1of1ForFork2_#t~ite43#1=|v_thread2Thread1of1ForFork2_#t~ite43#1_3|} OutVars{thread2Thread1of1ForFork2_#t~ite43#1=|v_thread2Thread1of1ForFork2_#t~ite43#1_3|, thread2Thread1of1ForFork2_#t~ite44#1=|v_thread2Thread1of1ForFork2_#t~ite44#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~ite44#1][415], [6831#(= ~break_14~0 0), 690#L96-14true, 738#true, 754#true, 2596#true, 744#(= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))), 734#true, 748#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), thread3Thread1of1ForFork0InUse, 3661#true, thread2Thread1of1ForFork2InUse, 730#true, thread1Thread1of1ForFork1NotInUse, 764#true, 642#L159-2true, 750#true, 45#L114-6true, 4726#true]) [2023-12-09 15:12:12,880 INFO L294 olderBase$Statistics]: this new event has 419 ancestors and is cut-off event [2023-12-09 15:12:12,880 INFO L297 olderBase$Statistics]: existing Event has 419 ancestors and is cut-off event [2023-12-09 15:12:12,880 INFO L297 olderBase$Statistics]: existing Event has 419 ancestors and is cut-off event [2023-12-09 15:12:12,880 INFO L297 olderBase$Statistics]: existing Event has 419 ancestors and is cut-off event [2023-12-09 15:12:14,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2411] thread1EXIT-->L159-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem94#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem94#1=|v_ULTIMATE.start_main_#t~mem94#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][971], [6831#(= ~break_14~0 0), 738#true, 262#L92-11true, 754#true, 742#true, 2596#true, 734#true, thread3Thread1of1ForFork0InUse, 3661#true, thread2Thread1of1ForFork2InUse, 730#true, thread1Thread1of1ForFork1NotInUse, 746#true, 764#true, 642#L159-2true, 750#true, 45#L114-6true, 4726#true]) [2023-12-09 15:12:14,480 INFO L294 olderBase$Statistics]: this new event has 429 ancestors and is cut-off event [2023-12-09 15:12:14,480 INFO L297 olderBase$Statistics]: existing Event has 429 ancestors and is cut-off event [2023-12-09 15:12:14,480 INFO L297 olderBase$Statistics]: existing Event has 429 ancestors and is cut-off event [2023-12-09 15:12:14,480 INFO L297 olderBase$Statistics]: existing Event has 429 ancestors and is cut-off event [2023-12-09 15:12:16,100 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2095] L96-13-->L96-14: Formula: (= |v_thread2Thread1of1ForFork2_#t~ite43#1_3| |v_thread2Thread1of1ForFork2_#t~ite44#1_7|) InVars {thread2Thread1of1ForFork2_#t~ite43#1=|v_thread2Thread1of1ForFork2_#t~ite43#1_3|} OutVars{thread2Thread1of1ForFork2_#t~ite43#1=|v_thread2Thread1of1ForFork2_#t~ite43#1_3|, thread2Thread1of1ForFork2_#t~ite44#1=|v_thread2Thread1of1ForFork2_#t~ite44#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~ite44#1][415], [6831#(= ~break_14~0 0), 738#true, 690#L96-14true, 754#true, 742#true, 2596#true, 734#true, thread3Thread1of1ForFork0InUse, 3661#true, thread2Thread1of1ForFork2InUse, 730#true, thread1Thread1of1ForFork1NotInUse, 746#true, 764#true, 642#L159-2true, 750#true, 45#L114-6true, 4726#true]) [2023-12-09 15:12:16,100 INFO L294 olderBase$Statistics]: this new event has 441 ancestors and is cut-off event [2023-12-09 15:12:16,100 INFO L297 olderBase$Statistics]: existing Event has 441 ancestors and is cut-off event [2023-12-09 15:12:16,100 INFO L297 olderBase$Statistics]: existing Event has 441 ancestors and is cut-off event [2023-12-09 15:12:16,115 INFO L297 olderBase$Statistics]: existing Event has 441 ancestors and is cut-off event [2023-12-09 15:12:19,574 INFO L124 PetriNetUnfolderBase]: 12732/82343 cut-off events. [2023-12-09 15:12:19,574 INFO L125 PetriNetUnfolderBase]: For 1013310/1292539 co-relation queries the response was YES. [2023-12-09 15:12:21,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155944 conditions, 82343 events. 12732/82343 cut-off events. For 1013310/1292539 co-relation queries the response was YES. Maximal size of possible extension queue 1866. Compared 1295427 event pairs, 4391 based on Foata normal form. 548/73714 useless extension candidates. Maximal degree in co-relation 149082. Up to 13144 conditions per place. [2023-12-09 15:12:21,873 INFO L140 encePairwiseOnDemand]: 785/790 looper letters, 151 selfloop transitions, 4 changer transitions 66/1182 dead transitions. [2023-12-09 15:12:21,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 785 places, 1182 transitions, 9589 flow [2023-12-09 15:12:21,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:12:21,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:12:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2226 transitions. [2023-12-09 15:12:21,876 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9392405063291139 [2023-12-09 15:12:21,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2226 transitions. [2023-12-09 15:12:21,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2226 transitions. [2023-12-09 15:12:21,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:12:21,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2226 transitions. [2023-12-09 15:12:21,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:12:21,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 790.0) internal successors, (3160), 4 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:12:21,888 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 790.0) internal successors, (3160), 4 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:12:21,888 INFO L308 CegarLoopForPetriNet]: 713 programPoint places, 72 predicate places. [2023-12-09 15:12:21,888 INFO L500 AbstractCegarLoop]: Abstraction has has 785 places, 1182 transitions, 9589 flow [2023-12-09 15:12:21,888 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 735.6666666666666) internal successors, (2207), 3 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:12:21,889 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:12:21,889 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:12:21,889 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-09 15:12:21,889 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:12:21,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:12:21,889 INFO L85 PathProgramCache]: Analyzing trace with hash 735036060, now seen corresponding path program 1 times [2023-12-09 15:12:21,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:12:21,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388581124] [2023-12-09 15:12:21,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:12:21,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:12:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:12:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2023-12-09 15:12:22,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:12:22,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388581124] [2023-12-09 15:12:22,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388581124] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:12:22,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:12:22,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:12:22,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143511521] [2023-12-09 15:12:22,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:12:22,192 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:12:22,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:12:22,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:12:22,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:12:22,194 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 790 [2023-12-09 15:12:22,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 785 places, 1182 transitions, 9589 flow. Second operand has 3 states, 3 states have (on average 735.6666666666666) internal successors, (2207), 3 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:12:22,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:12:22,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 790 [2023-12-09 15:12:22,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:12:28,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2412] thread2EXIT-->L160-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem95#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_#t~mem95#1=|v_ULTIMATE.start_main_#t~mem95#1_6|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_#t~mem95#1=|v_ULTIMATE.start_main_#t~mem95#1_6|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][1014], [738#true, 145#L119-1true, 754#true, 2596#true, 744#(= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))), 734#true, 6835#(= ~break_20~0 0), 627#L160-2true, 6829#true, 748#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2NotInUse, 3661#true, 732#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), thread1Thread1of1ForFork1NotInUse, 764#true, 750#true, 4726#true]) [2023-12-09 15:12:28,551 INFO L294 olderBase$Statistics]: this new event has 372 ancestors and is cut-off event [2023-12-09 15:12:28,551 INFO L297 olderBase$Statistics]: existing Event has 372 ancestors and is cut-off event [2023-12-09 15:12:28,551 INFO L297 olderBase$Statistics]: existing Event has 372 ancestors and is cut-off event [2023-12-09 15:12:28,551 INFO L297 olderBase$Statistics]: existing Event has 372 ancestors and is cut-off event [2023-12-09 15:12:32,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2306] L119-10-->L119-11: Formula: (= v_~result_18~0_8 |v_thread3Thread1of1ForFork0_#t~ite63#1_3|) InVars {thread3Thread1of1ForFork0_#t~ite63#1=|v_thread3Thread1of1ForFork0_#t~ite63#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite63#1=|v_thread3Thread1of1ForFork0_#t~ite63#1_3|, ~result_18~0=v_~result_18~0_8} AuxVars[] AssignedVars[~result_18~0][945], [738#true, 84#L119-11true, 754#true, 2596#true, 744#(= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))), 734#true, 6835#(= ~break_20~0 0), 6829#true, thread3Thread1of1ForFork0InUse, 748#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 3661#true, thread2Thread1of1ForFork2InUse, 732#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), thread1Thread1of1ForFork1NotInUse, 764#true, 642#L159-2true, 750#true, 669#L96-15true, 4726#true]) [2023-12-09 15:12:32,198 INFO L294 olderBase$Statistics]: this new event has 388 ancestors and is cut-off event [2023-12-09 15:12:32,198 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2023-12-09 15:12:32,198 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2023-12-09 15:12:32,198 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2023-12-09 15:12:32,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2306] L119-10-->L119-11: Formula: (= v_~result_18~0_8 |v_thread3Thread1of1ForFork0_#t~ite63#1_3|) InVars {thread3Thread1of1ForFork0_#t~ite63#1=|v_thread3Thread1of1ForFork0_#t~ite63#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite63#1=|v_thread3Thread1of1ForFork0_#t~ite63#1_3|, ~result_18~0=v_~result_18~0_8} AuxVars[] AssignedVars[~result_18~0][945], [738#true, 84#L119-11true, 754#true, 2596#true, 744#(= ~is_null_9~0 (* 256 (div ~is_null_9~0 256))), 734#true, 6835#(= ~break_20~0 0), 6829#true, thread3Thread1of1ForFork0InUse, 748#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 3661#true, thread2Thread1of1ForFork2InUse, 732#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), thread1Thread1of1ForFork1NotInUse, 764#true, 642#L159-2true, 750#true, 238#L96-16true, 4726#true]) [2023-12-09 15:12:32,397 INFO L294 olderBase$Statistics]: this new event has 389 ancestors and is cut-off event [2023-12-09 15:12:32,397 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2023-12-09 15:12:32,397 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2023-12-09 15:12:32,397 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event