/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/popl20-queue-add-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:32:32,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:32:32,912 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:32:32,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:32:32,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:32:32,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:32:32,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:32:32,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:32:32,941 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:32:32,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:32:32,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:32:32,944 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:32:32,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:32:32,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:32:32,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:32:32,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:32:32,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:32:32,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:32:32,946 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:32:32,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:32:32,946 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:32:32,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:32:32,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:32:32,947 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:32:32,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:32:32,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:32:32,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:32:32,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:32:32,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:32:32,948 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:32:32,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:32:32,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:32:32,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:32:32,950 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:32:33,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:32:33,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:32:33,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:32:33,160 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:32:33,161 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:32:33,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c [2023-12-09 15:32:34,234 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:32:34,449 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:32:34,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c [2023-12-09 15:32:34,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b309c9d/78aa125ffbce48078ab39d717b77eb3b/FLAGe8630b3f1 [2023-12-09 15:32:34,478 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b309c9d/78aa125ffbce48078ab39d717b77eb3b [2023-12-09 15:32:34,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:32:34,481 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:32:34,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:32:34,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:32:34,485 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:32:34,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:32:34" (1/1) ... [2023-12-09 15:32:34,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cdb0d58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:32:34, skipping insertion in model container [2023-12-09 15:32:34,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:32:34" (1/1) ... [2023-12-09 15:32:34,517 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:32:34,671 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/popl20-queue-add-3.wvr.c[3451,3464] [2023-12-09 15:32:34,677 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:32:34,689 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:32:34,711 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/popl20-queue-add-3.wvr.c[3451,3464] [2023-12-09 15:32:34,714 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:32:34,719 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:32:34,720 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:32:34,728 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:32:34,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:32:34 WrapperNode [2023-12-09 15:32:34,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:32:34,730 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:32:34,730 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:32:34,730 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:32:34,734 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:32:34" (1/1) ... [2023-12-09 15:32:34,744 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:32:34" (1/1) ... [2023-12-09 15:32:34,768 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 257 [2023-12-09 15:32:34,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:32:34,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:32:34,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:32:34,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:32:34,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:32:34" (1/1) ... [2023-12-09 15:32:34,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:32:34" (1/1) ... [2023-12-09 15:32:34,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:32:34" (1/1) ... [2023-12-09 15:32:34,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:32:34" (1/1) ... [2023-12-09 15:32:34,795 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:32:34" (1/1) ... [2023-12-09 15:32:34,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:32:34" (1/1) ... [2023-12-09 15:32:34,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:32:34" (1/1) ... [2023-12-09 15:32:34,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:32:34" (1/1) ... [2023-12-09 15:32:34,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:32:34,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:32:34,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:32:34,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:32:34,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:32:34" (1/1) ... [2023-12-09 15:32:34,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:32:34,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:32:34,874 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:32:34,896 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:32:34,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:32:34,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:32:34,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:32:34,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:32:34,904 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:32:34,904 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:32:34,904 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:32:34,904 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:32:34,904 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:32:34,904 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:32:34,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:32:34,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:32:34,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:32:34,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:32:34,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:32:34,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:32:34,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:32:34,908 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:32:34,991 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:32:34,993 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:32:35,287 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:32:35,405 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:32:35,405 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-09 15:32:35,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:32:35 BoogieIcfgContainer [2023-12-09 15:32:35,407 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:32:35,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:32:35,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:32:35,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:32:35,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:32:34" (1/3) ... [2023-12-09 15:32:35,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d872a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:32:35, skipping insertion in model container [2023-12-09 15:32:35,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:32:34" (2/3) ... [2023-12-09 15:32:35,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d872a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:32:35, skipping insertion in model container [2023-12-09 15:32:35,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:32:35" (3/3) ... [2023-12-09 15:32:35,414 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2023-12-09 15:32:35,426 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:32:35,426 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:32:35,426 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:32:35,485 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:32:35,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 212 places, 220 transitions, 461 flow [2023-12-09 15:32:35,581 INFO L124 PetriNetUnfolderBase]: 18/217 cut-off events. [2023-12-09 15:32:35,581 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:32:35,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 217 events. 18/217 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 121 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 178. Up to 3 conditions per place. [2023-12-09 15:32:35,587 INFO L82 GeneralOperation]: Start removeDead. Operand has 212 places, 220 transitions, 461 flow [2023-12-09 15:32:35,600 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 206 transitions, 430 flow [2023-12-09 15:32:35,606 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:32:35,615 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;@282874d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:32:35,616 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 15:32:35,653 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:32:35,653 INFO L124 PetriNetUnfolderBase]: 18/205 cut-off events. [2023-12-09 15:32:35,653 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:32:35,653 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:32:35,654 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:32:35,654 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:32:35,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:32:35,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1195038984, now seen corresponding path program 1 times [2023-12-09 15:32:35,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:32:35,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754839927] [2023-12-09 15:32:35,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:32:35,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:32:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:32:35,944 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:32:35,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:32:35,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754839927] [2023-12-09 15:32:35,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754839927] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:32:35,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:32:35,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 15:32:35,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385210473] [2023-12-09 15:32:35,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:32:35,954 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-09 15:32:35,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:32:35,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-09 15:32:35,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-09 15:32:35,981 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 220 [2023-12-09 15:32:35,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 206 transitions, 430 flow. Second operand has 2 states, 2 states have (on average 199.5) internal successors, (399), 2 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have 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:32:35,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:32:35,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 220 [2023-12-09 15:32:35,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:32:36,082 INFO L124 PetriNetUnfolderBase]: 71/383 cut-off events. [2023-12-09 15:32:36,083 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-12-09 15:32:36,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 383 events. 71/383 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1066 event pairs, 38 based on Foata normal form. 60/409 useless extension candidates. Maximal degree in co-relation 339. Up to 106 conditions per place. [2023-12-09 15:32:36,089 INFO L140 encePairwiseOnDemand]: 207/220 looper letters, 11 selfloop transitions, 0 changer transitions 6/193 dead transitions. [2023-12-09 15:32:36,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 193 transitions, 426 flow [2023-12-09 15:32:36,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-09 15:32:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-12-09 15:32:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 414 transitions. [2023-12-09 15:32:36,103 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9409090909090909 [2023-12-09 15:32:36,104 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 414 transitions. [2023-12-09 15:32:36,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 414 transitions. [2023-12-09 15:32:36,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:32:36,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 414 transitions. [2023-12-09 15:32:36,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 207.0) internal successors, (414), 2 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have 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:32:36,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have 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:32:36,119 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have 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:32:36,122 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, 1 predicate places. [2023-12-09 15:32:36,122 INFO L500 AbstractCegarLoop]: Abstraction has has 199 places, 193 transitions, 426 flow [2023-12-09 15:32:36,123 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 199.5) internal successors, (399), 2 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have 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:32:36,123 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:32:36,125 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:32:36,125 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:32:36,125 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:32:36,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:32:36,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2001458518, now seen corresponding path program 1 times [2023-12-09 15:32:36,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:32:36,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356033712] [2023-12-09 15:32:36,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:32:36,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:32:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:32:36,370 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:32:36,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:32:36,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356033712] [2023-12-09 15:32:36,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356033712] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:32:36,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:32:36,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:32:36,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103718675] [2023-12-09 15:32:36,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:32:36,372 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:32:36,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:32:36,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:32:36,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:32:36,374 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 220 [2023-12-09 15:32:36,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 193 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have 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:32:36,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:32:36,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 220 [2023-12-09 15:32:36,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:32:36,452 INFO L124 PetriNetUnfolderBase]: 82/413 cut-off events. [2023-12-09 15:32:36,452 INFO L125 PetriNetUnfolderBase]: For 97/121 co-relation queries the response was YES. [2023-12-09 15:32:36,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 413 events. 82/413 cut-off events. For 97/121 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1179 event pairs, 17 based on Foata normal form. 8/387 useless extension candidates. Maximal degree in co-relation 495. Up to 122 conditions per place. [2023-12-09 15:32:36,456 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 19 selfloop transitions, 2 changer transitions 6/199 dead transitions. [2023-12-09 15:32:36,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 199 transitions, 498 flow [2023-12-09 15:32:36,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:32:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:32:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 595 transitions. [2023-12-09 15:32:36,458 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9015151515151515 [2023-12-09 15:32:36,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 595 transitions. [2023-12-09 15:32:36,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 595 transitions. [2023-12-09 15:32:36,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:32:36,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 595 transitions. [2023-12-09 15:32:36,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:32:36,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have 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:32:36,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have 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:32:36,464 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, 3 predicate places. [2023-12-09 15:32:36,464 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 199 transitions, 498 flow [2023-12-09 15:32:36,464 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have 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:32:36,464 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:32:36,465 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:32:36,465 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:32:36,465 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:32:36,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:32:36,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2147010252, now seen corresponding path program 2 times [2023-12-09 15:32:36,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:32:36,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363074928] [2023-12-09 15:32:36,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:32:36,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:32:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:32:36,768 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:32:36,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:32:36,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363074928] [2023-12-09 15:32:36,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363074928] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:32:36,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:32:36,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:32:36,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742050405] [2023-12-09 15:32:36,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:32:36,770 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:32:36,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:32:36,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:32:36,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:32:36,772 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 220 [2023-12-09 15:32:36,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 199 transitions, 498 flow. Second operand has 6 states, 6 states have (on average 168.66666666666666) internal successors, (1012), 6 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have 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:32:36,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:32:36,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 220 [2023-12-09 15:32:36,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:32:36,944 INFO L124 PetriNetUnfolderBase]: 83/503 cut-off events. [2023-12-09 15:32:36,944 INFO L125 PetriNetUnfolderBase]: For 222/274 co-relation queries the response was YES. [2023-12-09 15:32:36,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 503 events. 83/503 cut-off events. For 222/274 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1459 event pairs, 17 based on Foata normal form. 8/470 useless extension candidates. Maximal degree in co-relation 605. Up to 139 conditions per place. [2023-12-09 15:32:36,947 INFO L140 encePairwiseOnDemand]: 207/220 looper letters, 45 selfloop transitions, 8 changer transitions 28/225 dead transitions. [2023-12-09 15:32:36,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 225 transitions, 721 flow [2023-12-09 15:32:36,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:32:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:32:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1539 transitions. [2023-12-09 15:32:36,950 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7772727272727272 [2023-12-09 15:32:36,950 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1539 transitions. [2023-12-09 15:32:36,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1539 transitions. [2023-12-09 15:32:36,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:32:36,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1539 transitions. [2023-12-09 15:32:36,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 171.0) internal successors, (1539), 9 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have 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:32:36,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 220.0) internal successors, (2200), 10 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have 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:32:36,957 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 220.0) internal successors, (2200), 10 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have 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:32:36,957 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, 11 predicate places. [2023-12-09 15:32:36,957 INFO L500 AbstractCegarLoop]: Abstraction has has 209 places, 225 transitions, 721 flow [2023-12-09 15:32:36,958 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 168.66666666666666) internal successors, (1012), 6 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have 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:32:36,958 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:32:36,958 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:32:36,958 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:32:36,958 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:32:36,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:32:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash 155455642, now seen corresponding path program 1 times [2023-12-09 15:32:36,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:32:36,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544810863] [2023-12-09 15:32:36,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:32:36,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:32:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:32:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:32:37,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:32:37,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544810863] [2023-12-09 15:32:37,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544810863] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:32:37,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:32:37,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:32:37,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349507962] [2023-12-09 15:32:37,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:32:37,114 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:32:37,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:32:37,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:32:37,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:32:37,117 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 220 [2023-12-09 15:32:37,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 225 transitions, 721 flow. Second operand has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have 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:32:37,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:32:37,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 220 [2023-12-09 15:32:37,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:32:37,312 INFO L124 PetriNetUnfolderBase]: 104/672 cut-off events. [2023-12-09 15:32:37,313 INFO L125 PetriNetUnfolderBase]: For 591/733 co-relation queries the response was YES. [2023-12-09 15:32:37,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1557 conditions, 672 events. 104/672 cut-off events. For 591/733 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2479 event pairs, 29 based on Foata normal form. 7/623 useless extension candidates. Maximal degree in co-relation 820. Up to 184 conditions per place. [2023-12-09 15:32:37,317 INFO L140 encePairwiseOnDemand]: 209/220 looper letters, 49 selfloop transitions, 8 changer transitions 50/251 dead transitions. [2023-12-09 15:32:37,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 251 transitions, 1088 flow [2023-12-09 15:32:37,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:32:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:32:37,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1526 transitions. [2023-12-09 15:32:37,320 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7707070707070707 [2023-12-09 15:32:37,320 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1526 transitions. [2023-12-09 15:32:37,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1526 transitions. [2023-12-09 15:32:37,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:32:37,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1526 transitions. [2023-12-09 15:32:37,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 169.55555555555554) internal successors, (1526), 9 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have 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:32:37,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 220.0) internal successors, (2200), 10 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have 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:32:37,327 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 220.0) internal successors, (2200), 10 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have 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:32:37,329 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, 19 predicate places. [2023-12-09 15:32:37,329 INFO L500 AbstractCegarLoop]: Abstraction has has 217 places, 251 transitions, 1088 flow [2023-12-09 15:32:37,329 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have 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:32:37,330 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:32:37,330 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:32:37,330 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:32:37,330 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:32:37,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:32:37,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1413856077, now seen corresponding path program 1 times [2023-12-09 15:32:37,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:32:37,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521361653] [2023-12-09 15:32:37,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:32:37,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:32:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:32:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:32:37,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:32:37,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521361653] [2023-12-09 15:32:37,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521361653] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:32:37,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:32:37,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-09 15:32:37,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796288097] [2023-12-09 15:32:37,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:32:37,789 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-09 15:32:37,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:32:37,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-09 15:32:37,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-12-09 15:32:37,791 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 220 [2023-12-09 15:32:37,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 251 transitions, 1088 flow. Second operand has 12 states, 12 states have (on average 144.58333333333334) internal successors, (1735), 12 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have 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:32:37,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:32:37,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 220 [2023-12-09 15:32:37,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:32:38,324 INFO L124 PetriNetUnfolderBase]: 821/2264 cut-off events. [2023-12-09 15:32:38,325 INFO L125 PetriNetUnfolderBase]: For 5627/6363 co-relation queries the response was YES. [2023-12-09 15:32:38,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7223 conditions, 2264 events. 821/2264 cut-off events. For 5627/6363 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 14959 event pairs, 244 based on Foata normal form. 0/2046 useless extension candidates. Maximal degree in co-relation 4402. Up to 764 conditions per place. [2023-12-09 15:32:38,341 INFO L140 encePairwiseOnDemand]: 198/220 looper letters, 115 selfloop transitions, 15 changer transitions 86/351 dead transitions. [2023-12-09 15:32:38,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 351 transitions, 2368 flow [2023-12-09 15:32:38,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-09 15:32:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-12-09 15:32:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2371 transitions. [2023-12-09 15:32:38,346 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6735795454545455 [2023-12-09 15:32:38,346 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2371 transitions. [2023-12-09 15:32:38,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2371 transitions. [2023-12-09 15:32:38,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:32:38,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2371 transitions. [2023-12-09 15:32:38,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 148.1875) internal successors, (2371), 16 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have 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:32:38,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 220.0) internal successors, (3740), 17 states have internal predecessors, (3740), 0 states have call successors, (0), 0 states have 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:32:38,356 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 220.0) internal successors, (3740), 17 states have internal predecessors, (3740), 0 states have call successors, (0), 0 states have 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:32:38,358 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, 34 predicate places. [2023-12-09 15:32:38,359 INFO L500 AbstractCegarLoop]: Abstraction has has 232 places, 351 transitions, 2368 flow [2023-12-09 15:32:38,359 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 144.58333333333334) internal successors, (1735), 12 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have 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:32:38,359 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:32:38,359 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:32:38,360 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:32:38,360 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:32:38,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:32:38,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1965681415, now seen corresponding path program 2 times [2023-12-09 15:32:38,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:32:38,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110208603] [2023-12-09 15:32:38,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:32:38,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:32:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:32:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:32:38,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:32:38,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110208603] [2023-12-09 15:32:38,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110208603] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:32:38,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:32:38,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:32:38,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577651613] [2023-12-09 15:32:38,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:32:38,456 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:32:38,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:32:38,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:32:38,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:32:38,457 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 220 [2023-12-09 15:32:38,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 351 transitions, 2368 flow. Second operand has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have 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:32:38,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:32:38,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 220 [2023-12-09 15:32:38,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:32:38,683 INFO L124 PetriNetUnfolderBase]: 598/1732 cut-off events. [2023-12-09 15:32:38,684 INFO L125 PetriNetUnfolderBase]: For 7415/7862 co-relation queries the response was YES. [2023-12-09 15:32:38,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6170 conditions, 1732 events. 598/1732 cut-off events. For 7415/7862 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 10442 event pairs, 100 based on Foata normal form. 36/1630 useless extension candidates. Maximal degree in co-relation 3823. Up to 579 conditions per place. [2023-12-09 15:32:38,695 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 59 selfloop transitions, 3 changer transitions 89/348 dead transitions. [2023-12-09 15:32:38,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 348 transitions, 2615 flow [2023-12-09 15:32:38,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:32:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:32:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 593 transitions. [2023-12-09 15:32:38,697 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8984848484848484 [2023-12-09 15:32:38,697 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 593 transitions. [2023-12-09 15:32:38,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 593 transitions. [2023-12-09 15:32:38,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:32:38,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 593 transitions. [2023-12-09 15:32:38,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have 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:32:38,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have 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:32:38,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have 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:32:38,701 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, 36 predicate places. [2023-12-09 15:32:38,701 INFO L500 AbstractCegarLoop]: Abstraction has has 234 places, 348 transitions, 2615 flow [2023-12-09 15:32:38,701 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have 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:32:38,701 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:32:38,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:38,702 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:32:38,702 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:32:38,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:32:38,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1221134367, now seen corresponding path program 1 times [2023-12-09 15:32:38,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:32:38,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339889440] [2023-12-09 15:32:38,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:32:38,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:32:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:32:38,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:32:38,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:32:38,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339889440] [2023-12-09 15:32:38,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339889440] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:32:38,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804150686] [2023-12-09 15:32:38,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:32:38,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:32:38,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:32:38,905 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:32:38,940 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:32:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:32:39,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:32:39,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:32:39,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:32:39,218 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:32:39,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804150686] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:32:39,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:32:39,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-12-09 15:32:39,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700778900] [2023-12-09 15:32:39,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:32:39,219 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:32:39,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:32:39,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:32:39,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-09 15:32:39,220 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 220 [2023-12-09 15:32:39,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 348 transitions, 2615 flow. Second operand has 4 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have 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:32:39,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:32:39,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 220 [2023-12-09 15:32:39,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:32:39,593 INFO L124 PetriNetUnfolderBase]: 1112/3039 cut-off events. [2023-12-09 15:32:39,593 INFO L125 PetriNetUnfolderBase]: For 17330/18109 co-relation queries the response was YES. [2023-12-09 15:32:39,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11745 conditions, 3039 events. 1112/3039 cut-off events. For 17330/18109 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 21820 event pairs, 156 based on Foata normal form. 37/2799 useless extension candidates. Maximal degree in co-relation 7417. Up to 1037 conditions per place. [2023-12-09 15:32:39,616 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 95 selfloop transitions, 19 changer transitions 101/412 dead transitions. [2023-12-09 15:32:39,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 412 transitions, 3938 flow [2023-12-09 15:32:39,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-09 15:32:39,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-09 15:32:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 797 transitions. [2023-12-09 15:32:39,618 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9056818181818181 [2023-12-09 15:32:39,618 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 797 transitions. [2023-12-09 15:32:39,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 797 transitions. [2023-12-09 15:32:39,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:32:39,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 797 transitions. [2023-12-09 15:32:39,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 199.25) internal successors, (797), 4 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have 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:32:39,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have 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:32:39,621 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have 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:32:39,622 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, 39 predicate places. [2023-12-09 15:32:39,622 INFO L500 AbstractCegarLoop]: Abstraction has has 237 places, 412 transitions, 3938 flow [2023-12-09 15:32:39,622 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have 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:32:39,622 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:32:39,622 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:32:39,630 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:32:39,827 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:32:39,828 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:32:39,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:32:39,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1844139516, now seen corresponding path program 1 times [2023-12-09 15:32:39,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:32:39,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447767327] [2023-12-09 15:32:39,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:32:39,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:32:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:32:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:32:40,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:32:40,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447767327] [2023-12-09 15:32:40,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447767327] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:32:40,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385781724] [2023-12-09 15:32:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:32:40,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:32:40,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:32:40,059 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:32:40,088 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:32:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:32:40,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-09 15:32:40,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:32:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:32:40,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:32:40,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:32:40,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385781724] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:32:40,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:32:40,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-12-09 15:32:40,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102286409] [2023-12-09 15:32:40,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:32:40,637 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-09 15:32:40,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:32:40,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-09 15:32:40,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-12-09 15:32:40,640 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 220 [2023-12-09 15:32:40,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 412 transitions, 3938 flow. Second operand has 19 states, 19 states have (on average 162.94736842105263) internal successors, (3096), 19 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have 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:32:40,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:32:40,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 220 [2023-12-09 15:32:40,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:32:41,616 INFO L124 PetriNetUnfolderBase]: 1908/4984 cut-off events. [2023-12-09 15:32:41,616 INFO L125 PetriNetUnfolderBase]: For 42395/43880 co-relation queries the response was YES. [2023-12-09 15:32:41,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21628 conditions, 4984 events. 1908/4984 cut-off events. For 42395/43880 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 39621 event pairs, 256 based on Foata normal form. 157/4664 useless extension candidates. Maximal degree in co-relation 9228. Up to 1782 conditions per place. [2023-12-09 15:32:41,656 INFO L140 encePairwiseOnDemand]: 203/220 looper letters, 217 selfloop transitions, 26 changer transitions 173/573 dead transitions. [2023-12-09 15:32:41,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 573 transitions, 7180 flow [2023-12-09 15:32:41,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-09 15:32:41,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-12-09 15:32:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3453 transitions. [2023-12-09 15:32:41,661 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7474025974025974 [2023-12-09 15:32:41,661 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3453 transitions. [2023-12-09 15:32:41,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3453 transitions. [2023-12-09 15:32:41,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:32:41,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3453 transitions. [2023-12-09 15:32:41,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 164.42857142857142) internal successors, (3453), 21 states have internal predecessors, (3453), 0 states have call successors, (0), 0 states have 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:32:41,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 220.0) internal successors, (4840), 22 states have internal predecessors, (4840), 0 states have call successors, (0), 0 states have 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:32:41,673 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 220.0) internal successors, (4840), 22 states have internal predecessors, (4840), 0 states have call successors, (0), 0 states have 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:32:41,674 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, 59 predicate places. [2023-12-09 15:32:41,674 INFO L500 AbstractCegarLoop]: Abstraction has has 257 places, 573 transitions, 7180 flow [2023-12-09 15:32:41,675 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 162.94736842105263) internal successors, (3096), 19 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have 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:32:41,675 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:32:41,675 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:41,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-09 15:32:41,880 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,SelfDestructingSolverStorable7 [2023-12-09 15:32:41,880 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:32:41,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:32:41,881 INFO L85 PathProgramCache]: Analyzing trace with hash 367090151, now seen corresponding path program 1 times [2023-12-09 15:32:41,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:32:41,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011181987] [2023-12-09 15:32:41,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:32:41,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:32:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:32:42,141 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 15:32:42,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:32:42,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011181987] [2023-12-09 15:32:42,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011181987] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:32:42,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781482381] [2023-12-09 15:32:42,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:32:42,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:32:42,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:32:42,143 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:32:42,160 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:32:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:32:42,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:32:42,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:32:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-09 15:32:42,385 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:32:42,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781482381] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:32:42,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:32:42,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-12-09 15:32:42,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232279256] [2023-12-09 15:32:42,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:32:42,387 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:32:42,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:32:42,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:32:42,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-09 15:32:42,389 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 220 [2023-12-09 15:32:42,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 573 transitions, 7180 flow. Second operand has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have 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:32:42,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:32:42,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 220 [2023-12-09 15:32:42,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:32:43,497 INFO L124 PetriNetUnfolderBase]: 2435/6485 cut-off events. [2023-12-09 15:32:43,497 INFO L125 PetriNetUnfolderBase]: For 61829/64325 co-relation queries the response was YES. [2023-12-09 15:32:43,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29070 conditions, 6485 events. 2435/6485 cut-off events. For 61829/64325 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 53493 event pairs, 485 based on Foata normal form. 281/6111 useless extension candidates. Maximal degree in co-relation 20887. Up to 2178 conditions per place. [2023-12-09 15:32:43,549 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 125 selfloop transitions, 38 changer transitions 222/581 dead transitions. [2023-12-09 15:32:43,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 581 transitions, 7991 flow [2023-12-09 15:32:43,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-09 15:32:43,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-09 15:32:43,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 799 transitions. [2023-12-09 15:32:43,551 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9079545454545455 [2023-12-09 15:32:43,551 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 799 transitions. [2023-12-09 15:32:43,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 799 transitions. [2023-12-09 15:32:43,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:32:43,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 799 transitions. [2023-12-09 15:32:43,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 199.75) internal successors, (799), 4 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have 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:32:43,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have 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:32:43,554 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have 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:32:43,555 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, 62 predicate places. [2023-12-09 15:32:43,555 INFO L500 AbstractCegarLoop]: Abstraction has has 260 places, 581 transitions, 7991 flow [2023-12-09 15:32:43,564 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have 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:32:43,565 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:32:43,565 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:43,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-09 15:32:43,770 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:32:43,770 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:32:43,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:32:43,771 INFO L85 PathProgramCache]: Analyzing trace with hash 228537446, now seen corresponding path program 2 times [2023-12-09 15:32:43,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:32:43,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253471680] [2023-12-09 15:32:43,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:32:43,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:32:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:32:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:32:45,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:32:45,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253471680] [2023-12-09 15:32:45,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253471680] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:32:45,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450846193] [2023-12-09 15:32:45,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:32:45,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:32:45,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:32:45,246 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:32:45,274 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:32:45,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:32:45,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:32:45,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-09 15:32:45,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:32:45,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-09 15:32:45,422 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-09 15:32:45,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-09 15:32:45,741 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-09 15:32:45,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-12-09 15:32:46,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-09 15:32:46,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-09 15:32:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:32:46,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:32:47,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:32:47,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 77 [2023-12-09 15:32:47,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2023-12-09 15:32:47,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2023-12-09 15:32:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:32:49,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450846193] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:32:49,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:32:49,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 64 [2023-12-09 15:32:49,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552081008] [2023-12-09 15:32:49,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:32:49,756 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-12-09 15:32:49,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:32:49,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-12-09 15:32:49,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=3697, Unknown=0, NotChecked=0, Total=4032 [2023-12-09 15:32:49,765 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 220 [2023-12-09 15:32:49,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 581 transitions, 7991 flow. Second operand has 64 states, 64 states have (on average 121.484375) internal successors, (7775), 64 states have internal predecessors, (7775), 0 states have call successors, (0), 0 states have 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:32:49,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:32:49,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 220 [2023-12-09 15:32:49,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:33:09,573 INFO L124 PetriNetUnfolderBase]: 34169/69176 cut-off events. [2023-12-09 15:33:09,573 INFO L125 PetriNetUnfolderBase]: For 783387/785102 co-relation queries the response was YES. [2023-12-09 15:33:09,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329352 conditions, 69176 events. 34169/69176 cut-off events. For 783387/785102 co-relation queries the response was YES. Maximal size of possible extension queue 2051. Compared 735062 event pairs, 6019 based on Foata normal form. 167/61807 useless extension candidates. Maximal degree in co-relation 216226. Up to 25683 conditions per place. [2023-12-09 15:33:10,621 INFO L140 encePairwiseOnDemand]: 178/220 looper letters, 810 selfloop transitions, 281 changer transitions 436/1647 dead transitions. [2023-12-09 15:33:10,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 1647 transitions, 29876 flow [2023-12-09 15:33:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-12-09 15:33:10,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2023-12-09 15:33:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 11782 transitions. [2023-12-09 15:33:10,641 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5578598484848485 [2023-12-09 15:33:10,641 INFO L72 ComplementDD]: Start complementDD. Operand 96 states and 11782 transitions. [2023-12-09 15:33:10,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 11782 transitions. [2023-12-09 15:33:10,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:33:10,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 96 states and 11782 transitions. [2023-12-09 15:33:10,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 97 states, 96 states have (on average 122.72916666666667) internal successors, (11782), 96 states have internal predecessors, (11782), 0 states have call successors, (0), 0 states have 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:33:10,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 97 states, 97 states have (on average 220.0) internal successors, (21340), 97 states have internal predecessors, (21340), 0 states have call successors, (0), 0 states have 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:33:10,691 INFO L81 ComplementDD]: Finished complementDD. Result has 97 states, 97 states have (on average 220.0) internal successors, (21340), 97 states have internal predecessors, (21340), 0 states have call successors, (0), 0 states have 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:33:10,692 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, 157 predicate places. [2023-12-09 15:33:10,692 INFO L500 AbstractCegarLoop]: Abstraction has has 355 places, 1647 transitions, 29876 flow [2023-12-09 15:33:10,694 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 121.484375) internal successors, (7775), 64 states have internal predecessors, (7775), 0 states have call successors, (0), 0 states have 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:33:10,694 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:33:10,694 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:10,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-09 15:33:10,916 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:33:10,917 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:33:10,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:33:10,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1462385692, now seen corresponding path program 1 times [2023-12-09 15:33:10,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:33:10,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743198618] [2023-12-09 15:33:10,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:33:10,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:33:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:33:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-09 15:33:11,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:33:11,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743198618] [2023-12-09 15:33:11,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743198618] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:33:11,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074614833] [2023-12-09 15:33:11,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:33:11,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:33:11,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:33:11,132 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:33:11,134 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:33:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:33:11,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-09 15:33:11,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:33:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-09 15:33:11,411 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:33:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-09 15:33:11,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074614833] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:33:11,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:33:11,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-12-09 15:33:11,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659130505] [2023-12-09 15:33:11,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:33:11,618 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-09 15:33:11,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:33:11,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-09 15:33:11,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-12-09 15:33:11,623 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 220 [2023-12-09 15:33:11,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 1647 transitions, 29876 flow. Second operand has 19 states, 19 states have (on average 163.1578947368421) internal successors, (3100), 19 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have 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:33:11,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:33:11,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 220 [2023-12-09 15:33:11,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:33:30,647 INFO L124 PetriNetUnfolderBase]: 43479/89847 cut-off events. [2023-12-09 15:33:30,647 INFO L125 PetriNetUnfolderBase]: For 1253685/1256062 co-relation queries the response was YES. [2023-12-09 15:33:31,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451002 conditions, 89847 events. 43479/89847 cut-off events. For 1253685/1256062 co-relation queries the response was YES. Maximal size of possible extension queue 2117. Compared 990780 event pairs, 8909 based on Foata normal form. 1462/81394 useless extension candidates. Maximal degree in co-relation 232179. Up to 30725 conditions per place. [2023-12-09 15:33:31,687 INFO L140 encePairwiseOnDemand]: 204/220 looper letters, 1043 selfloop transitions, 50 changer transitions 760/2133 dead transitions. [2023-12-09 15:33:31,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 2133 transitions, 44774 flow [2023-12-09 15:33:31,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-09 15:33:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-12-09 15:33:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3109 transitions. [2023-12-09 15:33:31,690 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7437799043062201 [2023-12-09 15:33:31,691 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3109 transitions. [2023-12-09 15:33:31,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3109 transitions. [2023-12-09 15:33:31,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:33:31,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3109 transitions. [2023-12-09 15:33:31,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 163.6315789473684) internal successors, (3109), 19 states have internal predecessors, (3109), 0 states have call successors, (0), 0 states have 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:33:31,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 220.0) internal successors, (4400), 20 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have 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:33:31,697 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 220.0) internal successors, (4400), 20 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have 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:33:31,698 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, 175 predicate places. [2023-12-09 15:33:31,698 INFO L500 AbstractCegarLoop]: Abstraction has has 373 places, 2133 transitions, 44774 flow [2023-12-09 15:33:31,698 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 163.1578947368421) internal successors, (3100), 19 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have 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:33:31,698 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:33:31,698 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:33:31,716 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:33:31,902 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,SelfDestructingSolverStorable10 [2023-12-09 15:33:31,905 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:33:31,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:33:31,906 INFO L85 PathProgramCache]: Analyzing trace with hash 613567350, now seen corresponding path program 3 times [2023-12-09 15:33:31,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:33:31,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22030405] [2023-12-09 15:33:31,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:33:31,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:33:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:33:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:33:33,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:33:33,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22030405] [2023-12-09 15:33:33,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22030405] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:33:33,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690088606] [2023-12-09 15:33:33,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:33:33,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:33:33,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:33:33,965 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:33:33,968 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:33:34,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-09 15:33:34,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:33:34,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-09 15:33:34,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:33:34,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:33:34,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-09 15:33:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-09 15:33:34,509 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:33:34,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:33:34,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 37 [2023-12-09 15:33:34,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-12-09 15:33:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-09 15:33:35,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690088606] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:33:35,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:33:35,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12, 12] total 40 [2023-12-09 15:33:35,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730492587] [2023-12-09 15:33:35,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:33:35,131 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-09 15:33:35,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:33:35,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-09 15:33:35,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1441, Unknown=6, NotChecked=0, Total=1560 [2023-12-09 15:33:35,134 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 220 [2023-12-09 15:33:35,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 2133 transitions, 44774 flow. Second operand has 40 states, 40 states have (on average 129.15) internal successors, (5166), 40 states have internal predecessors, (5166), 0 states have call successors, (0), 0 states have 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:33:35,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:33:35,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 220 [2023-12-09 15:33:35,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:33:47,794 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([722] L48-->L52: Formula: (and (not (= (ite (and (< v_~q1_back~0_63 v_~n1~0_21) (<= 0 v_~q1_back~0_63)) 1 0) 0)) (= (+ 1 v_~q1_back~0_63) v_~q1_back~0_62) (not (= (ite (= (select (select |v_#memory_int_63| v_~q1~0.base_32) (+ (* 4 v_~q1_back~0_63) v_~q1~0.offset_32)) 1) 1 0) 0))) InVars {#memory_int=|v_#memory_int_63|, ~q1~0.offset=v_~q1~0.offset_32, ~q1_back~0=v_~q1_back~0_63, ~n1~0=v_~n1~0_21, ~q1~0.base=v_~q1~0.base_32} OutVars{~q1~0.offset=v_~q1~0.offset_32, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_1|, ~q1_back~0=v_~q1_back~0_62, ~n1~0=v_~n1~0_21, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.base=v_~q1~0.base_32, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][1261], [281#true, 2446#(<= ~q1_back~0 (+ ~q1_front~0 1)), 88#L121-1true, 109#L52true, 215#true, 218#true, 239#true, 6539#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), 763#(<= ~q2_back~0 (+ 1 ~q2_front~0)), thread1Thread1of1ForFork2InUse, 183#L65-2true, thread2Thread1of1ForFork0InUse, 156#L87-2true, 846#true, thread3Thread1of1ForFork1InUse, 3958#(and (<= ~q1_front~0 ~q1_back~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 4470#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 222#true, 261#(and (<= 0 ~N~0) (= ~t~0 0))]) [2023-12-09 15:33:47,794 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2023-12-09 15:33:47,794 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2023-12-09 15:33:47,794 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2023-12-09 15:33:47,794 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2023-12-09 15:33:47,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([722] L48-->L52: Formula: (and (not (= (ite (and (< v_~q1_back~0_63 v_~n1~0_21) (<= 0 v_~q1_back~0_63)) 1 0) 0)) (= (+ 1 v_~q1_back~0_63) v_~q1_back~0_62) (not (= (ite (= (select (select |v_#memory_int_63| v_~q1~0.base_32) (+ (* 4 v_~q1_back~0_63) v_~q1~0.offset_32)) 1) 1 0) 0))) InVars {#memory_int=|v_#memory_int_63|, ~q1~0.offset=v_~q1~0.offset_32, ~q1_back~0=v_~q1_back~0_63, ~n1~0=v_~n1~0_21, ~q1~0.base=v_~q1~0.base_32} OutVars{~q1~0.offset=v_~q1~0.offset_32, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_1|, ~q1_back~0=v_~q1_back~0_62, ~n1~0=v_~n1~0_21, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.base=v_~q1~0.base_32, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][1266], [281#true, 2446#(<= ~q1_back~0 (+ ~q1_front~0 1)), 88#L121-1true, 109#L52true, 218#true, 239#true, 97#L65-3true, 215#true, 763#(<= ~q2_back~0 (+ 1 ~q2_front~0)), thread1Thread1of1ForFork2InUse, 3944#(and (<= ~q1_front~0 ~q1_back~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 5212#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|), thread2Thread1of1ForFork0InUse, 156#L87-2true, thread3Thread1of1ForFork1InUse, 846#true, 4470#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 222#true, 261#(and (<= 0 ~N~0) (= ~t~0 0))]) [2023-12-09 15:33:47,798 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2023-12-09 15:33:47,798 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2023-12-09 15:33:47,798 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2023-12-09 15:33:47,798 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2023-12-09 15:33:48,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] L88-->L92: Formula: (and (= (select (select |v_#memory_int_79| v_~q2~0.base_27) (+ v_~q2~0.offset_27 (* 4 v_~q2_front~0_33))) |v_thread3Thread1of1ForFork1_~k~0#1_3|) (not (= (ite (and (< v_~q2_front~0_33 v_~q2_back~0_48) (<= 0 v_~q2_front~0_33) (< v_~q2_front~0_33 v_~n2~0_18)) 1 0) 0)) (= (+ v_~q2_front~0_33 1) v_~q2_front~0_32)) InVars {~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_27, #memory_int=|v_#memory_int_79|, ~q2_front~0=v_~q2_front~0_33, ~q2~0.base=v_~q2~0.base_27, ~q2_back~0=v_~q2_back~0_48} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork1_#t~mem10#1=|v_thread3Thread1of1ForFork1_#t~mem10#1_1|, ~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_27, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_79|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, ~q2_front~0=v_~q2_front~0_32, ~q2~0.base=v_~q2~0.base_27, thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_3|, ~q2_back~0=v_~q2_back~0_48} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~mem10#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork1_~k~0#1][1717], [281#true, 88#L121-1true, 86#L48true, 426#(<= ~q2_back~0 ~q2_front~0), 218#true, 215#true, 239#true, 6539#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), thread1Thread1of1ForFork2InUse, 183#L65-2true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 846#true, 3958#(and (<= ~q1_front~0 ~q1_back~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 4470#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2127#(<= ~q1_back~0 ~q1_front~0), 222#true, 121#L92true, 261#(and (<= 0 ~N~0) (= ~t~0 0))]) [2023-12-09 15:33:48,633 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,633 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,633 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,633 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,642 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] L88-->L92: Formula: (and (= (select (select |v_#memory_int_79| v_~q2~0.base_27) (+ v_~q2~0.offset_27 (* 4 v_~q2_front~0_33))) |v_thread3Thread1of1ForFork1_~k~0#1_3|) (not (= (ite (and (< v_~q2_front~0_33 v_~q2_back~0_48) (<= 0 v_~q2_front~0_33) (< v_~q2_front~0_33 v_~n2~0_18)) 1 0) 0)) (= (+ v_~q2_front~0_33 1) v_~q2_front~0_32)) InVars {~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_27, #memory_int=|v_#memory_int_79|, ~q2_front~0=v_~q2_front~0_33, ~q2~0.base=v_~q2~0.base_27, ~q2_back~0=v_~q2_back~0_48} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork1_#t~mem10#1=|v_thread3Thread1of1ForFork1_#t~mem10#1_1|, ~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_27, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_79|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, ~q2_front~0=v_~q2_front~0_32, ~q2~0.base=v_~q2~0.base_27, thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_3|, ~q2_back~0=v_~q2_back~0_48} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~mem10#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork1_~k~0#1][1719], [281#true, 88#L121-1true, 86#L48true, 426#(<= ~q2_back~0 ~q2_front~0), 218#true, 97#L65-3true, 239#true, 215#true, thread1Thread1of1ForFork2InUse, 3944#(and (<= ~q1_front~0 ~q1_back~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 5212#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|), thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 846#true, 4470#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 222#true, 2127#(<= ~q1_back~0 ~q1_front~0), 121#L92true, 261#(and (<= 0 ~N~0) (= ~t~0 0))]) [2023-12-09 15:33:48,642 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,642 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,642 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,643 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] L88-->L92: Formula: (and (= (select (select |v_#memory_int_79| v_~q2~0.base_27) (+ v_~q2~0.offset_27 (* 4 v_~q2_front~0_33))) |v_thread3Thread1of1ForFork1_~k~0#1_3|) (not (= (ite (and (< v_~q2_front~0_33 v_~q2_back~0_48) (<= 0 v_~q2_front~0_33) (< v_~q2_front~0_33 v_~n2~0_18)) 1 0) 0)) (= (+ v_~q2_front~0_33 1) v_~q2_front~0_32)) InVars {~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_27, #memory_int=|v_#memory_int_79|, ~q2_front~0=v_~q2_front~0_33, ~q2~0.base=v_~q2~0.base_27, ~q2_back~0=v_~q2_back~0_48} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork1_#t~mem10#1=|v_thread3Thread1of1ForFork1_#t~mem10#1_1|, ~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_27, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_79|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, ~q2_front~0=v_~q2_front~0_32, ~q2~0.base=v_~q2~0.base_27, thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_3|, ~q2_back~0=v_~q2_back~0_48} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~mem10#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork1_~k~0#1][1717], [281#true, 88#L121-1true, 73#L47-6true, 426#(<= ~q2_back~0 ~q2_front~0), 215#true, 218#true, 239#true, 6539#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), thread1Thread1of1ForFork2InUse, 183#L65-2true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 846#true, 3958#(and (<= ~q1_front~0 ~q1_back~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 4470#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2127#(<= ~q1_back~0 ~q1_front~0), 222#true, 121#L92true, 261#(and (<= 0 ~N~0) (= ~t~0 0))]) [2023-12-09 15:33:48,649 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,649 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,650 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,650 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] L88-->L92: Formula: (and (= (select (select |v_#memory_int_79| v_~q2~0.base_27) (+ v_~q2~0.offset_27 (* 4 v_~q2_front~0_33))) |v_thread3Thread1of1ForFork1_~k~0#1_3|) (not (= (ite (and (< v_~q2_front~0_33 v_~q2_back~0_48) (<= 0 v_~q2_front~0_33) (< v_~q2_front~0_33 v_~n2~0_18)) 1 0) 0)) (= (+ v_~q2_front~0_33 1) v_~q2_front~0_32)) InVars {~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_27, #memory_int=|v_#memory_int_79|, ~q2_front~0=v_~q2_front~0_33, ~q2~0.base=v_~q2~0.base_27, ~q2_back~0=v_~q2_back~0_48} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork1_#t~mem10#1=|v_thread3Thread1of1ForFork1_#t~mem10#1_1|, ~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_27, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_79|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, ~q2_front~0=v_~q2_front~0_32, ~q2~0.base=v_~q2~0.base_27, thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_3|, ~q2_back~0=v_~q2_back~0_48} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~mem10#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork1_~k~0#1][1719], [281#true, 88#L121-1true, 73#L47-6true, 426#(<= ~q2_back~0 ~q2_front~0), 239#true, 218#true, 215#true, 97#L65-3true, thread1Thread1of1ForFork2InUse, 3944#(and (<= ~q1_front~0 ~q1_back~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), thread2Thread1of1ForFork0InUse, 5212#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|), thread3Thread1of1ForFork1InUse, 846#true, 4470#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 222#true, 2127#(<= ~q1_back~0 ~q1_front~0), 121#L92true, 261#(and (<= 0 ~N~0) (= ~t~0 0))]) [2023-12-09 15:33:48,653 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,653 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,653 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,653 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L54-->L58: Formula: (and (= (+ 1 v_~q1_back~0_77) v_~q1_back~0_76) (not (= 0 (ite (= (select (select |v_#memory_int_77| v_~q1~0.base_40) (+ v_~q1~0.offset_40 (* 4 v_~q1_back~0_77))) 0) 1 0))) (not (= (ite (and (<= 0 v_~q1_back~0_77) (< v_~q1_back~0_77 v_~n1~0_33)) 1 0) 0))) InVars {#memory_int=|v_#memory_int_77|, ~q1~0.offset=v_~q1~0.offset_40, ~q1_back~0=v_~q1_back~0_77, ~n1~0=v_~n1~0_33, ~q1~0.base=v_~q1~0.base_40} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_1|, ~q1~0.offset=v_~q1~0.offset_40, ~q1_back~0=v_~q1_back~0_76, ~n1~0=v_~n1~0_33, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, ~q1~0.base=v_~q1~0.base_40, #memory_int=|v_#memory_int_77|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][1335], [281#true, 44#L58true, 2446#(<= ~q1_back~0 (+ ~q1_front~0 1)), 88#L121-1true, 218#true, 239#true, 215#true, 6539#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), 763#(<= ~q2_back~0 (+ 1 ~q2_front~0)), thread1Thread1of1ForFork2InUse, 183#L65-2true, thread2Thread1of1ForFork0InUse, 156#L87-2true, 846#true, thread3Thread1of1ForFork1InUse, 3958#(and (<= ~q1_front~0 ~q1_back~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 4470#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 222#true, 261#(and (<= 0 ~N~0) (= ~t~0 0))]) [2023-12-09 15:33:48,677 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,677 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,677 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,677 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,679 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L54-->L58: Formula: (and (= (+ 1 v_~q1_back~0_77) v_~q1_back~0_76) (not (= 0 (ite (= (select (select |v_#memory_int_77| v_~q1~0.base_40) (+ v_~q1~0.offset_40 (* 4 v_~q1_back~0_77))) 0) 1 0))) (not (= (ite (and (<= 0 v_~q1_back~0_77) (< v_~q1_back~0_77 v_~n1~0_33)) 1 0) 0))) InVars {#memory_int=|v_#memory_int_77|, ~q1~0.offset=v_~q1~0.offset_40, ~q1_back~0=v_~q1_back~0_77, ~n1~0=v_~n1~0_33, ~q1~0.base=v_~q1~0.base_40} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_1|, ~q1~0.offset=v_~q1~0.offset_40, ~q1_back~0=v_~q1_back~0_76, ~n1~0=v_~n1~0_33, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, ~q1~0.base=v_~q1~0.base_40, #memory_int=|v_#memory_int_77|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][1337], [281#true, 44#L58true, 2446#(<= ~q1_back~0 (+ ~q1_front~0 1)), 88#L121-1true, 218#true, 215#true, 97#L65-3true, 239#true, 763#(<= ~q2_back~0 (+ 1 ~q2_front~0)), thread1Thread1of1ForFork2InUse, 3944#(and (<= ~q1_front~0 ~q1_back~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 5212#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|), thread2Thread1of1ForFork0InUse, 156#L87-2true, 846#true, thread3Thread1of1ForFork1InUse, 4470#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 222#true, 261#(and (<= 0 ~N~0) (= ~t~0 0))]) [2023-12-09 15:33:48,679 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,679 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,679 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-12-09 15:33:48,679 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-12-09 15:33:49,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] L88-->L92: Formula: (and (= (select (select |v_#memory_int_79| v_~q2~0.base_27) (+ v_~q2~0.offset_27 (* 4 v_~q2_front~0_33))) |v_thread3Thread1of1ForFork1_~k~0#1_3|) (not (= (ite (and (< v_~q2_front~0_33 v_~q2_back~0_48) (<= 0 v_~q2_front~0_33) (< v_~q2_front~0_33 v_~n2~0_18)) 1 0) 0)) (= (+ v_~q2_front~0_33 1) v_~q2_front~0_32)) InVars {~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_27, #memory_int=|v_#memory_int_79|, ~q2_front~0=v_~q2_front~0_33, ~q2~0.base=v_~q2~0.base_27, ~q2_back~0=v_~q2_back~0_48} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork1_#t~mem10#1=|v_thread3Thread1of1ForFork1_#t~mem10#1_1|, ~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_27, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_79|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, ~q2_front~0=v_~q2_front~0_32, ~q2~0.base=v_~q2~0.base_27, thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_3|, ~q2_back~0=v_~q2_back~0_48} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~mem10#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork1_~k~0#1][1717], [281#true, 88#L121-1true, 426#(<= ~q2_back~0 ~q2_front~0), 239#true, 215#true, 218#true, 6539#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), thread1Thread1of1ForFork2InUse, 183#L65-2true, 101#L54true, thread2Thread1of1ForFork0InUse, 846#true, thread3Thread1of1ForFork1InUse, 3958#(and (<= ~q1_front~0 ~q1_back~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 4470#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2127#(<= ~q1_back~0 ~q1_front~0), 222#true, 121#L92true, 261#(and (<= 0 ~N~0) (= ~t~0 0))]) [2023-12-09 15:33:49,802 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is cut-off event [2023-12-09 15:33:49,802 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2023-12-09 15:33:49,802 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2023-12-09 15:33:49,803 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2023-12-09 15:33:49,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] L88-->L92: Formula: (and (= (select (select |v_#memory_int_79| v_~q2~0.base_27) (+ v_~q2~0.offset_27 (* 4 v_~q2_front~0_33))) |v_thread3Thread1of1ForFork1_~k~0#1_3|) (not (= (ite (and (< v_~q2_front~0_33 v_~q2_back~0_48) (<= 0 v_~q2_front~0_33) (< v_~q2_front~0_33 v_~n2~0_18)) 1 0) 0)) (= (+ v_~q2_front~0_33 1) v_~q2_front~0_32)) InVars {~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_27, #memory_int=|v_#memory_int_79|, ~q2_front~0=v_~q2_front~0_33, ~q2~0.base=v_~q2~0.base_27, ~q2_back~0=v_~q2_back~0_48} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork1_#t~mem10#1=|v_thread3Thread1of1ForFork1_#t~mem10#1_1|, ~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_27, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_79|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, ~q2_front~0=v_~q2_front~0_32, ~q2~0.base=v_~q2~0.base_27, thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_3|, ~q2_back~0=v_~q2_back~0_48} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~mem10#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork1_~k~0#1][1719], [281#true, 88#L121-1true, 426#(<= ~q2_back~0 ~q2_front~0), 97#L65-3true, 215#true, 239#true, 218#true, thread1Thread1of1ForFork2InUse, 3944#(and (<= ~q1_front~0 ~q1_back~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 101#L54true, thread2Thread1of1ForFork0InUse, 5212#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|), thread3Thread1of1ForFork1InUse, 846#true, 4470#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 222#true, 2127#(<= ~q1_back~0 ~q1_front~0), 121#L92true, 261#(and (<= 0 ~N~0) (= ~t~0 0))]) [2023-12-09 15:33:49,824 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is cut-off event [2023-12-09 15:33:49,824 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2023-12-09 15:33:49,824 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2023-12-09 15:33:49,824 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2023-12-09 15:33:55,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([722] L48-->L52: Formula: (and (not (= (ite (and (< v_~q1_back~0_63 v_~n1~0_21) (<= 0 v_~q1_back~0_63)) 1 0) 0)) (= (+ 1 v_~q1_back~0_63) v_~q1_back~0_62) (not (= (ite (= (select (select |v_#memory_int_63| v_~q1~0.base_32) (+ (* 4 v_~q1_back~0_63) v_~q1~0.offset_32)) 1) 1 0) 0))) InVars {#memory_int=|v_#memory_int_63|, ~q1~0.offset=v_~q1~0.offset_32, ~q1_back~0=v_~q1_back~0_63, ~n1~0=v_~n1~0_21, ~q1~0.base=v_~q1~0.base_32} OutVars{~q1~0.offset=v_~q1~0.offset_32, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_1|, ~q1_back~0=v_~q1_back~0_62, ~n1~0=v_~n1~0_21, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.base=v_~q1~0.base_32, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][1767], [281#true, 2446#(<= ~q1_back~0 (+ ~q1_front~0 1)), 3981#true, 88#L121-1true, 109#L52true, 239#true, 215#true, 218#true, 763#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 6539#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), thread1Thread1of1ForFork2InUse, 183#L65-2true, thread2Thread1of1ForFork0InUse, 156#L87-2true, 846#true, thread3Thread1of1ForFork1InUse, 3958#(and (<= ~q1_front~0 ~q1_back~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 222#true, 261#(and (<= 0 ~N~0) (= ~t~0 0))]) [2023-12-09 15:33:55,226 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2023-12-09 15:33:55,226 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2023-12-09 15:33:55,226 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2023-12-09 15:33:55,226 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2023-12-09 15:33:56,145 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] L88-->L92: Formula: (and (= (select (select |v_#memory_int_79| v_~q2~0.base_27) (+ v_~q2~0.offset_27 (* 4 v_~q2_front~0_33))) |v_thread3Thread1of1ForFork1_~k~0#1_3|) (not (= (ite (and (< v_~q2_front~0_33 v_~q2_back~0_48) (<= 0 v_~q2_front~0_33) (< v_~q2_front~0_33 v_~n2~0_18)) 1 0) 0)) (= (+ v_~q2_front~0_33 1) v_~q2_front~0_32)) InVars {~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_27, #memory_int=|v_#memory_int_79|, ~q2_front~0=v_~q2_front~0_33, ~q2~0.base=v_~q2~0.base_27, ~q2_back~0=v_~q2_back~0_48} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork1_#t~mem10#1=|v_thread3Thread1of1ForFork1_#t~mem10#1_1|, ~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_27, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_79|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, ~q2_front~0=v_~q2_front~0_32, ~q2~0.base=v_~q2~0.base_27, thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_3|, ~q2_back~0=v_~q2_back~0_48} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~mem10#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork1_~k~0#1][2258], [281#true, 3981#true, 88#L121-1true, 86#L48true, 426#(<= ~q2_back~0 ~q2_front~0), 239#true, 218#true, 215#true, 6539#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), 183#L65-2true, thread1Thread1of1ForFork2InUse, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 846#true, 3958#(and (<= ~q1_front~0 ~q1_back~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 2127#(<= ~q1_back~0 ~q1_front~0), 222#true, 121#L92true, 261#(and (<= 0 ~N~0) (= ~t~0 0))]) [2023-12-09 15:33:56,146 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2023-12-09 15:33:56,146 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2023-12-09 15:33:56,146 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2023-12-09 15:33:56,146 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2023-12-09 15:33:56,161 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] L88-->L92: Formula: (and (= (select (select |v_#memory_int_79| v_~q2~0.base_27) (+ v_~q2~0.offset_27 (* 4 v_~q2_front~0_33))) |v_thread3Thread1of1ForFork1_~k~0#1_3|) (not (= (ite (and (< v_~q2_front~0_33 v_~q2_back~0_48) (<= 0 v_~q2_front~0_33) (< v_~q2_front~0_33 v_~n2~0_18)) 1 0) 0)) (= (+ v_~q2_front~0_33 1) v_~q2_front~0_32)) InVars {~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_27, #memory_int=|v_#memory_int_79|, ~q2_front~0=v_~q2_front~0_33, ~q2~0.base=v_~q2~0.base_27, ~q2_back~0=v_~q2_back~0_48} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork1_#t~mem10#1=|v_thread3Thread1of1ForFork1_#t~mem10#1_1|, ~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_27, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_79|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, ~q2_front~0=v_~q2_front~0_32, ~q2~0.base=v_~q2~0.base_27, thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_3|, ~q2_back~0=v_~q2_back~0_48} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~mem10#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork1_~k~0#1][2258], [281#true, 88#L121-1true, 3981#true, 73#L47-6true, 426#(<= ~q2_back~0 ~q2_front~0), 239#true, 215#true, 218#true, 6539#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), 183#L65-2true, thread1Thread1of1ForFork2InUse, thread2Thread1of1ForFork0InUse, 846#true, thread3Thread1of1ForFork1InUse, 3958#(and (<= ~q1_front~0 ~q1_back~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 2127#(<= ~q1_back~0 ~q1_front~0), 222#true, 121#L92true, 261#(and (<= 0 ~N~0) (= ~t~0 0))]) [2023-12-09 15:33:56,161 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2023-12-09 15:33:56,161 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2023-12-09 15:33:56,162 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2023-12-09 15:33:56,162 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2023-12-09 15:33:56,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L54-->L58: Formula: (and (= (+ 1 v_~q1_back~0_77) v_~q1_back~0_76) (not (= 0 (ite (= (select (select |v_#memory_int_77| v_~q1~0.base_40) (+ v_~q1~0.offset_40 (* 4 v_~q1_back~0_77))) 0) 1 0))) (not (= (ite (and (<= 0 v_~q1_back~0_77) (< v_~q1_back~0_77 v_~n1~0_33)) 1 0) 0))) InVars {#memory_int=|v_#memory_int_77|, ~q1~0.offset=v_~q1~0.offset_40, ~q1_back~0=v_~q1_back~0_77, ~n1~0=v_~n1~0_33, ~q1~0.base=v_~q1~0.base_40} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_1|, ~q1~0.offset=v_~q1~0.offset_40, ~q1_back~0=v_~q1_back~0_76, ~n1~0=v_~n1~0_33, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, ~q1~0.base=v_~q1~0.base_40, #memory_int=|v_#memory_int_77|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][1837], [281#true, 44#L58true, 2446#(<= ~q1_back~0 (+ ~q1_front~0 1)), 3981#true, 88#L121-1true, 239#true, 218#true, 215#true, 763#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 6539#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), thread1Thread1of1ForFork2InUse, 183#L65-2true, thread2Thread1of1ForFork0InUse, 156#L87-2true, thread3Thread1of1ForFork1InUse, 846#true, 3958#(and (<= ~q1_front~0 ~q1_back~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 222#true, 261#(and (<= 0 ~N~0) (= ~t~0 0))]) [2023-12-09 15:33:56,186 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2023-12-09 15:33:56,186 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2023-12-09 15:33:56,186 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2023-12-09 15:33:56,186 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2023-12-09 15:33:57,050 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] L88-->L92: Formula: (and (= (select (select |v_#memory_int_79| v_~q2~0.base_27) (+ v_~q2~0.offset_27 (* 4 v_~q2_front~0_33))) |v_thread3Thread1of1ForFork1_~k~0#1_3|) (not (= (ite (and (< v_~q2_front~0_33 v_~q2_back~0_48) (<= 0 v_~q2_front~0_33) (< v_~q2_front~0_33 v_~n2~0_18)) 1 0) 0)) (= (+ v_~q2_front~0_33 1) v_~q2_front~0_32)) InVars {~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_27, #memory_int=|v_#memory_int_79|, ~q2_front~0=v_~q2_front~0_33, ~q2~0.base=v_~q2~0.base_27, ~q2_back~0=v_~q2_back~0_48} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork1_#t~mem10#1=|v_thread3Thread1of1ForFork1_#t~mem10#1_1|, ~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_27, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_79|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, ~q2_front~0=v_~q2_front~0_32, ~q2~0.base=v_~q2~0.base_27, thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_3|, ~q2_back~0=v_~q2_back~0_48} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~mem10#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork1_~k~0#1][2258], [281#true, 3981#true, 88#L121-1true, 426#(<= ~q2_back~0 ~q2_front~0), 215#true, 218#true, 239#true, 6539#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), 183#L65-2true, thread1Thread1of1ForFork2InUse, thread2Thread1of1ForFork0InUse, 101#L54true, thread3Thread1of1ForFork1InUse, 846#true, 3958#(and (<= ~q1_front~0 ~q1_back~0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 222#true, 2127#(<= ~q1_back~0 ~q1_front~0), 121#L92true, 261#(and (<= 0 ~N~0) (= ~t~0 0))]) [2023-12-09 15:33:57,051 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2023-12-09 15:33:57,051 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-12-09 15:33:57,051 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-12-09 15:33:57,051 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-12-09 15:34:11,793 INFO L124 PetriNetUnfolderBase]: 57238/118663 cut-off events. [2023-12-09 15:34:11,793 INFO L125 PetriNetUnfolderBase]: For 1902670/1913746 co-relation queries the response was YES. [2023-12-09 15:34:12,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655334 conditions, 118663 events. 57238/118663 cut-off events. For 1902670/1913746 co-relation queries the response was YES. Maximal size of possible extension queue 2699. Compared 1363836 event pairs, 12050 based on Foata normal form. 1564/107597 useless extension candidates. Maximal degree in co-relation 256159. Up to 37903 conditions per place. [2023-12-09 15:34:13,477 INFO L140 encePairwiseOnDemand]: 189/220 looper letters, 1633 selfloop transitions, 203 changer transitions 1291/3250 dead transitions. [2023-12-09 15:34:13,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 3250 transitions, 76237 flow [2023-12-09 15:34:13,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-12-09 15:34:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-12-09 15:34:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 6519 transitions. [2023-12-09 15:34:13,488 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5810160427807487 [2023-12-09 15:34:13,488 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 6519 transitions. [2023-12-09 15:34:13,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 6519 transitions. [2023-12-09 15:34:13,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:34:13,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 6519 transitions. [2023-12-09 15:34:13,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 127.82352941176471) internal successors, (6519), 51 states have internal predecessors, (6519), 0 states have call successors, (0), 0 states have 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:34:13,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 220.0) internal successors, (11440), 52 states have internal predecessors, (11440), 0 states have call successors, (0), 0 states have 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:34:13,504 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 220.0) internal successors, (11440), 52 states have internal predecessors, (11440), 0 states have call successors, (0), 0 states have 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:34:13,505 INFO L308 CegarLoopForPetriNet]: 198 programPoint places, 225 predicate places. [2023-12-09 15:34:13,505 INFO L500 AbstractCegarLoop]: Abstraction has has 423 places, 3250 transitions, 76237 flow [2023-12-09 15:34:13,506 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 129.15) internal successors, (5166), 40 states have internal predecessors, (5166), 0 states have call successors, (0), 0 states have 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:34:13,506 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:34:13,506 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:34:13,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-09 15:34:13,711 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:34:13,712 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:34:13,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:34:13,712 INFO L85 PathProgramCache]: Analyzing trace with hash -252684148, now seen corresponding path program 4 times [2023-12-09 15:34:13,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:34:13,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550213769] [2023-12-09 15:34:13,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:34:13,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:34:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:34:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:34:15,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:34:15,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550213769] [2023-12-09 15:34:15,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550213769] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:34:15,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352029871] [2023-12-09 15:34:15,366 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-09 15:34:15,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:34:15,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:34:15,367 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:34:15,370 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:34:15,519 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-09 15:34:15,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:34:15,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-09 15:34:15,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:34:16,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:34:16,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-09 15:34:16,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2023-12-09 15:34:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:34:16,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:34:16,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:34:16,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 37 [2023-12-09 15:34:16,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-12-09 15:34:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:34:17,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352029871] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:34:17,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:34:17,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 62 [2023-12-09 15:34:17,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744440447] [2023-12-09 15:34:17,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:34:17,982 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-12-09 15:34:17,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:34:17,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-12-09 15:34:17,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=3448, Unknown=0, NotChecked=0, Total=3782 [2023-12-09 15:34:17,987 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 220 [2023-12-09 15:34:17,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 3250 transitions, 76237 flow. Second operand has 62 states, 62 states have (on average 127.69354838709677) internal successors, (7917), 62 states have internal predecessors, (7917), 0 states have call successors, (0), 0 states have 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:34:17,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:34:17,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 220 [2023-12-09 15:34:17,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand