/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_60-invariant_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 11:59:08,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 11:59:08,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-10 11:59:08,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 11:59:08,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 11:59:08,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 11:59:08,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 11:59:08,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 11:59:08,183 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 11:59:08,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 11:59:08,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 11:59:08,184 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 11:59:08,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 11:59:08,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 11:59:08,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 11:59:08,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 11:59:08,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 11:59:08,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 11:59:08,186 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 11:59:08,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 11:59:08,186 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 11:59:08,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 11:59:08,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 11:59:08,187 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 11:59:08,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 11:59:08,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:59:08,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 11:59:08,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 11:59:08,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 11:59:08,188 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 11:59:08,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 11:59:08,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 11:59:08,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 11:59:08,189 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 [2023-11-10 11:59:08,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 11:59:08,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 11:59:08,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 11:59:08,384 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 11:59:08,385 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 11:59:08,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_60-invariant_racefree.i [2023-11-10 11:59:09,440 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 11:59:09,636 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 11:59:09,637 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_60-invariant_racefree.i [2023-11-10 11:59:09,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab468a7f8/7f36ae8d31c54ebf8b5907d0edf6df49/FLAG7bfd02917 [2023-11-10 11:59:09,660 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab468a7f8/7f36ae8d31c54ebf8b5907d0edf6df49 [2023-11-10 11:59:09,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 11:59:09,663 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 11:59:09,664 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 11:59:09,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 11:59:09,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 11:59:09,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:59:09" (1/1) ... [2023-11-10 11:59:09,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@539a1ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:09, skipping insertion in model container [2023-11-10 11:59:09,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:59:09" (1/1) ... [2023-11-10 11:59:09,704 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 11:59:09,906 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_60-invariant_racefree.i[30176,30189] [2023-11-10 11:59:09,927 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:59:09,937 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 11:59:09,976 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_60-invariant_racefree.i[30176,30189] [2023-11-10 11:59:09,986 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:59:10,016 INFO L206 MainTranslator]: Completed translation [2023-11-10 11:59:10,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:10 WrapperNode [2023-11-10 11:59:10,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 11:59:10,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 11:59:10,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 11:59:10,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 11:59:10,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:10" (1/1) ... [2023-11-10 11:59:10,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:10" (1/1) ... [2023-11-10 11:59:10,072 INFO L138 Inliner]: procedures = 170, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 142 [2023-11-10 11:59:10,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 11:59:10,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 11:59:10,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 11:59:10,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 11:59:10,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:10" (1/1) ... [2023-11-10 11:59:10,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:10" (1/1) ... [2023-11-10 11:59:10,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:10" (1/1) ... [2023-11-10 11:59:10,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:10" (1/1) ... [2023-11-10 11:59:10,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:10" (1/1) ... [2023-11-10 11:59:10,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:10" (1/1) ... [2023-11-10 11:59:10,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:10" (1/1) ... [2023-11-10 11:59:10,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:10" (1/1) ... [2023-11-10 11:59:10,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 11:59:10,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 11:59:10,111 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 11:59:10,111 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 11:59:10,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:10" (1/1) ... [2023-11-10 11:59:10,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:59:10,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:59:10,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-10 11:59:10,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-10 11:59:10,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-10 11:59:10,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 11:59:10,172 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-10 11:59:10,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 11:59:10,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 11:59:10,172 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-10 11:59:10,172 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-10 11:59:10,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 11:59:10,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 11:59:10,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 11:59:10,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 11:59:10,174 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 11:59:10,256 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 11:59:10,258 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 11:59:10,412 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 11:59:10,428 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 11:59:10,428 INFO L302 CfgBuilder]: Removed 18 assume(true) statements. [2023-11-10 11:59:10,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:59:10 BoogieIcfgContainer [2023-11-10 11:59:10,431 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 11:59:10,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 11:59:10,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 11:59:10,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 11:59:10,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:59:09" (1/3) ... [2023-11-10 11:59:10,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79de9dd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:59:10, skipping insertion in model container [2023-11-10 11:59:10,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:10" (2/3) ... [2023-11-10 11:59:10,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79de9dd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:59:10, skipping insertion in model container [2023-11-10 11:59:10,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:59:10" (3/3) ... [2023-11-10 11:59:10,438 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_60-invariant_racefree.i [2023-11-10 11:59:10,450 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 11:59:10,450 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-10 11:59:10,450 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 11:59:10,499 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-10 11:59:10,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 144 transitions, 295 flow [2023-11-10 11:59:10,595 INFO L124 PetriNetUnfolderBase]: 33/204 cut-off events. [2023-11-10 11:59:10,596 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-10 11:59:10,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 204 events. 33/204 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 694 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 112. Up to 6 conditions per place. [2023-11-10 11:59:10,602 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 144 transitions, 295 flow [2023-11-10 11:59:10,609 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 139 transitions, 282 flow [2023-11-10 11:59:10,626 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:59:10,632 INFO L357 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=false, 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;@12bc160c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:59:10,635 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-10 11:59:10,655 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:59:10,655 INFO L124 PetriNetUnfolderBase]: 8/96 cut-off events. [2023-11-10 11:59:10,656 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:59:10,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:59:10,656 INFO L208 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] [2023-11-10 11:59:10,657 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-10 11:59:10,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:59:10,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1145404123, now seen corresponding path program 1 times [2023-11-10 11:59:10,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:59:10,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834686453] [2023-11-10 11:59:10,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:59:10,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:59:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:59:10,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:59:10,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:59:10,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834686453] [2023-11-10 11:59:10,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834686453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:59:10,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:59:10,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-10 11:59:10,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191613344] [2023-11-10 11:59:10,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:59:10,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-10 11:59:10,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:59:10,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-10 11:59:10,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-10 11:59:10,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 144 [2023-11-10 11:59:10,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 139 transitions, 282 flow. Second operand has 2 states, 2 states have (on average 120.5) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:10,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:59:10,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 144 [2023-11-10 11:59:10,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:59:10,985 INFO L124 PetriNetUnfolderBase]: 1/165 cut-off events. [2023-11-10 11:59:10,985 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-10 11:59:10,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 165 events. 1/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 312 event pairs, 0 based on Foata normal form. 31/188 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2023-11-10 11:59:10,987 INFO L140 encePairwiseOnDemand]: 124/144 looper letters, 1 selfloop transitions, 0 changer transitions 0/117 dead transitions. [2023-11-10 11:59:10,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 117 transitions, 240 flow [2023-11-10 11:59:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-10 11:59:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-10 11:59:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 261 transitions. [2023-11-10 11:59:10,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.90625 [2023-11-10 11:59:10,999 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 261 transitions. [2023-11-10 11:59:10,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 261 transitions. [2023-11-10 11:59:11,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:59:11,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 261 transitions. [2023-11-10 11:59:11,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:11,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:11,008 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:11,010 INFO L175 Difference]: Start difference. First operand has 121 places, 139 transitions, 282 flow. Second operand 2 states and 261 transitions. [2023-11-10 11:59:11,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 117 transitions, 240 flow [2023-11-10 11:59:11,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 117 transitions, 240 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:59:11,016 INFO L231 Difference]: Finished difference. Result has 120 places, 117 transitions, 238 flow [2023-11-10 11:59:11,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=238, PETRI_PLACES=120, PETRI_TRANSITIONS=117} [2023-11-10 11:59:11,020 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, -1 predicate places. [2023-11-10 11:59:11,020 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 117 transitions, 238 flow [2023-11-10 11:59:11,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 120.5) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:11,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:59:11,021 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-11-10 11:59:11,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 11:59:11,021 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-10 11:59:11,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:59:11,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1626480020, now seen corresponding path program 1 times [2023-11-10 11:59:11,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:59:11,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572939050] [2023-11-10 11:59:11,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:59:11,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:59:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:59:11,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:59:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:59:11,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:59:11,093 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:59:11,094 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-11-10 11:59:11,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-11-10 11:59:11,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-11-10 11:59:11,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-11-10 11:59:11,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 11:59:11,096 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-10 11:59:11,098 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-10 11:59:11,098 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-10 11:59:11,146 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-10 11:59:11,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 193 transitions, 402 flow [2023-11-10 11:59:11,190 INFO L124 PetriNetUnfolderBase]: 57/339 cut-off events. [2023-11-10 11:59:11,190 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-10 11:59:11,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 339 events. 57/339 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1318 event pairs, 0 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 206. Up to 9 conditions per place. [2023-11-10 11:59:11,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 193 transitions, 402 flow [2023-11-10 11:59:11,196 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 193 transitions, 402 flow [2023-11-10 11:59:11,197 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:59:11,198 INFO L357 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=false, 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;@12bc160c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:59:11,198 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-10 11:59:11,203 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:59:11,204 INFO L124 PetriNetUnfolderBase]: 8/96 cut-off events. [2023-11-10 11:59:11,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:59:11,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:59:11,204 INFO L208 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] [2023-11-10 11:59:11,204 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:59:11,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:59:11,204 INFO L85 PathProgramCache]: Analyzing trace with hash 339695964, now seen corresponding path program 1 times [2023-11-10 11:59:11,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:59:11,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846324548] [2023-11-10 11:59:11,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:59:11,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:59:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:59:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:59:11,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:59:11,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846324548] [2023-11-10 11:59:11,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846324548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:59:11,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:59:11,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-10 11:59:11,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113222135] [2023-11-10 11:59:11,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:59:11,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-10 11:59:11,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:59:11,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-10 11:59:11,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-10 11:59:11,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 193 [2023-11-10 11:59:11,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 193 transitions, 402 flow. Second operand has 2 states, 2 states have (on average 157.5) internal successors, (315), 2 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:11,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:59:11,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 193 [2023-11-10 11:59:11,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:59:11,295 INFO L124 PetriNetUnfolderBase]: 5/282 cut-off events. [2023-11-10 11:59:11,295 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-10 11:59:11,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 282 events. 5/282 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 838 event pairs, 0 based on Foata normal form. 73/341 useless extension candidates. Maximal degree in co-relation 174. Up to 7 conditions per place. [2023-11-10 11:59:11,299 INFO L140 encePairwiseOnDemand]: 164/193 looper letters, 4 selfloop transitions, 0 changer transitions 0/161 dead transitions. [2023-11-10 11:59:11,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 161 transitions, 346 flow [2023-11-10 11:59:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-10 11:59:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-10 11:59:11,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 347 transitions. [2023-11-10 11:59:11,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8989637305699482 [2023-11-10 11:59:11,307 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 347 transitions. [2023-11-10 11:59:11,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 347 transitions. [2023-11-10 11:59:11,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:59:11,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 347 transitions. [2023-11-10 11:59:11,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 173.5) internal successors, (347), 2 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:11,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:11,316 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:11,316 INFO L175 Difference]: Start difference. First operand has 165 places, 193 transitions, 402 flow. Second operand 2 states and 347 transitions. [2023-11-10 11:59:11,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 161 transitions, 346 flow [2023-11-10 11:59:11,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 161 transitions, 346 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:59:11,321 INFO L231 Difference]: Finished difference. Result has 163 places, 161 transitions, 338 flow [2023-11-10 11:59:11,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=338, PETRI_PLACES=163, PETRI_TRANSITIONS=161} [2023-11-10 11:59:11,322 INFO L281 CegarLoopForPetriNet]: 165 programPoint places, -2 predicate places. [2023-11-10 11:59:11,322 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 161 transitions, 338 flow [2023-11-10 11:59:11,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 157.5) internal successors, (315), 2 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:11,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:59:11,323 INFO L208 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] [2023-11-10 11:59:11,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 11:59:11,323 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:59:11,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:59:11,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1753394581, now seen corresponding path program 1 times [2023-11-10 11:59:11,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:59:11,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859263530] [2023-11-10 11:59:11,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:59:11,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:59:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:59:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:59:11,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:59:11,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859263530] [2023-11-10 11:59:11,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859263530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:59:11,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:59:11,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-10 11:59:11,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539717803] [2023-11-10 11:59:11,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:59:11,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-10 11:59:11,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:59:11,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-10 11:59:11,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-10 11:59:11,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 193 [2023-11-10 11:59:11,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 161 transitions, 338 flow. Second operand has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:11,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:59:11,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 193 [2023-11-10 11:59:11,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:59:12,408 INFO L124 PetriNetUnfolderBase]: 1639/6764 cut-off events. [2023-11-10 11:59:12,408 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2023-11-10 11:59:12,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9682 conditions, 6764 events. 1639/6764 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 73288 event pairs, 635 based on Foata normal form. 0/6341 useless extension candidates. Maximal degree in co-relation 9677. Up to 1252 conditions per place. [2023-11-10 11:59:12,445 INFO L140 encePairwiseOnDemand]: 176/193 looper letters, 92 selfloop transitions, 32 changer transitions 3/258 dead transitions. [2023-11-10 11:59:12,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 258 transitions, 820 flow [2023-11-10 11:59:12,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:59:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:59:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1312 transitions. [2023-11-10 11:59:12,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7553252734599885 [2023-11-10 11:59:12,449 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1312 transitions. [2023-11-10 11:59:12,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1312 transitions. [2023-11-10 11:59:12,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:59:12,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1312 transitions. [2023-11-10 11:59:12,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 145.77777777777777) internal successors, (1312), 9 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:12,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:12,456 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:12,457 INFO L175 Difference]: Start difference. First operand has 163 places, 161 transitions, 338 flow. Second operand 9 states and 1312 transitions. [2023-11-10 11:59:12,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 258 transitions, 820 flow [2023-11-10 11:59:12,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 258 transitions, 820 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:59:12,462 INFO L231 Difference]: Finished difference. Result has 178 places, 192 transitions, 582 flow [2023-11-10 11:59:12,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=582, PETRI_PLACES=178, PETRI_TRANSITIONS=192} [2023-11-10 11:59:12,463 INFO L281 CegarLoopForPetriNet]: 165 programPoint places, 13 predicate places. [2023-11-10 11:59:12,463 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 192 transitions, 582 flow [2023-11-10 11:59:12,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:12,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:59:12,464 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2023-11-10 11:59:12,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-10 11:59:12,464 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:59:12,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:59:12,465 INFO L85 PathProgramCache]: Analyzing trace with hash -973385384, now seen corresponding path program 1 times [2023-11-10 11:59:12,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:59:12,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346063794] [2023-11-10 11:59:12,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:59:12,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:59:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:59:12,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:59:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:59:12,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:59:12,492 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:59:12,493 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-10 11:59:12,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-10 11:59:12,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-11-10 11:59:12,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-11-10 11:59:12,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-10 11:59:12,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 11:59:12,493 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-10 11:59:12,494 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-10 11:59:12,494 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-10 11:59:12,514 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-10 11:59:12,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 242 transitions, 511 flow [2023-11-10 11:59:12,553 INFO L124 PetriNetUnfolderBase]: 86/509 cut-off events. [2023-11-10 11:59:12,553 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-10 11:59:12,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 509 events. 86/509 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2060 event pairs, 1 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 347. Up to 16 conditions per place. [2023-11-10 11:59:12,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 242 transitions, 511 flow [2023-11-10 11:59:12,561 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 242 transitions, 511 flow [2023-11-10 11:59:12,562 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:59:12,562 INFO L357 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=false, 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;@12bc160c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:59:12,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-10 11:59:12,567 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:59:12,567 INFO L124 PetriNetUnfolderBase]: 10/100 cut-off events. [2023-11-10 11:59:12,567 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:59:12,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:59:12,567 INFO L208 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] [2023-11-10 11:59:12,567 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-10 11:59:12,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:59:12,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1198741966, now seen corresponding path program 1 times [2023-11-10 11:59:12,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:59:12,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017617413] [2023-11-10 11:59:12,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:59:12,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:59:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:59:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:59:12,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:59:12,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017617413] [2023-11-10 11:59:12,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017617413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:59:12,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:59:12,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-10 11:59:12,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535597239] [2023-11-10 11:59:12,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:59:12,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-10 11:59:12,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:59:12,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-10 11:59:12,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-10 11:59:12,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 242 [2023-11-10 11:59:12,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 242 transitions, 511 flow. Second operand has 2 states, 2 states have (on average 194.5) internal successors, (389), 2 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:12,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:59:12,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 242 [2023-11-10 11:59:12,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:59:12,628 INFO L124 PetriNetUnfolderBase]: 11/427 cut-off events. [2023-11-10 11:59:12,628 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-11-10 11:59:12,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 427 events. 11/427 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1569 event pairs, 1 based on Foata normal form. 170/575 useless extension candidates. Maximal degree in co-relation 296. Up to 16 conditions per place. [2023-11-10 11:59:12,632 INFO L140 encePairwiseOnDemand]: 204/242 looper letters, 6 selfloop transitions, 0 changer transitions 0/200 dead transitions. [2023-11-10 11:59:12,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 200 transitions, 439 flow [2023-11-10 11:59:12,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-10 11:59:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-10 11:59:12,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 432 transitions. [2023-11-10 11:59:12,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8925619834710744 [2023-11-10 11:59:12,633 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 432 transitions. [2023-11-10 11:59:12,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 432 transitions. [2023-11-10 11:59:12,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:59:12,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 432 transitions. [2023-11-10 11:59:12,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 216.0) internal successors, (432), 2 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:12,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:12,636 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:12,636 INFO L175 Difference]: Start difference. First operand has 205 places, 242 transitions, 511 flow. Second operand 2 states and 432 transitions. [2023-11-10 11:59:12,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 200 transitions, 439 flow [2023-11-10 11:59:12,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 200 transitions, 439 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:59:12,639 INFO L231 Difference]: Finished difference. Result has 202 places, 200 transitions, 427 flow [2023-11-10 11:59:12,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=427, PETRI_PLACES=202, PETRI_TRANSITIONS=200} [2023-11-10 11:59:12,640 INFO L281 CegarLoopForPetriNet]: 205 programPoint places, -3 predicate places. [2023-11-10 11:59:12,640 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 200 transitions, 427 flow [2023-11-10 11:59:12,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 194.5) internal successors, (389), 2 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:12,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:59:12,640 INFO L208 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] [2023-11-10 11:59:12,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-10 11:59:12,640 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-10 11:59:12,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:59:12,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2012131220, now seen corresponding path program 1 times [2023-11-10 11:59:12,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:59:12,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360065593] [2023-11-10 11:59:12,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:59:12,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:59:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:59:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:59:12,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:59:12,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360065593] [2023-11-10 11:59:12,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360065593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:59:12,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:59:12,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-10 11:59:12,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889400520] [2023-11-10 11:59:12,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:59:12,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-10 11:59:12,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:59:12,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-10 11:59:12,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-10 11:59:12,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 242 [2023-11-10 11:59:12,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 200 transitions, 427 flow. Second operand has 5 states, 5 states have (on average 162.4) internal successors, (812), 5 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:12,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:59:12,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 242 [2023-11-10 11:59:12,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:59:18,806 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([956] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][282], [69#L716-5true, 208#true, 213#(= ~x~0 0), t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 89#L702-7true]) [2023-11-10 11:59:18,806 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2023-11-10 11:59:18,806 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-10 11:59:18,806 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-10 11:59:18,806 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-10 11:59:18,829 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([956] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][282], [69#L716-5true, 208#true, 213#(= ~x~0 0), t_funThread1of3ForFork0NotInUse, 168#L702-3true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse]) [2023-11-10 11:59:18,829 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-10 11:59:18,829 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-10 11:59:18,829 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-10 11:59:18,829 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-10 11:59:18,890 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([957] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][322], [69#L716-5true, 208#true, 213#(= ~x~0 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 188#L702-7true]) [2023-11-10 11:59:18,891 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2023-11-10 11:59:18,891 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-10 11:59:18,891 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-10 11:59:18,891 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-10 11:59:18,891 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([957] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][337], [69#L716-5true, 208#true, t_funThread1of3ForFork0InUse, 64#L691-5true, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2023-11-10 11:59:18,891 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-10 11:59:18,891 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-10 11:59:18,891 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-10 11:59:18,891 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-10 11:59:18,891 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([957] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][337], [69#L716-5true, 208#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 94#L691-1true]) [2023-11-10 11:59:18,891 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-10 11:59:18,891 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-10 11:59:18,892 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-10 11:59:18,892 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-10 11:59:18,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([957] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][338], [69#L716-5true, 208#true, 59#L691true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2023-11-10 11:59:18,892 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-10 11:59:18,892 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-10 11:59:18,892 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-10 11:59:18,892 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-10 11:59:18,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([957] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][338], [69#L716-5true, 208#true, t_funThread1of3ForFork0InUse, 13#L702-3true, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2023-11-10 11:59:18,892 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-10 11:59:18,892 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-10 11:59:18,892 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-10 11:59:18,892 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-10 11:59:18,905 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([957] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][338], [69#L716-5true, 208#true, 189#L702-4true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2023-11-10 11:59:18,906 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-10 11:59:18,906 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-10 11:59:18,906 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-10 11:59:18,906 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-10 11:59:19,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([957] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][322], [69#L716-5true, 208#true, 213#(= ~x~0 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, 127#L702-5true, t_funThread3of3ForFork0NotInUse]) [2023-11-10 11:59:19,006 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-10 11:59:19,006 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-10 11:59:19,006 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-10 11:59:19,006 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-10 11:59:19,039 INFO L124 PetriNetUnfolderBase]: 22359/70226 cut-off events. [2023-11-10 11:59:19,039 INFO L125 PetriNetUnfolderBase]: For 5050/5050 co-relation queries the response was YES. [2023-11-10 11:59:19,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104360 conditions, 70226 events. 22359/70226 cut-off events. For 5050/5050 co-relation queries the response was YES. Maximal size of possible extension queue 2705. Compared 1006112 event pairs, 8627 based on Foata normal form. 0/65805 useless extension candidates. Maximal degree in co-relation 104354. Up to 14295 conditions per place. [2023-11-10 11:59:19,604 INFO L140 encePairwiseOnDemand]: 221/242 looper letters, 149 selfloop transitions, 46 changer transitions 0/356 dead transitions. [2023-11-10 11:59:19,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 356 transitions, 1198 flow [2023-11-10 11:59:19,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:59:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:59:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1655 transitions. [2023-11-10 11:59:19,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7598714416896235 [2023-11-10 11:59:19,608 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1655 transitions. [2023-11-10 11:59:19,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1655 transitions. [2023-11-10 11:59:19,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:59:19,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1655 transitions. [2023-11-10 11:59:19,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 183.88888888888889) internal successors, (1655), 9 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:19,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:19,616 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:19,616 INFO L175 Difference]: Start difference. First operand has 202 places, 200 transitions, 427 flow. Second operand 9 states and 1655 transitions. [2023-11-10 11:59:19,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 356 transitions, 1198 flow [2023-11-10 11:59:19,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 356 transitions, 1198 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:59:19,748 INFO L231 Difference]: Finished difference. Result has 218 places, 243 transitions, 795 flow [2023-11-10 11:59:19,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=795, PETRI_PLACES=218, PETRI_TRANSITIONS=243} [2023-11-10 11:59:19,749 INFO L281 CegarLoopForPetriNet]: 205 programPoint places, 13 predicate places. [2023-11-10 11:59:19,750 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 243 transitions, 795 flow [2023-11-10 11:59:19,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 162.4) internal successors, (812), 5 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:19,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:59:19,750 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-11-10 11:59:19,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-10 11:59:19,751 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-10 11:59:19,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:59:19,751 INFO L85 PathProgramCache]: Analyzing trace with hash 408942001, now seen corresponding path program 1 times [2023-11-10 11:59:19,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:59:19,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61900956] [2023-11-10 11:59:19,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:59:19,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:59:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:59:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-10 11:59:19,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:59:19,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61900956] [2023-11-10 11:59:19,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61900956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:59:19,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:59:19,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-10 11:59:19,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191661434] [2023-11-10 11:59:19,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:59:19,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-10 11:59:19,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:59:19,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-10 11:59:19,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-10 11:59:19,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 242 [2023-11-10 11:59:19,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 243 transitions, 795 flow. Second operand has 5 states, 5 states have (on average 162.6) internal successors, (813), 5 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:19,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:59:19,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 242 [2023-11-10 11:59:19,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:59:31,286 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([956] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][307], [Black: 211#true, Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 235#(= ~x~0 0), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 213#(= ~x~0 0), t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 69#L716-5true, 208#true, 89#L702-7true]) [2023-11-10 11:59:31,286 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2023-11-10 11:59:31,286 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-10 11:59:31,286 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-10 11:59:31,286 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-10 11:59:31,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([956] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][396], [Black: 211#true, Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 213#(= ~x~0 0), t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, 239#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), t_funThread3of3ForFork0NotInUse, 69#L716-5true, 208#true, 168#L702-3true]) [2023-11-10 11:59:31,328 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-10 11:59:31,328 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-10 11:59:31,328 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-10 11:59:31,329 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-10 11:59:31,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([956] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][396], [Black: 211#true, Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 213#(= ~x~0 0), t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, 239#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), t_funThread3of3ForFork0NotInUse, 146#L691true, 69#L716-5true, 208#true]) [2023-11-10 11:59:31,376 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-10 11:59:31,376 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-10 11:59:31,376 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-10 11:59:31,376 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-10 11:59:31,426 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([956] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][395], [Black: 211#true, Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 213#(= ~x~0 0), t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 87#L691-1true, 69#L716-5true, 208#true, 241#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0)))]) [2023-11-10 11:59:31,426 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-10 11:59:31,426 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-10 11:59:31,427 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-10 11:59:31,427 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-10 11:59:31,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([957] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][367], [Black: 211#true, Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 235#(= ~x~0 0), Black: 213#(= ~x~0 0), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 69#L716-5true, 208#true, 13#L702-3true]) [2023-11-10 11:59:31,465 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-10 11:59:31,465 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-10 11:59:31,465 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-10 11:59:31,465 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-10 11:59:31,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([957] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][367], [Black: 211#true, Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 235#(= ~x~0 0), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 213#(= ~x~0 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 69#L716-5true, 208#true, 188#L702-7true]) [2023-11-10 11:59:31,465 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2023-11-10 11:59:31,465 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-10 11:59:31,465 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-10 11:59:31,465 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-10 11:59:31,474 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([956] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][395], [Black: 211#true, Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 213#(= ~x~0 0), t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 69#L716-5true, 208#true, 241#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), 55#L691-5true]) [2023-11-10 11:59:31,474 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-10 11:59:31,474 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-10 11:59:31,474 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-10 11:59:31,474 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-10 11:59:31,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([956] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][396], [Black: 211#true, Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), 70#L702-4true, Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 213#(= ~x~0 0), t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, 239#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), t_funThread3of3ForFork0NotInUse, 69#L716-5true, 208#true]) [2023-11-10 11:59:31,514 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-10 11:59:31,514 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-10 11:59:31,514 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-10 11:59:31,514 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-10 11:59:31,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([956] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][307], [Black: 211#true, Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 235#(= ~x~0 0), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 213#(= ~x~0 0), t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 69#L716-5true, 208#true, 74#L702-5true]) [2023-11-10 11:59:31,547 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-10 11:59:31,547 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-10 11:59:31,547 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-10 11:59:31,547 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-10 11:59:31,889 INFO L124 PetriNetUnfolderBase]: 36653/116205 cut-off events. [2023-11-10 11:59:31,889 INFO L125 PetriNetUnfolderBase]: For 93571/94954 co-relation queries the response was YES. [2023-11-10 11:59:32,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235323 conditions, 116205 events. 36653/116205 cut-off events. For 93571/94954 co-relation queries the response was YES. Maximal size of possible extension queue 4764. Compared 1802188 event pairs, 13468 based on Foata normal form. 629/111891 useless extension candidates. Maximal degree in co-relation 235309. Up to 24219 conditions per place. [2023-11-10 11:59:32,994 INFO L140 encePairwiseOnDemand]: 224/242 looper letters, 147 selfloop transitions, 107 changer transitions 0/424 dead transitions. [2023-11-10 11:59:32,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 424 transitions, 2130 flow [2023-11-10 11:59:32,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:59:32,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:59:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1644 transitions. [2023-11-10 11:59:32,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7548209366391184 [2023-11-10 11:59:32,998 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1644 transitions. [2023-11-10 11:59:32,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1644 transitions. [2023-11-10 11:59:32,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:59:32,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1644 transitions. [2023-11-10 11:59:33,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 182.66666666666666) internal successors, (1644), 9 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:33,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:33,004 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:33,004 INFO L175 Difference]: Start difference. First operand has 218 places, 243 transitions, 795 flow. Second operand 9 states and 1644 transitions. [2023-11-10 11:59:33,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 424 transitions, 2130 flow [2023-11-10 11:59:33,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 424 transitions, 2130 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:59:33,637 INFO L231 Difference]: Finished difference. Result has 232 places, 314 transitions, 1589 flow [2023-11-10 11:59:33,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1589, PETRI_PLACES=232, PETRI_TRANSITIONS=314} [2023-11-10 11:59:33,639 INFO L281 CegarLoopForPetriNet]: 205 programPoint places, 27 predicate places. [2023-11-10 11:59:33,639 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 314 transitions, 1589 flow [2023-11-10 11:59:33,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 162.6) internal successors, (813), 5 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:33,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:59:33,640 INFO L208 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] [2023-11-10 11:59:33,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-10 11:59:33,640 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-10 11:59:33,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:59:33,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1704165329, now seen corresponding path program 1 times [2023-11-10 11:59:33,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:59:33,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010250109] [2023-11-10 11:59:33,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:59:33,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:59:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:59:33,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:59:33,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:59:33,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010250109] [2023-11-10 11:59:33,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010250109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:59:33,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:59:33,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 11:59:33,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592981557] [2023-11-10 11:59:33,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:59:33,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:59:33,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:59:33,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:59:33,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:59:33,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 242 [2023-11-10 11:59:33,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 314 transitions, 1589 flow. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:33,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:59:33,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 242 [2023-11-10 11:59:33,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:59:37,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([957] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [Black: 211#true, Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 235#(= ~x~0 0), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 213#(= ~x~0 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 69#L716-5true, 253#true, 208#true, Black: 236#(not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 241#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), 13#L702-3true, Black: 233#true, Black: 243#(and (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 239#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2023-11-10 11:59:37,226 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-10 11:59:37,227 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-10 11:59:37,227 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-10 11:59:37,227 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-10 11:59:37,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([957] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [Black: 211#true, Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 235#(= ~x~0 0), Black: 213#(= ~x~0 0), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 69#L716-5true, 253#true, 208#true, Black: 236#(not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 241#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 233#true, 64#L691-5true, Black: 243#(and (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 239#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)))]) [2023-11-10 11:59:37,279 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-10 11:59:37,279 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-10 11:59:37,279 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-10 11:59:37,279 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-10 11:59:37,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([957] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [Black: 211#true, Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 235#(= ~x~0 0), 189#L702-4true, Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 213#(= ~x~0 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 69#L716-5true, 253#true, 208#true, Black: 236#(not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 241#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 233#true, Black: 243#(and (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 239#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2023-11-10 11:59:37,292 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-10 11:59:37,292 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-10 11:59:37,292 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-10 11:59:37,292 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-10 11:59:37,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([956] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][224], [Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#(= ~x~0 0), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 69#L716-5true, 253#true, 211#true, 208#true, 236#(not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 235#(= ~x~0 0), Black: 241#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), 168#L702-3true, Black: 233#true, Black: 243#(and (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 239#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2023-11-10 11:59:37,314 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-10 11:59:37,314 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-10 11:59:37,314 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-10 11:59:37,314 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-10 11:59:37,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([957] t_funEXIT-->L716-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][270], [Black: 211#true, Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 213#(= ~x~0 0), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), 233#true, Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 94#L691-1true, 69#L716-5true, 253#true, 208#true, Black: 235#(= ~x~0 0), Black: 236#(not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 241#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 243#(and (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 239#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2023-11-10 11:59:37,325 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2023-11-10 11:59:37,325 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-10 11:59:37,325 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-10 11:59:37,325 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-10 11:59:37,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([956] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][224], [Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#(= ~x~0 0), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), 243#(and (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 87#L691-1true, 69#L716-5true, 253#true, 211#true, 208#true, Black: 235#(= ~x~0 0), Black: 236#(not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 241#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 233#true, Black: 239#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2023-11-10 11:59:37,330 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2023-11-10 11:59:37,330 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-10 11:59:37,330 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-10 11:59:37,330 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-10 11:59:37,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([956] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][224], [Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 213#(= ~x~0 0), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 70#L702-4true, t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 211#true, 69#L716-5true, 253#true, 208#true, 236#(not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 235#(= ~x~0 0), Black: 241#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 233#true, Black: 243#(and (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 239#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2023-11-10 11:59:37,354 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-10 11:59:37,354 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-10 11:59:37,354 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-10 11:59:37,354 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-10 11:59:37,356 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([956] t_funEXIT-->L716-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_12|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][224], [Black: 211#true, Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 235#(= ~x~0 0), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 213#(= ~x~0 0), t_funThread1of3ForFork0NotInUse, t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 69#L716-5true, 253#true, 208#true, Black: 236#(not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 241#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 233#true, Black: 243#(and (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 239#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2023-11-10 11:59:37,357 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-10 11:59:37,357 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-10 11:59:37,357 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-10 11:59:37,357 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-10 11:59:37,372 INFO L124 PetriNetUnfolderBase]: 4271/30094 cut-off events. [2023-11-10 11:59:37,372 INFO L125 PetriNetUnfolderBase]: For 23935/25739 co-relation queries the response was YES. [2023-11-10 11:59:37,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54680 conditions, 30094 events. 4271/30094 cut-off events. For 23935/25739 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 458858 event pairs, 1588 based on Foata normal form. 79/28707 useless extension candidates. Maximal degree in co-relation 54660. Up to 3825 conditions per place. [2023-11-10 11:59:37,659 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 17 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2023-11-10 11:59:37,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 318 transitions, 1635 flow [2023-11-10 11:59:37,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:59:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:59:37,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 575 transitions. [2023-11-10 11:59:37,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7920110192837465 [2023-11-10 11:59:37,661 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 575 transitions. [2023-11-10 11:59:37,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 575 transitions. [2023-11-10 11:59:37,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:59:37,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 575 transitions. [2023-11-10 11:59:37,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:37,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:37,664 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:37,664 INFO L175 Difference]: Start difference. First operand has 232 places, 314 transitions, 1589 flow. Second operand 3 states and 575 transitions. [2023-11-10 11:59:37,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 318 transitions, 1635 flow [2023-11-10 11:59:37,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 318 transitions, 1635 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:59:37,770 INFO L231 Difference]: Finished difference. Result has 235 places, 315 transitions, 1601 flow [2023-11-10 11:59:37,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1601, PETRI_PLACES=235, PETRI_TRANSITIONS=315} [2023-11-10 11:59:37,770 INFO L281 CegarLoopForPetriNet]: 205 programPoint places, 30 predicate places. [2023-11-10 11:59:37,771 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 315 transitions, 1601 flow [2023-11-10 11:59:37,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:37,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:59:37,771 INFO L208 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] [2023-11-10 11:59:37,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-10 11:59:37,771 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-10 11:59:37,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:59:37,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1103995109, now seen corresponding path program 1 times [2023-11-10 11:59:37,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:59:37,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726203775] [2023-11-10 11:59:37,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:59:37,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:59:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:59:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:59:37,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:59:37,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726203775] [2023-11-10 11:59:37,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726203775] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:59:37,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950915563] [2023-11-10 11:59:37,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:59:37,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:59:37,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:59:37,821 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-11-10 11:59:37,868 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-11-10 11:59:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:59:37,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-10 11:59:37,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:59:37,951 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-10 11:59:37,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 11:59:37,961 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-10 11:59:37,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950915563] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:59:37,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-10 11:59:37,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-10 11:59:37,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294975486] [2023-11-10 11:59:37,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:59:37,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:59:37,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:59:37,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:59:37,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:59:37,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 242 [2023-11-10 11:59:37,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 315 transitions, 1601 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:59:37,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:59:37,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 242 [2023-11-10 11:59:37,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:59:58,968 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([944] L702-5-->L702-6: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#__global_lock~0.base_18| (store (select |v_#pthreadsMutex_30| |v_~#__global_lock~0.base_18|) |v_~#__global_lock~0.offset_18| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_18|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_18|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_18|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_18|} AuxVars[] AssignedVars[#pthreadsMutex][178], [Black: 255#(= |ULTIMATE.start_main_~i~0#1| 0), 113#L706-17true, 213#(= ~x~0 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 208#true, 258#true, Black: 211#true, Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 235#(= ~x~0 0), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 253#true, 25#L702-6true, Black: 236#(not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 35#L702-1true, 31#L716true, Black: 241#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 233#true, Black: 243#(and (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 239#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2023-11-10 11:59:58,968 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-10 11:59:58,968 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-10 11:59:58,968 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-10 11:59:58,968 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-10 12:00:01,658 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([944] L702-5-->L702-6: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#__global_lock~0.base_18| (store (select |v_#pthreadsMutex_30| |v_~#__global_lock~0.base_18|) |v_~#__global_lock~0.offset_18| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_18|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_18|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_18|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_18|} AuxVars[] AssignedVars[#pthreadsMutex][61], [Black: 255#(= |ULTIMATE.start_main_~i~0#1| 0), 213#(= ~x~0 0), t_funThread1of3ForFork0InUse, 66#L706-1true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 208#true, 258#true, Black: 211#true, Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 235#(= ~x~0 0), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 253#true, 25#L702-6true, Black: 236#(not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 35#L702-1true, 31#L716true, Black: 241#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 233#true, Black: 243#(and (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 239#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2023-11-10 12:00:01,658 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2023-11-10 12:00:01,658 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-10 12:00:01,659 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-10 12:00:01,659 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-10 12:00:13,069 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([944] L702-5-->L702-6: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#__global_lock~0.base_18| (store (select |v_#pthreadsMutex_30| |v_~#__global_lock~0.base_18|) |v_~#__global_lock~0.offset_18| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_18|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_18|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_18|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_18|} AuxVars[] AssignedVars[#pthreadsMutex][61], [Black: 255#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L702-6true, 213#(= ~x~0 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 208#true, 258#true, Black: 211#true, Black: 214#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 235#(= ~x~0 0), Black: 221#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 215#(not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 219#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 223#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 217#(and (= ~x~0 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0))), 253#true, 25#L702-6true, Black: 236#(not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)), 35#L702-1true, Black: 241#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), 31#L716true, Black: 233#true, Black: 243#(and (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 239#(and (= ~x~0 0) (not (= |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2023-11-10 12:00:13,069 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2023-11-10 12:00:13,069 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-10 12:00:13,069 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-10 12:00:13,069 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event