/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/parallel-misc-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:18:05,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:18:05,246 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:18:05,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:18:05,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:18:05,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:18:05,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:18:05,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:18:05,275 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:18:05,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:18:05,279 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:18:05,279 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:18:05,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:18:05,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:18:05,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:18:05,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:18:05,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:18:05,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:18:05,281 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:18:05,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:18:05,281 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:18:05,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:18:05,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:18:05,284 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:18:05,285 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:18:05,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:18:05,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:18:05,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:18:05,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:18:05,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:18:05,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:18:05,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:18:05,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:18:05,286 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:18:05,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:18:05,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:18:05,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:18:05,511 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:18:05,512 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:18:05,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c [2023-12-09 15:18:06,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:18:06,692 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:18:06,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c [2023-12-09 15:18:06,697 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c743dce9c/529a6a260d2c48168f32602bfbe21ca8/FLAGead59be00 [2023-12-09 15:18:06,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c743dce9c/529a6a260d2c48168f32602bfbe21ca8 [2023-12-09 15:18:06,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:18:06,710 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:18:06,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:18:06,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:18:06,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:18:06,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:18:06" (1/1) ... [2023-12-09 15:18:06,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e10456b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:18:06, skipping insertion in model container [2023-12-09 15:18:06,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:18:06" (1/1) ... [2023-12-09 15:18:06,734 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:18:06,852 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/parallel-misc-4.wvr.c[2989,3002] [2023-12-09 15:18:06,855 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:18:06,861 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:18:06,875 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/parallel-misc-4.wvr.c[2989,3002] [2023-12-09 15:18:06,876 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:18:06,883 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:18:06,883 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:18:06,888 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:18:06,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:18:06 WrapperNode [2023-12-09 15:18:06,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:18:06,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:18:06,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:18:06,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:18:06,894 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:18:06" (1/1) ... [2023-12-09 15:18:06,906 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:18:06" (1/1) ... [2023-12-09 15:18:06,927 INFO L138 Inliner]: procedures = 22, calls = 43, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2023-12-09 15:18:06,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:18:06,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:18:06,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:18:06,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:18:06,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:18:06" (1/1) ... [2023-12-09 15:18:06,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:18:06" (1/1) ... [2023-12-09 15:18:06,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:18:06" (1/1) ... [2023-12-09 15:18:06,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:18:06" (1/1) ... [2023-12-09 15:18:06,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:18:06" (1/1) ... [2023-12-09 15:18:06,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:18:06" (1/1) ... [2023-12-09 15:18:06,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:18:06" (1/1) ... [2023-12-09 15:18:06,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:18:06" (1/1) ... [2023-12-09 15:18:06,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:18:06,955 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:18:06,955 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:18:06,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:18:06,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:18:06" (1/1) ... [2023-12-09 15:18:06,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:18:06,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:18:06,978 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:18:06,983 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:18:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:18:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:18:06,997 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:18:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:18:06,997 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:18:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:18:06,997 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:18:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:18:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:18:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:18:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:18:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:18:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:18:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:18:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:18:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:18:06,999 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:18:07,063 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:18:07,065 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:18:07,215 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:18:07,235 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:18:07,236 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-09 15:18:07,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:18:07 BoogieIcfgContainer [2023-12-09 15:18:07,237 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:18:07,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:18:07,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:18:07,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:18:07,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:18:06" (1/3) ... [2023-12-09 15:18:07,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55932ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:18:07, skipping insertion in model container [2023-12-09 15:18:07,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:18:06" (2/3) ... [2023-12-09 15:18:07,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55932ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:18:07, skipping insertion in model container [2023-12-09 15:18:07,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:18:07" (3/3) ... [2023-12-09 15:18:07,243 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2023-12-09 15:18:07,255 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:18:07,255 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:18:07,255 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:18:07,321 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:18:07,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 108 transitions, 237 flow [2023-12-09 15:18:07,398 INFO L124 PetriNetUnfolderBase]: 7/105 cut-off events. [2023-12-09 15:18:07,398 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:18:07,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 105 events. 7/105 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-12-09 15:18:07,412 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 108 transitions, 237 flow [2023-12-09 15:18:07,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 94 transitions, 206 flow [2023-12-09 15:18:07,432 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:18:07,437 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;@d484d12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:18:07,438 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 15:18:07,482 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:18:07,482 INFO L124 PetriNetUnfolderBase]: 7/93 cut-off events. [2023-12-09 15:18:07,482 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:18:07,482 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:18:07,483 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] [2023-12-09 15:18:07,484 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:18:07,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:18:07,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1920082472, now seen corresponding path program 1 times [2023-12-09 15:18:07,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:18:07,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127008528] [2023-12-09 15:18:07,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:07,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:18:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:08,098 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:18:08,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:18:08,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127008528] [2023-12-09 15:18:08,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127008528] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:18:08,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:18:08,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:18:08,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165906665] [2023-12-09 15:18:08,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:18:08,109 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:18:08,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:18:08,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:18:08,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:18:08,139 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 108 [2023-12-09 15:18:08,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have 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:18:08,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:18:08,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 108 [2023-12-09 15:18:08,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:18:08,477 INFO L124 PetriNetUnfolderBase]: 299/822 cut-off events. [2023-12-09 15:18:08,478 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-12-09 15:18:08,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1406 conditions, 822 events. 299/822 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4820 event pairs, 78 based on Foata normal form. 44/769 useless extension candidates. Maximal degree in co-relation 1063. Up to 193 conditions per place. [2023-12-09 15:18:08,488 INFO L140 encePairwiseOnDemand]: 94/108 looper letters, 48 selfloop transitions, 9 changer transitions 30/150 dead transitions. [2023-12-09 15:18:08,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 150 transitions, 528 flow [2023-12-09 15:18:08,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:18:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:18:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 786 transitions. [2023-12-09 15:18:08,500 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.808641975308642 [2023-12-09 15:18:08,500 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 786 transitions. [2023-12-09 15:18:08,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 786 transitions. [2023-12-09 15:18:08,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:18:08,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 786 transitions. [2023-12-09 15:18:08,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.33333333333333) internal successors, (786), 9 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:18:08,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have 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:18:08,515 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have 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:18:08,519 INFO L308 CegarLoopForPetriNet]: 97 programPoint places, 8 predicate places. [2023-12-09 15:18:08,519 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 150 transitions, 528 flow [2023-12-09 15:18:08,519 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have 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:18:08,519 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:18:08,520 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] [2023-12-09 15:18:08,520 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:18:08,520 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:18:08,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:18:08,521 INFO L85 PathProgramCache]: Analyzing trace with hash 438828278, now seen corresponding path program 2 times [2023-12-09 15:18:08,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:18:08,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560380491] [2023-12-09 15:18:08,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:08,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:18:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:08,751 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:18:08,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:18:08,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560380491] [2023-12-09 15:18:08,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560380491] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:18:08,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:18:08,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:18:08,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471312113] [2023-12-09 15:18:08,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:18:08,754 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:18:08,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:18:08,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:18:08,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:18:08,756 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 108 [2023-12-09 15:18:08,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 150 transitions, 528 flow. Second operand has 6 states, 6 states have (on average 83.0) internal successors, (498), 6 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have 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:18:08,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:18:08,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 108 [2023-12-09 15:18:08,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:18:08,896 INFO L124 PetriNetUnfolderBase]: 336/940 cut-off events. [2023-12-09 15:18:08,896 INFO L125 PetriNetUnfolderBase]: For 482/554 co-relation queries the response was YES. [2023-12-09 15:18:08,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 940 events. 336/940 cut-off events. For 482/554 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5781 event pairs, 66 based on Foata normal form. 1/819 useless extension candidates. Maximal degree in co-relation 1701. Up to 228 conditions per place. [2023-12-09 15:18:08,904 INFO L140 encePairwiseOnDemand]: 102/108 looper letters, 51 selfloop transitions, 9 changer transitions 29/163 dead transitions. [2023-12-09 15:18:08,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 163 transitions, 737 flow [2023-12-09 15:18:08,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-09 15:18:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-09 15:18:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 517 transitions. [2023-12-09 15:18:08,906 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7978395061728395 [2023-12-09 15:18:08,906 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 517 transitions. [2023-12-09 15:18:08,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 517 transitions. [2023-12-09 15:18:08,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:18:08,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 517 transitions. [2023-12-09 15:18:08,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have 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:18:08,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have 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:18:08,908 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have 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:18:08,909 INFO L308 CegarLoopForPetriNet]: 97 programPoint places, 13 predicate places. [2023-12-09 15:18:08,909 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 163 transitions, 737 flow [2023-12-09 15:18:08,910 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.0) internal successors, (498), 6 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have 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:18:08,910 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:18:08,910 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] [2023-12-09 15:18:08,910 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:18:08,910 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:18:08,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:18:08,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1552210506, now seen corresponding path program 3 times [2023-12-09 15:18:08,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:18:08,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531178392] [2023-12-09 15:18:08,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:08,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:18:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:09,083 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:18:09,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:18:09,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531178392] [2023-12-09 15:18:09,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531178392] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:18:09,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:18:09,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:18:09,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368846550] [2023-12-09 15:18:09,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:18:09,086 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:18:09,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:18:09,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:18:09,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:18:09,090 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 108 [2023-12-09 15:18:09,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 163 transitions, 737 flow. Second operand has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have 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:18:09,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:18:09,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 108 [2023-12-09 15:18:09,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:18:09,284 INFO L124 PetriNetUnfolderBase]: 356/941 cut-off events. [2023-12-09 15:18:09,285 INFO L125 PetriNetUnfolderBase]: For 1039/1331 co-relation queries the response was YES. [2023-12-09 15:18:09,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2483 conditions, 941 events. 356/941 cut-off events. For 1039/1331 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5733 event pairs, 20 based on Foata normal form. 7/830 useless extension candidates. Maximal degree in co-relation 2274. Up to 251 conditions per place. [2023-12-09 15:18:09,290 INFO L140 encePairwiseOnDemand]: 100/108 looper letters, 50 selfloop transitions, 13 changer transitions 35/172 dead transitions. [2023-12-09 15:18:09,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 172 transitions, 963 flow [2023-12-09 15:18:09,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:18:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:18:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 600 transitions. [2023-12-09 15:18:09,292 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7936507936507936 [2023-12-09 15:18:09,292 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 600 transitions. [2023-12-09 15:18:09,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 600 transitions. [2023-12-09 15:18:09,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:18:09,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 600 transitions. [2023-12-09 15:18:09,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have 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:18:09,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have 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:18:09,295 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have 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:18:09,296 INFO L308 CegarLoopForPetriNet]: 97 programPoint places, 19 predicate places. [2023-12-09 15:18:09,296 INFO L500 AbstractCegarLoop]: Abstraction has has 116 places, 172 transitions, 963 flow [2023-12-09 15:18:09,297 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have 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:18:09,297 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:18:09,297 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] [2023-12-09 15:18:09,297 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:18:09,297 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:18:09,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:18:09,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1314969152, now seen corresponding path program 4 times [2023-12-09 15:18:09,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:18:09,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945631131] [2023-12-09 15:18:09,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:09,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:18:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:09,479 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:18:09,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:18:09,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945631131] [2023-12-09 15:18:09,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945631131] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:18:09,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:18:09,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:18:09,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129326967] [2023-12-09 15:18:09,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:18:09,481 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:18:09,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:18:09,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:18:09,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:18:09,482 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 108 [2023-12-09 15:18:09,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 172 transitions, 963 flow. Second operand has 7 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have 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:18:09,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:18:09,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 108 [2023-12-09 15:18:09,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:18:09,667 INFO L124 PetriNetUnfolderBase]: 389/944 cut-off events. [2023-12-09 15:18:09,667 INFO L125 PetriNetUnfolderBase]: For 1664/2066 co-relation queries the response was YES. [2023-12-09 15:18:09,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3069 conditions, 944 events. 389/944 cut-off events. For 1664/2066 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5635 event pairs, 23 based on Foata normal form. 7/838 useless extension candidates. Maximal degree in co-relation 2900. Up to 262 conditions per place. [2023-12-09 15:18:09,674 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 48 selfloop transitions, 7 changer transitions 80/200 dead transitions. [2023-12-09 15:18:09,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 200 transitions, 1379 flow [2023-12-09 15:18:09,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:18:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:18:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 760 transitions. [2023-12-09 15:18:09,676 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7818930041152263 [2023-12-09 15:18:09,676 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 760 transitions. [2023-12-09 15:18:09,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 760 transitions. [2023-12-09 15:18:09,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:18:09,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 760 transitions. [2023-12-09 15:18:09,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 84.44444444444444) internal successors, (760), 9 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have 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:18:09,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have 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:18:09,680 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have 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:18:09,682 INFO L308 CegarLoopForPetriNet]: 97 programPoint places, 27 predicate places. [2023-12-09 15:18:09,682 INFO L500 AbstractCegarLoop]: Abstraction has has 124 places, 200 transitions, 1379 flow [2023-12-09 15:18:09,682 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have 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:18:09,682 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:18:09,683 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] [2023-12-09 15:18:09,683 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:18:09,683 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:18:09,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:18:09,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1721964404, now seen corresponding path program 1 times [2023-12-09 15:18:09,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:18:09,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387325233] [2023-12-09 15:18:09,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:09,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:18:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:09,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:18:09,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387325233] [2023-12-09 15:18:09,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387325233] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:18:09,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:18:09,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:18:09,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905776198] [2023-12-09 15:18:09,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:18:09,874 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:18:09,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:18:09,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:18:09,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:18:09,876 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2023-12-09 15:18:09,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 200 transitions, 1379 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have 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:18:09,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:18:09,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2023-12-09 15:18:09,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:18:10,077 INFO L124 PetriNetUnfolderBase]: 676/1672 cut-off events. [2023-12-09 15:18:10,077 INFO L125 PetriNetUnfolderBase]: For 4198/5325 co-relation queries the response was YES. [2023-12-09 15:18:10,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6123 conditions, 1672 events. 676/1672 cut-off events. For 4198/5325 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11803 event pairs, 35 based on Foata normal form. 14/1518 useless extension candidates. Maximal degree in co-relation 5870. Up to 446 conditions per place. [2023-12-09 15:18:10,089 INFO L140 encePairwiseOnDemand]: 100/108 looper letters, 98 selfloop transitions, 31 changer transitions 120/321 dead transitions. [2023-12-09 15:18:10,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 321 transitions, 2937 flow [2023-12-09 15:18:10,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:18:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:18:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 657 transitions. [2023-12-09 15:18:10,091 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8690476190476191 [2023-12-09 15:18:10,091 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 657 transitions. [2023-12-09 15:18:10,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 657 transitions. [2023-12-09 15:18:10,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:18:10,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 657 transitions. [2023-12-09 15:18:10,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have 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:18:10,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have 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:18:10,095 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have 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:18:10,097 INFO L308 CegarLoopForPetriNet]: 97 programPoint places, 33 predicate places. [2023-12-09 15:18:10,097 INFO L500 AbstractCegarLoop]: Abstraction has has 130 places, 321 transitions, 2937 flow [2023-12-09 15:18:10,098 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have 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:18:10,098 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:18:10,098 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] [2023-12-09 15:18:10,098 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:18:10,098 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:18:10,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:18:10,099 INFO L85 PathProgramCache]: Analyzing trace with hash -427814, now seen corresponding path program 2 times [2023-12-09 15:18:10,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:18:10,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560209119] [2023-12-09 15:18:10,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:10,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:18:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:10,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:18:10,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560209119] [2023-12-09 15:18:10,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560209119] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:18:10,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:18:10,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:18:10,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435108592] [2023-12-09 15:18:10,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:18:10,212 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:18:10,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:18:10,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:18:10,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:18:10,213 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2023-12-09 15:18:10,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 321 transitions, 2937 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have 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:18:10,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:18:10,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2023-12-09 15:18:10,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:18:10,530 INFO L124 PetriNetUnfolderBase]: 922/2219 cut-off events. [2023-12-09 15:18:10,530 INFO L125 PetriNetUnfolderBase]: For 7921/10163 co-relation queries the response was YES. [2023-12-09 15:18:10,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9465 conditions, 2219 events. 922/2219 cut-off events. For 7921/10163 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 16712 event pairs, 24 based on Foata normal form. 64/2073 useless extension candidates. Maximal degree in co-relation 9169. Up to 611 conditions per place. [2023-12-09 15:18:10,547 INFO L140 encePairwiseOnDemand]: 99/108 looper letters, 146 selfloop transitions, 68 changer transitions 265/551 dead transitions. [2023-12-09 15:18:10,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 551 transitions, 6285 flow [2023-12-09 15:18:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:18:10,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:18:10,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 653 transitions. [2023-12-09 15:18:10,549 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8637566137566137 [2023-12-09 15:18:10,549 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 653 transitions. [2023-12-09 15:18:10,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 653 transitions. [2023-12-09 15:18:10,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:18:10,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 653 transitions. [2023-12-09 15:18:10,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have 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:18:10,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have 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:18:10,551 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have 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:18:10,552 INFO L308 CegarLoopForPetriNet]: 97 programPoint places, 39 predicate places. [2023-12-09 15:18:10,552 INFO L500 AbstractCegarLoop]: Abstraction has has 136 places, 551 transitions, 6285 flow [2023-12-09 15:18:10,552 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have 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:18:10,552 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:18:10,553 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:18:10,553 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:18:10,553 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:18:10,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:18:10,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1288679036, now seen corresponding path program 3 times [2023-12-09 15:18:10,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:18:10,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571951995] [2023-12-09 15:18:10,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:10,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:18:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:10,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:18:10,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571951995] [2023-12-09 15:18:10,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571951995] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:18:10,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:18:10,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:18:10,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906296023] [2023-12-09 15:18:10,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:18:10,634 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:18:10,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:18:10,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:18:10,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:18:10,635 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2023-12-09 15:18:10,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 551 transitions, 6285 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have 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:18:10,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:18:10,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2023-12-09 15:18:10,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:18:11,048 INFO L124 PetriNetUnfolderBase]: 1387/3379 cut-off events. [2023-12-09 15:18:11,048 INFO L125 PetriNetUnfolderBase]: For 14026/15485 co-relation queries the response was YES. [2023-12-09 15:18:11,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14976 conditions, 3379 events. 1387/3379 cut-off events. For 14026/15485 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 28360 event pairs, 64 based on Foata normal form. 53/3111 useless extension candidates. Maximal degree in co-relation 14481. Up to 993 conditions per place. [2023-12-09 15:18:11,073 INFO L140 encePairwiseOnDemand]: 102/108 looper letters, 115 selfloop transitions, 5 changer transitions 212/571 dead transitions. [2023-12-09 15:18:11,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 571 transitions, 6965 flow [2023-12-09 15:18:11,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:18:11,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:18:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 448 transitions. [2023-12-09 15:18:11,075 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8296296296296296 [2023-12-09 15:18:11,075 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 448 transitions. [2023-12-09 15:18:11,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 448 transitions. [2023-12-09 15:18:11,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:18:11,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 448 transitions. [2023-12-09 15:18:11,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have 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:18:11,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have 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:18:11,078 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have 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:18:11,079 INFO L308 CegarLoopForPetriNet]: 97 programPoint places, 43 predicate places. [2023-12-09 15:18:11,079 INFO L500 AbstractCegarLoop]: Abstraction has has 140 places, 571 transitions, 6965 flow [2023-12-09 15:18:11,079 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have 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:18:11,079 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:18:11,080 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] [2023-12-09 15:18:11,080 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 15:18:11,080 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:18:11,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:18:11,080 INFO L85 PathProgramCache]: Analyzing trace with hash -654128161, now seen corresponding path program 1 times [2023-12-09 15:18:11,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:18:11,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103513386] [2023-12-09 15:18:11,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:11,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:18:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:11,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:11,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:18:11,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103513386] [2023-12-09 15:18:11,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103513386] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:18:11,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534219930] [2023-12-09 15:18:11,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:11,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:18:11,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:18:11,208 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:18:11,236 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:18:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:11,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 15:18:11,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:18:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:11,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:18:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:11,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534219930] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:18:11,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:18:11,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-12-09 15:18:11,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610846958] [2023-12-09 15:18:11,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:18:11,402 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:18:11,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:18:11,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:18:11,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:18:11,403 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 108 [2023-12-09 15:18:11,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 571 transitions, 6965 flow. Second operand has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have 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:18:11,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:18:11,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 108 [2023-12-09 15:18:11,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:18:12,033 INFO L124 PetriNetUnfolderBase]: 1720/4119 cut-off events. [2023-12-09 15:18:12,034 INFO L125 PetriNetUnfolderBase]: For 20581/24364 co-relation queries the response was YES. [2023-12-09 15:18:12,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20761 conditions, 4119 events. 1720/4119 cut-off events. For 20581/24364 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 35595 event pairs, 27 based on Foata normal form. 75/3875 useless extension candidates. Maximal degree in co-relation 20271. Up to 1165 conditions per place. [2023-12-09 15:18:12,073 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 227 selfloop transitions, 64 changer transitions 377/785 dead transitions. [2023-12-09 15:18:12,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 785 transitions, 11156 flow [2023-12-09 15:18:12,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-09 15:18:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-09 15:18:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2023-12-09 15:18:12,075 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8780864197530864 [2023-12-09 15:18:12,075 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 569 transitions. [2023-12-09 15:18:12,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 569 transitions. [2023-12-09 15:18:12,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:18:12,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 569 transitions. [2023-12-09 15:18:12,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have 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:18:12,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have 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:18:12,078 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have 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:18:12,079 INFO L308 CegarLoopForPetriNet]: 97 programPoint places, 48 predicate places. [2023-12-09 15:18:12,079 INFO L500 AbstractCegarLoop]: Abstraction has has 145 places, 785 transitions, 11156 flow [2023-12-09 15:18:12,080 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have 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:18:12,080 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:18:12,080 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] [2023-12-09 15:18:12,089 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:18:12,285 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:18:12,285 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:18:12,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:18:12,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1010557215, now seen corresponding path program 2 times [2023-12-09 15:18:12,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:18:12,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941706171] [2023-12-09 15:18:12,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:12,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:18:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:12,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:18:12,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941706171] [2023-12-09 15:18:12,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941706171] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:18:12,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:18:12,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:18:12,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574722470] [2023-12-09 15:18:12,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:18:12,376 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:18:12,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:18:12,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:18:12,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:18:12,377 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2023-12-09 15:18:12,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 785 transitions, 11156 flow. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have 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:18:12,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:18:12,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2023-12-09 15:18:12,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:18:13,211 INFO L124 PetriNetUnfolderBase]: 2577/5851 cut-off events. [2023-12-09 15:18:13,211 INFO L125 PetriNetUnfolderBase]: For 50636/52965 co-relation queries the response was YES. [2023-12-09 15:18:13,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32506 conditions, 5851 events. 2577/5851 cut-off events. For 50636/52965 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 52520 event pairs, 90 based on Foata normal form. 15/5353 useless extension candidates. Maximal degree in co-relation 31951. Up to 1726 conditions per place. [2023-12-09 15:18:13,266 INFO L140 encePairwiseOnDemand]: 102/108 looper letters, 233 selfloop transitions, 5 changer transitions 278/878 dead transitions. [2023-12-09 15:18:13,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 878 transitions, 13591 flow [2023-12-09 15:18:13,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:18:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:18:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2023-12-09 15:18:13,268 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8314814814814815 [2023-12-09 15:18:13,268 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 449 transitions. [2023-12-09 15:18:13,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 449 transitions. [2023-12-09 15:18:13,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:18:13,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 449 transitions. [2023-12-09 15:18:13,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have 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:18:13,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have 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:18:13,270 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have 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:18:13,271 INFO L308 CegarLoopForPetriNet]: 97 programPoint places, 52 predicate places. [2023-12-09 15:18:13,273 INFO L500 AbstractCegarLoop]: Abstraction has has 149 places, 878 transitions, 13591 flow [2023-12-09 15:18:13,273 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have 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:18:13,273 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:18:13,273 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:13,273 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 15:18:13,274 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:18:13,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:18:13,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1881511676, now seen corresponding path program 1 times [2023-12-09 15:18:13,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:18:13,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227982566] [2023-12-09 15:18:13,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:13,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:18:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:13,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:18:13,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227982566] [2023-12-09 15:18:13,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227982566] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:18:13,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292960208] [2023-12-09 15:18:13,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:13,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:18:13,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:18:13,482 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:18:13,516 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:18:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:13,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-09 15:18:13,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:18:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:13,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:18:13,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:13,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292960208] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:18:13,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:18:13,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2023-12-09 15:18:13,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472318122] [2023-12-09 15:18:13,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:18:13,776 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-09 15:18:13,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:18:13,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-09 15:18:13,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-12-09 15:18:13,777 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 108 [2023-12-09 15:18:13,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 878 transitions, 13591 flow. Second operand has 14 states, 14 states have (on average 78.92857142857143) internal successors, (1105), 14 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have 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:18:13,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:18:13,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 108 [2023-12-09 15:18:13,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:18:15,580 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([259] L52-->L54: Formula: (= (+ v_~pos~0_25 1) v_~pos~0_26) InVars {~pos~0=v_~pos~0_26} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][1264], [130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 692#true, 36#L81true, 153#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 194#true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-12-09 15:18:15,580 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-12-09 15:18:15,580 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-12-09 15:18:15,580 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-12-09 15:18:15,580 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-12-09 15:18:15,802 INFO L124 PetriNetUnfolderBase]: 4831/10841 cut-off events. [2023-12-09 15:18:15,803 INFO L125 PetriNetUnfolderBase]: For 116002/119471 co-relation queries the response was YES. [2023-12-09 15:18:15,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67344 conditions, 10841 events. 4831/10841 cut-off events. For 116002/119471 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 105540 event pairs, 196 based on Foata normal form. 95/9935 useless extension candidates. Maximal degree in co-relation 64765. Up to 4094 conditions per place. [2023-12-09 15:18:15,904 INFO L140 encePairwiseOnDemand]: 92/108 looper letters, 765 selfloop transitions, 451 changer transitions 525/1870 dead transitions. [2023-12-09 15:18:15,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 1870 transitions, 33817 flow [2023-12-09 15:18:15,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-09 15:18:15,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-12-09 15:18:15,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2076 transitions. [2023-12-09 15:18:15,908 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7688888888888888 [2023-12-09 15:18:15,908 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2076 transitions. [2023-12-09 15:18:15,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2076 transitions. [2023-12-09 15:18:15,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:18:15,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2076 transitions. [2023-12-09 15:18:15,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 83.04) internal successors, (2076), 25 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have 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:18:15,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 108.0) internal successors, (2808), 26 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have 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:18:15,916 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 108.0) internal successors, (2808), 26 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have 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:18:15,916 INFO L308 CegarLoopForPetriNet]: 97 programPoint places, 76 predicate places. [2023-12-09 15:18:15,916 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 1870 transitions, 33817 flow [2023-12-09 15:18:15,917 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 78.92857142857143) internal successors, (1105), 14 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have 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:18:15,917 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:18:15,917 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:15,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-09 15:18:16,121 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,SelfDestructingSolverStorable9 [2023-12-09 15:18:16,123 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:18:16,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:18:16,124 INFO L85 PathProgramCache]: Analyzing trace with hash 881720162, now seen corresponding path program 2 times [2023-12-09 15:18:16,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:18:16,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021854359] [2023-12-09 15:18:16,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:16,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:18:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:16,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-09 15:18:16,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:18:16,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021854359] [2023-12-09 15:18:16,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021854359] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:18:16,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:18:16,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:18:16,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984922263] [2023-12-09 15:18:16,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:18:16,281 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:18:16,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:18:16,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:18:16,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:18:16,282 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2023-12-09 15:18:16,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 1870 transitions, 33817 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have 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:18:16,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:18:16,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2023-12-09 15:18:16,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:18:17,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][567], [1259#true, 130#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 15#L71true, 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2023-12-09 15:18:17,129 INFO L294 olderBase$Statistics]: this new event has 66 ancestors and is cut-off event [2023-12-09 15:18:17,130 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:17,130 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:17,130 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:17,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][568], [130#true, 1259#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 692#true, 36#L81true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2023-12-09 15:18:17,334 INFO L294 olderBase$Statistics]: this new event has 68 ancestors and is cut-off event [2023-12-09 15:18:17,334 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-12-09 15:18:17,334 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-12-09 15:18:17,334 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-12-09 15:18:18,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1272], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), thread1Thread1of1ForFork1InUse, 153#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-12-09 15:18:18,391 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-12-09 15:18:18,391 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:18,391 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:18,391 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:18,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([259] L52-->L54: Formula: (= (+ v_~pos~0_25 1) v_~pos~0_26) InVars {~pos~0=v_~pos~0_26} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][1488], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 692#true, 36#L81true, thread1Thread1of1ForFork1InUse, 153#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 194#true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-12-09 15:18:18,816 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-12-09 15:18:18,816 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-12-09 15:18:18,816 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-12-09 15:18:18,816 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-12-09 15:18:19,229 INFO L124 PetriNetUnfolderBase]: 6077/13636 cut-off events. [2023-12-09 15:18:19,230 INFO L125 PetriNetUnfolderBase]: For 181746/185337 co-relation queries the response was YES. [2023-12-09 15:18:19,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92566 conditions, 13636 events. 6077/13636 cut-off events. For 181746/185337 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 138740 event pairs, 323 based on Foata normal form. 126/12487 useless extension candidates. Maximal degree in co-relation 88876. Up to 5186 conditions per place. [2023-12-09 15:18:19,369 INFO L140 encePairwiseOnDemand]: 99/108 looper letters, 1233 selfloop transitions, 233 changer transitions 660/2243 dead transitions. [2023-12-09 15:18:19,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 2243 transitions, 45515 flow [2023-12-09 15:18:19,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-09 15:18:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-09 15:18:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 562 transitions. [2023-12-09 15:18:19,371 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8672839506172839 [2023-12-09 15:18:19,371 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 562 transitions. [2023-12-09 15:18:19,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 562 transitions. [2023-12-09 15:18:19,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:18:19,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 562 transitions. [2023-12-09 15:18:19,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have 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:18:19,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have 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:18:19,373 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have 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:18:19,373 INFO L308 CegarLoopForPetriNet]: 97 programPoint places, 81 predicate places. [2023-12-09 15:18:19,373 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 2243 transitions, 45515 flow [2023-12-09 15:18:19,374 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have 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:18:19,374 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:18:19,374 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:19,374 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-09 15:18:19,374 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:18:19,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:18:19,374 INFO L85 PathProgramCache]: Analyzing trace with hash -822317636, now seen corresponding path program 3 times [2023-12-09 15:18:19,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:18:19,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165757317] [2023-12-09 15:18:19,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:19,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:18:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:19,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:18:19,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165757317] [2023-12-09 15:18:19,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165757317] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:18:19,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693305159] [2023-12-09 15:18:19,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:18:19,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:18:19,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:18:19,498 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:18:19,504 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:18:19,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-09 15:18:19,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:18:19,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:18:19,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:18:19,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:19,611 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:18:19,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:19,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693305159] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:18:19,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:18:19,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2023-12-09 15:18:19,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564754994] [2023-12-09 15:18:19,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:18:19,683 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:18:19,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:18:19,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:18:19,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:18:19,684 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2023-12-09 15:18:19,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 2243 transitions, 45515 flow. Second operand has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:18:19,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:18:19,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2023-12-09 15:18:19,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:18:21,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][593], [1259#true, 130#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 64#L76true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2023-12-09 15:18:21,264 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-12-09 15:18:21,264 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:21,264 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:21,264 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:22,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1510], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 153#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-12-09 15:18:22,589 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-12-09 15:18:22,589 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:22,589 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:22,589 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:22,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1123], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 153#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 64#L76true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-12-09 15:18:22,665 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-12-09 15:18:22,666 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:22,666 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:22,666 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:22,994 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1510], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), thread1Thread1of1ForFork1InUse, 153#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 15#L71true, 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-12-09 15:18:22,994 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-12-09 15:18:22,994 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:22,994 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:22,994 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:22,994 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:18:23,792 INFO L124 PetriNetUnfolderBase]: 6902/15403 cut-off events. [2023-12-09 15:18:23,792 INFO L125 PetriNetUnfolderBase]: For 240554/247086 co-relation queries the response was YES. [2023-12-09 15:18:23,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114466 conditions, 15403 events. 6902/15403 cut-off events. For 240554/247086 co-relation queries the response was YES. Maximal size of possible extension queue 899. Compared 158730 event pairs, 278 based on Foata normal form. 242/14274 useless extension candidates. Maximal degree in co-relation 113185. Up to 5910 conditions per place. [2023-12-09 15:18:23,941 INFO L140 encePairwiseOnDemand]: 99/108 looper letters, 1376 selfloop transitions, 567 changer transitions 831/2891 dead transitions. [2023-12-09 15:18:23,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 2891 transitions, 64043 flow [2023-12-09 15:18:23,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:18:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:18:23,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 654 transitions. [2023-12-09 15:18:23,943 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8650793650793651 [2023-12-09 15:18:23,943 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 654 transitions. [2023-12-09 15:18:23,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 654 transitions. [2023-12-09 15:18:23,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:18:23,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 654 transitions. [2023-12-09 15:18:23,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have 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:18:23,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have 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:18:23,945 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have 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:18:23,945 INFO L308 CegarLoopForPetriNet]: 97 programPoint places, 87 predicate places. [2023-12-09 15:18:23,945 INFO L500 AbstractCegarLoop]: Abstraction has has 184 places, 2891 transitions, 64043 flow [2023-12-09 15:18:23,946 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:18:23,946 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:18:23,946 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:23,955 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:18:24,151 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:18:24,152 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:18:24,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:18:24,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1749036126, now seen corresponding path program 4 times [2023-12-09 15:18:24,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:18:24,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867816419] [2023-12-09 15:18:24,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:24,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:18:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-09 15:18:24,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:18:24,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867816419] [2023-12-09 15:18:24,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867816419] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:18:24,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:18:24,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:18:24,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245974183] [2023-12-09 15:18:24,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:18:24,266 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:18:24,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:18:24,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:18:24,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:18:24,267 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2023-12-09 15:18:24,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 2891 transitions, 64043 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have 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:18:24,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:18:24,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2023-12-09 15:18:24,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:18:25,531 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][599], [1259#true, 130#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 1791#true, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2023-12-09 15:18:25,531 INFO L294 olderBase$Statistics]: this new event has 66 ancestors and is cut-off event [2023-12-09 15:18:25,531 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:25,531 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:25,531 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:25,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][598], [130#true, 1259#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 36#L81true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2023-12-09 15:18:25,804 INFO L294 olderBase$Statistics]: this new event has 68 ancestors and is cut-off event [2023-12-09 15:18:25,804 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-12-09 15:18:25,804 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-12-09 15:18:25,804 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-12-09 15:18:27,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1528], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 153#true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 15#L71true, 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-12-09 15:18:27,667 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-12-09 15:18:27,667 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:27,667 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:27,667 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:28,343 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1528], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-12-09 15:18:28,343 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-12-09 15:18:28,343 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:28,343 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:28,343 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:18:28,344 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:29,198 INFO L124 PetriNetUnfolderBase]: 6830/15284 cut-off events. [2023-12-09 15:18:29,198 INFO L125 PetriNetUnfolderBase]: For 281783/286727 co-relation queries the response was YES. [2023-12-09 15:18:29,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122588 conditions, 15284 events. 6830/15284 cut-off events. For 281783/286727 co-relation queries the response was YES. Maximal size of possible extension queue 896. Compared 157411 event pairs, 269 based on Foata normal form. 173/14114 useless extension candidates. Maximal degree in co-relation 117814. Up to 5954 conditions per place. [2023-12-09 15:18:29,362 INFO L140 encePairwiseOnDemand]: 99/108 looper letters, 1789 selfloop transitions, 169 changer transitions 852/2927 dead transitions. [2023-12-09 15:18:29,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 2927 transitions, 70588 flow [2023-12-09 15:18:29,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-09 15:18:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-09 15:18:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 554 transitions. [2023-12-09 15:18:29,364 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8549382716049383 [2023-12-09 15:18:29,364 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 554 transitions. [2023-12-09 15:18:29,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 554 transitions. [2023-12-09 15:18:29,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:18:29,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 554 transitions. [2023-12-09 15:18:29,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have 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:18:29,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have 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:18:29,368 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have 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:18:29,369 INFO L308 CegarLoopForPetriNet]: 97 programPoint places, 92 predicate places. [2023-12-09 15:18:29,369 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 2927 transitions, 70588 flow [2023-12-09 15:18:29,369 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have 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:18:29,369 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:18:29,369 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:29,369 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-09 15:18:29,371 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:18:29,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:18:29,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1997579234, now seen corresponding path program 5 times [2023-12-09 15:18:29,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:18:29,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500125086] [2023-12-09 15:18:29,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:29,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:18:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:29,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:18:29,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500125086] [2023-12-09 15:18:29,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500125086] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:18:29,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038976884] [2023-12-09 15:18:29,482 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-09 15:18:29,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:18:29,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:18:29,483 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:18:29,504 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:18:29,555 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-12-09 15:18:29,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:18:29,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:18:29,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:18:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:29,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:18:29,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:29,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038976884] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:18:29,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:18:29,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2023-12-09 15:18:29,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077711450] [2023-12-09 15:18:29,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:18:29,644 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:18:29,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:18:29,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:18:29,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:18:29,645 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2023-12-09 15:18:29,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 2927 transitions, 70588 flow. Second operand has 9 states, 9 states have (on average 87.66666666666667) internal successors, (789), 9 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have 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:18:29,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:18:29,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2023-12-09 15:18:29,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:18:31,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][596], [130#true, 1259#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 36#L81true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2023-12-09 15:18:31,204 INFO L294 olderBase$Statistics]: this new event has 68 ancestors and is cut-off event [2023-12-09 15:18:31,204 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-12-09 15:18:31,204 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-12-09 15:18:31,204 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-12-09 15:18:32,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1574], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-12-09 15:18:32,897 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-12-09 15:18:32,897 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:32,897 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:32,897 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:33,424 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1574], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 153#true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-12-09 15:18:33,424 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-12-09 15:18:33,425 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:33,425 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:33,425 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:18:33,425 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:34,574 INFO L124 PetriNetUnfolderBase]: 6826/15196 cut-off events. [2023-12-09 15:18:34,575 INFO L125 PetriNetUnfolderBase]: For 325713/331642 co-relation queries the response was YES. [2023-12-09 15:18:34,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131442 conditions, 15196 events. 6826/15196 cut-off events. For 325713/331642 co-relation queries the response was YES. Maximal size of possible extension queue 895. Compared 155957 event pairs, 261 based on Foata normal form. 203/14157 useless extension candidates. Maximal degree in co-relation 126436. Up to 6014 conditions per place. [2023-12-09 15:18:34,767 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 1650 selfloop transitions, 420 changer transitions 886/3073 dead transitions. [2023-12-09 15:18:34,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 3073 transitions, 79368 flow [2023-12-09 15:18:34,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-09 15:18:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-09 15:18:34,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1095 transitions. [2023-12-09 15:18:34,769 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8449074074074074 [2023-12-09 15:18:34,769 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1095 transitions. [2023-12-09 15:18:34,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1095 transitions. [2023-12-09 15:18:34,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:18:34,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1095 transitions. [2023-12-09 15:18:34,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 91.25) internal successors, (1095), 12 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have 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:18:34,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 108.0) internal successors, (1404), 13 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have 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:18:34,773 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 108.0) internal successors, (1404), 13 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have 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:18:34,773 INFO L308 CegarLoopForPetriNet]: 97 programPoint places, 103 predicate places. [2023-12-09 15:18:34,773 INFO L500 AbstractCegarLoop]: Abstraction has has 200 places, 3073 transitions, 79368 flow [2023-12-09 15:18:34,773 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.66666666666667) internal successors, (789), 9 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have 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:18:34,773 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:18:34,774 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:34,780 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:18:34,974 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:18:34,974 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:18:34,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:18:34,975 INFO L85 PathProgramCache]: Analyzing trace with hash -67874304, now seen corresponding path program 1 times [2023-12-09 15:18:34,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:18:34,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935068676] [2023-12-09 15:18:34,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:34,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:18:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:35,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:18:35,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935068676] [2023-12-09 15:18:35,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935068676] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:18:35,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289878564] [2023-12-09 15:18:35,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:35,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:18:35,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:18:35,130 INFO L229 MonitoredProcess]: Starting monitored process 6 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:18:35,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-09 15:18:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:35,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-09 15:18:35,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:18:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:35,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:18:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:18:35,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289878564] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:18:35,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:18:35,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2023-12-09 15:18:35,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878713476] [2023-12-09 15:18:35,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:18:35,350 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-09 15:18:35,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:18:35,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-09 15:18:35,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-12-09 15:18:35,351 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 108 [2023-12-09 15:18:35,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 3073 transitions, 79368 flow. Second operand has 14 states, 14 states have (on average 78.92857142857143) internal successors, (1105), 14 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have 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:18:35,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:18:35,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 108 [2023-12-09 15:18:35,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:18:37,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][692], [130#true, 1259#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 36#L81true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2023-12-09 15:18:37,270 INFO L294 olderBase$Statistics]: this new event has 68 ancestors and is cut-off event [2023-12-09 15:18:37,270 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-12-09 15:18:37,270 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-12-09 15:18:37,270 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-12-09 15:18:37,944 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][692], [130#true, 1259#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 27#L92true, 4#L111-4true, 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 64#L76true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2023-12-09 15:18:37,945 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-12-09 15:18:37,945 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:37,945 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:37,945 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:37,945 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][694], [130#true, 1259#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 27#L92true, 4#L111-4true, 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2023-12-09 15:18:37,945 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-12-09 15:18:37,945 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:37,945 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:37,945 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:38,674 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1525], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 2870#(and (= ~v_assert~0 1) (<= 0 ~pos~0) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 36#L81true, thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-12-09 15:18:38,674 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2023-12-09 15:18:38,674 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-12-09 15:18:38,674 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-12-09 15:18:38,674 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-12-09 15:18:40,436 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1525], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 2870#(and (= ~v_assert~0 1) (<= 0 ~pos~0) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 64#L76true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-12-09 15:18:40,436 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-12-09 15:18:40,436 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:40,436 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:40,436 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:40,437 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2199], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2870#(and (= ~v_assert~0 1) (<= 0 ~pos~0) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 15#L71true, 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-12-09 15:18:40,437 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-12-09 15:18:40,437 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:40,437 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:40,437 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:41,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2751], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 692#true, 36#L81true, thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-12-09 15:18:41,650 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-12-09 15:18:41,650 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-12-09 15:18:41,650 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-12-09 15:18:41,650 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-12-09 15:18:43,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][3022], [130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 1789#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0)))), 114#true, 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 692#true, 190#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1806#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 36#L81true, thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 169#true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 1261#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), 45#L54true]) [2023-12-09 15:18:43,099 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-12-09 15:18:43,099 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-12-09 15:18:43,099 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-12-09 15:18:43,099 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-12-09 15:18:43,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2751], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 64#L76true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-12-09 15:18:43,564 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:18:43,564 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:18:43,564 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:18:43,564 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:18:43,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2748], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 64#L76true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-12-09 15:18:43,764 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:18:43,764 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:18:43,764 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:18:43,764 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:18:43,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2749], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 15#L71true, 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-12-09 15:18:43,764 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:18:43,764 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:18:43,765 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:18:43,765 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:18:44,079 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][426], [139#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 1793#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), 114#true, 1789#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0)))), 2321#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1262#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 2860#(and (<= 0 ~pos~0) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 692#true, 190#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 151#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 36#L81true, 43#$Ultimate##0true, thread1Thread1of1ForFork1InUse, 153#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 689#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 175#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-12-09 15:18:44,080 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:18:44,080 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:44,080 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:44,080 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:44,501 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2751], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 692#true, thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 64#L76true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-12-09 15:18:44,501 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:18:44,501 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:18:44,501 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:18:44,501 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:18:44,501 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:18:44,591 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1525], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 36#L81true, 2870#(and (= ~v_assert~0 1) (<= 0 ~pos~0) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), thread1Thread1of1ForFork1InUse, 153#true, thread2Thread1of1ForFork2InUse, 1791#true, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-12-09 15:18:44,591 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2023-12-09 15:18:44,591 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-12-09 15:18:44,591 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-12-09 15:18:44,592 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-12-09 15:18:44,592 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-12-09 15:18:44,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([259] L52-->L54: Formula: (= (+ v_~pos~0_25 1) v_~pos~0_26) InVars {~pos~0=v_~pos~0_26} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][2654], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 36#L81true, thread1Thread1of1ForFork1InUse, 153#true, 2882#(and (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 194#true, 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-12-09 15:18:44,592 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2023-12-09 15:18:44,592 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-12-09 15:18:44,592 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-12-09 15:18:44,592 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-12-09 15:18:45,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2202], [130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 1793#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), 114#true, 1789#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0)))), 2321#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 692#true, 2874#(and (= ~v_assert~0 1) (<= 0 ~pos~0) (= thread1Thread1of1ForFork1_~lv_assert~0 1)), 190#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 36#L81true, thread1Thread1of1ForFork1InUse, 153#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 689#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 175#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true, 1261#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0)]) [2023-12-09 15:18:45,325 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2023-12-09 15:18:45,325 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-12-09 15:18:45,325 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-12-09 15:18:45,325 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-12-09 15:18:46,221 INFO L124 PetriNetUnfolderBase]: 13069/28136 cut-off events. [2023-12-09 15:18:46,221 INFO L125 PetriNetUnfolderBase]: For 719693/726018 co-relation queries the response was YES. [2023-12-09 15:18:46,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261758 conditions, 28136 events. 13069/28136 cut-off events. For 719693/726018 co-relation queries the response was YES. Maximal size of possible extension queue 1566. Compared 300588 event pairs, 349 based on Foata normal form. 161/25943 useless extension candidates. Maximal degree in co-relation 260302. Up to 12630 conditions per place. [2023-12-09 15:18:46,529 INFO L140 encePairwiseOnDemand]: 92/108 looper letters, 1358 selfloop transitions, 698 changer transitions 3324/5725 dead transitions. [2023-12-09 15:18:46,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 5725 transitions, 159799 flow [2023-12-09 15:18:46,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-09 15:18:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-12-09 15:18:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2055 transitions. [2023-12-09 15:18:46,532 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7611111111111111 [2023-12-09 15:18:46,532 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2055 transitions. [2023-12-09 15:18:46,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2055 transitions. [2023-12-09 15:18:46,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:18:46,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2055 transitions. [2023-12-09 15:18:46,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 82.2) internal successors, (2055), 25 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have 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:18:46,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 108.0) internal successors, (2808), 26 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have 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:18:46,539 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 108.0) internal successors, (2808), 26 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have 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:18:46,539 INFO L308 CegarLoopForPetriNet]: 97 programPoint places, 127 predicate places. [2023-12-09 15:18:46,540 INFO L500 AbstractCegarLoop]: Abstraction has has 224 places, 5725 transitions, 159799 flow [2023-12-09 15:18:46,540 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 78.92857142857143) internal successors, (1105), 14 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have 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:18:46,540 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:18:46,540 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:46,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-09 15:18:46,744 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-09 15:18:46,745 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:18:46,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:18:46,745 INFO L85 PathProgramCache]: Analyzing trace with hash -233875890, now seen corresponding path program 6 times [2023-12-09 15:18:46,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:18:46,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502879854] [2023-12-09 15:18:46,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:46,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:18:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:18:46,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:18:46,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502879854] [2023-12-09 15:18:46,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502879854] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:18:46,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:18:46,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 15:18:46,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611290525] [2023-12-09 15:18:46,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:18:46,816 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:18:46,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:18:46,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:18:46,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-09 15:18:46,817 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 108 [2023-12-09 15:18:46,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 5725 transitions, 159799 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have 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:18:46,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:18:46,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 108 [2023-12-09 15:18:46,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:18:51,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][720], [1259#true, 130#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 1791#true, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 27#L92true, 4#L111-4true, 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 64#L76true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 2886#true]) [2023-12-09 15:18:51,715 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-12-09 15:18:51,715 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:51,715 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:51,715 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:51,715 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][722], [1259#true, 130#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 1791#true, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 27#L92true, 4#L111-4true, 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 15#L71true, 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 2886#true]) [2023-12-09 15:18:51,715 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-12-09 15:18:51,715 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:51,715 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:51,715 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:18:53,533 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1493], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 2870#(and (= ~v_assert~0 1) (<= 0 ~pos~0) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 36#L81true, thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 2886#true]) [2023-12-09 15:18:53,533 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2023-12-09 15:18:53,533 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-12-09 15:18:53,534 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-12-09 15:18:53,534 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-12-09 15:18:56,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2151], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2870#(and (= ~v_assert~0 1) (<= 0 ~pos~0) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 153#true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 15#L71true, 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 2886#true]) [2023-12-09 15:18:56,385 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-12-09 15:18:56,385 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:56,385 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:56,385 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:56,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1493], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 2870#(and (= ~v_assert~0 1) (<= 0 ~pos~0) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), thread1Thread1of1ForFork1InUse, 153#true, thread2Thread1of1ForFork2InUse, 1791#true, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 64#L76true, 45#L54true, 2886#true]) [2023-12-09 15:18:56,385 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-12-09 15:18:56,385 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:56,385 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:56,385 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:18:58,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2622], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 692#true, 36#L81true, 153#true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 2886#true]) [2023-12-09 15:18:58,428 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-12-09 15:18:58,428 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-12-09 15:18:58,428 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-12-09 15:18:58,428 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-12-09 15:19:02,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2618], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true, 2886#true]) [2023-12-09 15:19:02,270 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:19:02,270 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:19:02,270 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:19:02,270 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:19:02,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2620], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 153#true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 64#L76true, 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true, 2886#true]) [2023-12-09 15:19:02,271 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:19:02,271 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:19:02,271 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:19:02,271 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:19:02,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][3368], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 153#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 1791#true, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 2886#true]) [2023-12-09 15:19:02,291 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:19:02,291 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:19:02,291 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:19:02,291 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:19:02,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2622], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 692#true, 153#true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 64#L76true, 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true, 2886#true]) [2023-12-09 15:19:02,292 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:19:02,292 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:19:02,292 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:19:02,292 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:19:04,022 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([259] L52-->L54: Formula: (= (+ v_~pos~0_25 1) v_~pos~0_26) InVars {~pos~0=v_~pos~0_26} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][3735], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 692#true, 2888#(= (* 256 (div ~d1~0 256)) ~d1~0), 36#L81true, 153#true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 194#true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-12-09 15:19:04,023 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2023-12-09 15:19:04,023 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-12-09 15:19:04,023 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-12-09 15:19:04,023 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-12-09 15:19:07,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([259] L52-->L54: Formula: (= (+ v_~pos~0_25 1) v_~pos~0_26) InVars {~pos~0=v_~pos~0_26} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][3735], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 2888#(= (* 256 (div ~d1~0 256)) ~d1~0), thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 194#true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 64#L76true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-12-09 15:19:07,456 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-12-09 15:19:07,456 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:19:07,456 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:19:07,456 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:19:07,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([259] L52-->L54: Formula: (= (+ v_~pos~0_25 1) v_~pos~0_26) InVars {~pos~0=v_~pos~0_26} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][4332], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 2888#(= (* 256 (div ~d1~0 256)) ~d1~0), 153#true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 194#true, 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-12-09 15:19:07,457 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-12-09 15:19:07,457 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:19:07,457 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:19:07,457 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:19:13,295 INFO L124 PetriNetUnfolderBase]: 14757/32992 cut-off events. [2023-12-09 15:19:13,295 INFO L125 PetriNetUnfolderBase]: For 857179/869224 co-relation queries the response was YES. [2023-12-09 15:19:13,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311273 conditions, 32992 events. 14757/32992 cut-off events. For 857179/869224 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 365204 event pairs, 446 based on Foata normal form. 635/31725 useless extension candidates. Maximal degree in co-relation 304088. Up to 15294 conditions per place. [2023-12-09 15:19:13,644 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 1421 selfloop transitions, 5 changer transitions 2576/5507 dead transitions. [2023-12-09 15:19:13,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 5507 transitions, 160468 flow [2023-12-09 15:19:13,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-09 15:19:13,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-09 15:19:13,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 391 transitions. [2023-12-09 15:19:13,645 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9050925925925926 [2023-12-09 15:19:13,645 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 391 transitions. [2023-12-09 15:19:13,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 391 transitions. [2023-12-09 15:19:13,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:13,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 391 transitions. [2023-12-09 15:19:13,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have 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:19:13,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have 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:19:13,647 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have 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:19:13,647 INFO L308 CegarLoopForPetriNet]: 97 programPoint places, 129 predicate places. [2023-12-09 15:19:13,647 INFO L500 AbstractCegarLoop]: Abstraction has has 226 places, 5507 transitions, 160468 flow [2023-12-09 15:19:13,648 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have 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:19:13,648 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:13,648 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:13,648 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-09 15:19:13,648 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:19:13,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:13,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1774881479, now seen corresponding path program 2 times [2023-12-09 15:19:13,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:13,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212218747] [2023-12-09 15:19:13,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:13,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:19:13,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:13,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212218747] [2023-12-09 15:19:13,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212218747] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:19:13,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:19:13,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 15:19:13,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220352072] [2023-12-09 15:19:13,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:19:13,725 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:19:13,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:13,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:19:13,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-09 15:19:13,725 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 108 [2023-12-09 15:19:13,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 5507 transitions, 160468 flow. Second operand has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have 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:19:13,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:13,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 108 [2023-12-09 15:19:13,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:19:17,382 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1188], [130#true, 1259#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 1791#true, 2893#(= (* (div ~d2~0 256) 256) ~d2~0), thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 64#L76true, 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 2886#true]) [2023-12-09 15:19:17,382 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-12-09 15:19:17,382 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:19:17,382 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:19:17,382 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:19:17,382 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][752], [130#true, 1259#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 1791#true, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 27#L92true, 4#L111-4true, 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 2891#true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 2886#true]) [2023-12-09 15:19:17,382 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-12-09 15:19:17,382 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:19:17,382 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:19:17,382 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 15:19:20,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2169], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2894#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), 2870#(and (= ~v_assert~0 1) (<= 0 ~pos~0) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), thread1Thread1of1ForFork1InUse, 153#true, thread2Thread1of1ForFork2InUse, 1791#true, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 15#L71true, 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 2886#true]) [2023-12-09 15:19:20,929 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-12-09 15:19:20,929 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:19:20,929 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:19:20,929 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-12-09 15:19:25,575 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2604], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 153#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 1791#true, 2893#(= (* (div ~d2~0 256) 256) ~d2~0), thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 64#L76true, 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 2886#true]) [2023-12-09 15:19:25,575 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:19:25,575 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:19:25,576 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:19:25,576 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-12-09 15:19:39,092 INFO L124 PetriNetUnfolderBase]: 13871/31891 cut-off events. [2023-12-09 15:19:39,092 INFO L125 PetriNetUnfolderBase]: For 879692/890353 co-relation queries the response was YES. [2023-12-09 15:19:39,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318951 conditions, 31891 events. 13871/31891 cut-off events. For 879692/890353 co-relation queries the response was YES. Maximal size of possible extension queue 1277. Compared 353514 event pairs, 259 based on Foata normal form. 322/31186 useless extension candidates. Maximal degree in co-relation 311665. Up to 15130 conditions per place. [2023-12-09 15:19:39,391 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 1344 selfloop transitions, 5 changer transitions 3676/5882 dead transitions. [2023-12-09 15:19:39,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 5882 transitions, 180346 flow [2023-12-09 15:19:39,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-09 15:19:39,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-09 15:19:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 390 transitions. [2023-12-09 15:19:39,392 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2023-12-09 15:19:39,392 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 390 transitions. [2023-12-09 15:19:39,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 390 transitions. [2023-12-09 15:19:39,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:19:39,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 390 transitions. [2023-12-09 15:19:39,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have 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:19:39,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have 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:19:39,394 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have 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:19:39,394 INFO L308 CegarLoopForPetriNet]: 97 programPoint places, 132 predicate places. [2023-12-09 15:19:39,395 INFO L500 AbstractCegarLoop]: Abstraction has has 229 places, 5882 transitions, 180346 flow [2023-12-09 15:19:39,395 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have 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:19:39,395 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:19:39,395 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:39,395 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-09 15:19:39,395 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:19:39,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:19:39,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1162604154, now seen corresponding path program 1 times [2023-12-09 15:19:39,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:19:39,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836911435] [2023-12-09 15:19:39,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:39,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:19:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:19:39,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:19:39,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836911435] [2023-12-09 15:19:39,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836911435] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:19:39,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662797304] [2023-12-09 15:19:39,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:19:39,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:19:39,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:19:39,628 INFO L229 MonitoredProcess]: Starting monitored process 7 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:19:39,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-09 15:19:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:19:39,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-09 15:19:39,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:19:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:19:39,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:19:39,946 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:19:39,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662797304] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:19:39,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:19:39,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 18 [2023-12-09 15:19:39,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129108979] [2023-12-09 15:19:39,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:19:39,946 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-09 15:19:39,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:19:39,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-09 15:19:39,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-12-09 15:19:39,948 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 108 [2023-12-09 15:19:39,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 5882 transitions, 180346 flow. Second operand has 18 states, 18 states have (on average 69.83333333333333) internal successors, (1257), 18 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have 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:19:39,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:19:39,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 108 [2023-12-09 15:19:39,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:20:50,528 INFO L124 PetriNetUnfolderBase]: 32431/65663 cut-off events. [2023-12-09 15:20:50,528 INFO L125 PetriNetUnfolderBase]: For 1612764/1622651 co-relation queries the response was YES. [2023-12-09 15:20:50,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634175 conditions, 65663 events. 32431/65663 cut-off events. For 1612764/1622651 co-relation queries the response was YES. Maximal size of possible extension queue 1979. Compared 697542 event pairs, 2212 based on Foata normal form. 381/64294 useless extension candidates. Maximal degree in co-relation 619263. Up to 28229 conditions per place. [2023-12-09 15:20:51,347 INFO L140 encePairwiseOnDemand]: 92/108 looper letters, 2000 selfloop transitions, 396 changer transitions 7318/9851 dead transitions. [2023-12-09 15:20:51,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 9851 transitions, 317803 flow [2023-12-09 15:20:51,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-09 15:20:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-12-09 15:20:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2347 transitions. [2023-12-09 15:20:51,350 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.701015531660693 [2023-12-09 15:20:51,350 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2347 transitions. [2023-12-09 15:20:51,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2347 transitions. [2023-12-09 15:20:51,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:20:51,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2347 transitions. [2023-12-09 15:20:51,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 75.70967741935483) internal successors, (2347), 31 states have internal predecessors, (2347), 0 states have call successors, (0), 0 states have 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:20:51,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 108.0) internal successors, (3456), 32 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have 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:20:51,356 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 108.0) internal successors, (3456), 32 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have 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:20:51,357 INFO L308 CegarLoopForPetriNet]: 97 programPoint places, 161 predicate places. [2023-12-09 15:20:51,357 INFO L500 AbstractCegarLoop]: Abstraction has has 258 places, 9851 transitions, 317803 flow [2023-12-09 15:20:51,357 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 69.83333333333333) internal successors, (1257), 18 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have 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:20:51,357 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:20:51,357 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:51,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-09 15:20:51,562 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-09 15:20:51,562 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:20:51,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:20:51,562 INFO L85 PathProgramCache]: Analyzing trace with hash -143284028, now seen corresponding path program 2 times [2023-12-09 15:20:51,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:20:51,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436116864] [2023-12-09 15:20:51,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:20:51,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:20:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:20:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:20:51,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:20:51,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436116864] [2023-12-09 15:20:51,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436116864] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:20:51,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657762933] [2023-12-09 15:20:51,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:20:51,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:20:51,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:20:51,934 INFO L229 MonitoredProcess]: Starting monitored process 8 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:20:51,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-09 15:20:52,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:20:52,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:20:52,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-09 15:20:52,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:20:52,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:20:52,179 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:20:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:20:52,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657762933] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:20:52,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:20:52,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 18 [2023-12-09 15:20:52,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734328277] [2023-12-09 15:20:52,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:20:52,339 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-09 15:20:52,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:20:52,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-09 15:20:52,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-12-09 15:20:52,341 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 108 [2023-12-09 15:20:52,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 9851 transitions, 317803 flow. Second operand has 18 states, 18 states have (on average 70.0) internal successors, (1260), 18 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have 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:20:52,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:20:52,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 108 [2023-12-09 15:20:52,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-12-09 15:22:22,195 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:22:22,195 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:22:22,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-09 15:22:22,455 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-12-09 15:22:22,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-09 15:22:22,657 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:22:22,657 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (18states, 66/108 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 500636 conditions, 47241 events (24715/47240 cut-off events. For 1324143/1328118 co-relation queries the response was YES. Maximal size of possible extension queue 3486. Compared 525059 event pairs, 966 based on Foata normal form. 115/48947 useless extension candidates. Maximal degree in co-relation 500416. Up to 19330 conditions per place.). [2023-12-09 15:22:22,659 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-12-09 15:22:22,659 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-12-09 15:22:22,659 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-12-09 15:22:22,660 INFO L457 BasicCegarLoop]: Path program histogram: [6, 4, 3, 2, 2, 2] [2023-12-09 15:22:22,662 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:22:22,662 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:22:22,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:22:22 BasicIcfg [2023-12-09 15:22:22,665 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:22:22,665 INFO L158 Benchmark]: Toolchain (without parser) took 255955.47ms. Allocated memory was 314.6MB in the beginning and 4.0GB in the end (delta: 3.7GB). Free memory was 260.6MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2023-12-09 15:22:22,665 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 201.3MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:22:22,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.33ms. Allocated memory is still 314.6MB. Free memory was 260.1MB in the beginning and 248.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-09 15:22:22,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.52ms. Allocated memory is still 314.6MB. Free memory was 248.5MB in the beginning and 247.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:22:22,666 INFO L158 Benchmark]: Boogie Preprocessor took 26.86ms. Allocated memory is still 314.6MB. Free memory was 247.0MB in the beginning and 245.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-09 15:22:22,666 INFO L158 Benchmark]: RCFGBuilder took 282.13ms. Allocated memory is still 314.6MB. Free memory was 245.4MB in the beginning and 229.7MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-09 15:22:22,666 INFO L158 Benchmark]: TraceAbstraction took 255426.09ms. Allocated memory was 314.6MB in the beginning and 4.0GB in the end (delta: 3.7GB). Free memory was 229.1MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2023-12-09 15:22:22,667 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 201.3MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.33ms. Allocated memory is still 314.6MB. Free memory was 260.1MB in the beginning and 248.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.52ms. Allocated memory is still 314.6MB. Free memory was 248.5MB in the beginning and 247.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.86ms. Allocated memory is still 314.6MB. Free memory was 247.0MB in the beginning and 245.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 282.13ms. Allocated memory is still 314.6MB. Free memory was 245.4MB in the beginning and 229.7MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 255426.09ms. Allocated memory was 314.6MB in the beginning and 4.0GB in the end (delta: 3.7GB). Free memory was 229.1MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (18states, 66/108 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 500636 conditions, 47241 events (24715/47240 cut-off events. For 1324143/1328118 co-relation queries the response was YES. Maximal size of possible extension queue 3486. Compared 525059 event pairs, 966 based on Foata normal form. 115/48947 useless extension candidates. Maximal degree in co-relation 500416. Up to 19330 conditions per place.). - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (18states, 66/108 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 500636 conditions, 47241 events (24715/47240 cut-off events. For 1324143/1328118 co-relation queries the response was YES. Maximal size of possible extension queue 3486. Compared 525059 event pairs, 966 based on Foata normal form. 115/48947 useless extension candidates. Maximal degree in co-relation 500416. Up to 19330 conditions per place.). - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (18states, 66/108 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 500636 conditions, 47241 events (24715/47240 cut-off events. For 1324143/1328118 co-relation queries the response was YES. Maximal size of possible extension queue 3486. Compared 525059 event pairs, 966 based on Foata normal form. 115/48947 useless extension candidates. Maximal degree in co-relation 500416. Up to 19330 conditions per place.). - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (18states, 66/108 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 500636 conditions, 47241 events (24715/47240 cut-off events. For 1324143/1328118 co-relation queries the response was YES. Maximal size of possible extension queue 3486. Compared 525059 event pairs, 966 based on Foata normal form. 115/48947 useless extension candidates. Maximal degree in co-relation 500416. Up to 19330 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 255.3s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 248.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1463 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1463 mSDsluCounter, 1363 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1034 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4070 IncrementalHoareTripleChecker+Invalid, 4221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 329 mSDtfsCounter, 4070 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1467 GetRequests, 1216 SyntacticMatches, 24 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1258 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=317803occurred in iteration=18, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 2216 NumberOfCodeBlocks, 2216 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2800 ConstructedInterpolants, 0 QuantifiedInterpolants, 7675 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1643 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 33 InterpolantComputations, 13 PerfectInterpolantSequences, 133/195 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown