/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure3.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 20:27:02,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 20:27:02,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 20:27:02,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 20:27:02,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 20:27:02,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 20:27:02,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 20:27:02,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 20:27:02,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 20:27:02,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 20:27:02,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 20:27:02,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 20:27:02,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 20:27:02,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 20:27:02,388 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 20:27:02,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 20:27:02,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 20:27:02,389 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 20:27:02,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 20:27:02,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 20:27:02,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 20:27:02,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 20:27:02,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 20:27:02,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 20:27:02,390 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 20:27:02,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 20:27:02,391 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 20:27:02,392 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 20:27:02,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 20:27:02,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 20:27:02,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 20:27:02,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 20:27:02,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 20:27:02,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 20:27:02,394 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 20:27:02,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 20:27:02,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 20:27:02,394 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 20:27:02,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 20:27:02,394 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 20:27:02,394 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 20:27:02,395 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> TOGETHER [2023-08-03 20:27:02,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 20:27:02,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 20:27:02,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 20:27:02,633 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 20:27:02,634 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 20:27:02,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure3.wvr_bound2.c [2023-08-03 20:27:03,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 20:27:03,956 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 20:27:03,957 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure3.wvr_bound2.c [2023-08-03 20:27:03,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1076165/c936e90d50cd4f989448736aa1fed94f/FLAG7e78c9dbf [2023-08-03 20:27:03,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1076165/c936e90d50cd4f989448736aa1fed94f [2023-08-03 20:27:03,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 20:27:03,992 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 20:27:03,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 20:27:03,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 20:27:03,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 20:27:03,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 08:27:03" (1/1) ... [2023-08-03 20:27:03,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@658996cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:27:03, skipping insertion in model container [2023-08-03 20:27:03,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 08:27:03" (1/1) ... [2023-08-03 20:27:04,023 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 20:27:04,176 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure3.wvr_bound2.c[2283,2296] [2023-08-03 20:27:04,178 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 20:27:04,187 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 20:27:04,204 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure3.wvr_bound2.c[2283,2296] [2023-08-03 20:27:04,205 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 20:27:04,211 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 20:27:04,211 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 20:27:04,217 INFO L206 MainTranslator]: Completed translation [2023-08-03 20:27:04,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:27:04 WrapperNode [2023-08-03 20:27:04,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 20:27:04,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 20:27:04,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 20:27:04,219 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 20:27:04,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:27:04" (1/1) ... [2023-08-03 20:27:04,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:27:04" (1/1) ... [2023-08-03 20:27:04,247 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 106 [2023-08-03 20:27:04,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 20:27:04,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 20:27:04,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 20:27:04,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 20:27:04,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:27:04" (1/1) ... [2023-08-03 20:27:04,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:27:04" (1/1) ... [2023-08-03 20:27:04,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:27:04" (1/1) ... [2023-08-03 20:27:04,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:27:04" (1/1) ... [2023-08-03 20:27:04,263 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:27:04" (1/1) ... [2023-08-03 20:27:04,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:27:04" (1/1) ... [2023-08-03 20:27:04,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:27:04" (1/1) ... [2023-08-03 20:27:04,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:27:04" (1/1) ... [2023-08-03 20:27:04,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 20:27:04,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 20:27:04,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 20:27:04,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 20:27:04,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:27:04" (1/1) ... [2023-08-03 20:27:04,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 20:27:04,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:27:04,300 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-08-03 20:27:04,312 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-08-03 20:27:04,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 20:27:04,341 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-03 20:27:04,341 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-03 20:27:04,341 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-03 20:27:04,341 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-03 20:27:04,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 20:27:04,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 20:27:04,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 20:27:04,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 20:27:04,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 20:27:04,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 20:27:04,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 20:27:04,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 20:27:04,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 20:27:04,346 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 20:27:04,457 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 20:27:04,459 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 20:27:04,619 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 20:27:04,642 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 20:27:04,643 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-03 20:27:04,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 08:27:04 BoogieIcfgContainer [2023-08-03 20:27:04,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 20:27:04,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 20:27:04,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 20:27:04,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 20:27:04,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 08:27:03" (1/3) ... [2023-08-03 20:27:04,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70675724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 08:27:04, skipping insertion in model container [2023-08-03 20:27:04,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:27:04" (2/3) ... [2023-08-03 20:27:04,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70675724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 08:27:04, skipping insertion in model container [2023-08-03 20:27:04,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 08:27:04" (3/3) ... [2023-08-03 20:27:04,652 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_popl20-figure3.wvr_bound2.c [2023-08-03 20:27:04,658 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 20:27:04,666 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 20:27:04,667 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-03 20:27:04,667 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 20:27:04,739 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-03 20:27:04,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 112 transitions, 246 flow [2023-08-03 20:27:04,870 INFO L124 PetriNetUnfolderBase]: 33/252 cut-off events. [2023-08-03 20:27:04,870 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 20:27:04,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 252 events. 33/252 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 849 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 137. Up to 8 conditions per place. [2023-08-03 20:27:04,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 112 transitions, 246 flow [2023-08-03 20:27:04,904 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 112 transitions, 246 flow [2023-08-03 20:27:04,907 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 20:27:04,914 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 112 transitions, 246 flow [2023-08-03 20:27:04,917 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 112 transitions, 246 flow [2023-08-03 20:27:04,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 112 transitions, 246 flow [2023-08-03 20:27:04,954 INFO L124 PetriNetUnfolderBase]: 33/252 cut-off events. [2023-08-03 20:27:04,954 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 20:27:04,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 252 events. 33/252 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 849 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 137. Up to 8 conditions per place. [2023-08-03 20:27:04,959 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2023-08-03 20:27:07,125 INFO L134 LiptonReduction]: Checked pairs total: 2943 [2023-08-03 20:27:07,126 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-03 20:27:07,139 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 20:27:07,144 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@7c084b2e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 20:27:07,144 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 20:27:07,148 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 20:27:07,148 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-03 20:27:07,148 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 20:27:07,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:07,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 20:27:07,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:07,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:07,154 INFO L85 PathProgramCache]: Analyzing trace with hash 425187087, now seen corresponding path program 1 times [2023-08-03 20:27:07,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:07,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570281112] [2023-08-03 20:27:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:07,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:07,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:27:07,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:07,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570281112] [2023-08-03 20:27:07,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570281112] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:27:07,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:27:07,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 20:27:07,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071220596] [2023-08-03 20:27:07,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:07,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:27:07,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:07,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:27:07,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 20:27:07,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 208 [2023-08-03 20:27:07,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 30 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:07,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:07,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 208 [2023-08-03 20:27:07,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:07,478 INFO L124 PetriNetUnfolderBase]: 260/419 cut-off events. [2023-08-03 20:27:07,478 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-03 20:27:07,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 419 events. 260/419 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1593 event pairs, 119 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 692. Up to 390 conditions per place. [2023-08-03 20:27:07,485 INFO L140 encePairwiseOnDemand]: 204/208 looper letters, 24 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-08-03 20:27:07,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 32 transitions, 138 flow [2023-08-03 20:27:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:27:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:27:07,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-08-03 20:27:07,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2023-08-03 20:27:07,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-08-03 20:27:07,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-08-03 20:27:07,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:07,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-08-03 20:27:07,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:07,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:07,521 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:07,522 INFO L175 Difference]: Start difference. First operand has 29 places, 30 transitions, 82 flow. Second operand 3 states and 304 transitions. [2023-08-03 20:27:07,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 32 transitions, 138 flow [2023-08-03 20:27:07,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 20:27:07,527 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 88 flow [2023-08-03 20:27:07,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2023-08-03 20:27:07,534 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2023-08-03 20:27:07,534 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 88 flow [2023-08-03 20:27:07,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:07,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:07,535 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 20:27:07,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 20:27:07,536 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:07,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:07,537 INFO L85 PathProgramCache]: Analyzing trace with hash 325807919, now seen corresponding path program 1 times [2023-08-03 20:27:07,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:07,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174376889] [2023-08-03 20:27:07,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:07,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 20:27:07,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 20:27:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 20:27:07,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 20:27:07,628 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 20:27:07,630 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-03 20:27:07,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-03 20:27:07,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-03 20:27:07,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 20:27:07,634 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 20:27:07,635 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 20:27:07,635 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 20:27:07,654 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-03 20:27:07,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 138 transitions, 324 flow [2023-08-03 20:27:07,735 INFO L124 PetriNetUnfolderBase]: 134/827 cut-off events. [2023-08-03 20:27:07,735 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-03 20:27:07,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 827 events. 134/827 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4248 event pairs, 1 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 488. Up to 32 conditions per place. [2023-08-03 20:27:07,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 138 transitions, 324 flow [2023-08-03 20:27:07,745 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 138 transitions, 324 flow [2023-08-03 20:27:07,745 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 20:27:07,745 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 138 transitions, 324 flow [2023-08-03 20:27:07,745 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 138 transitions, 324 flow [2023-08-03 20:27:07,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 138 transitions, 324 flow [2023-08-03 20:27:07,824 INFO L124 PetriNetUnfolderBase]: 134/827 cut-off events. [2023-08-03 20:27:07,824 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-03 20:27:07,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 827 events. 134/827 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4248 event pairs, 1 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 488. Up to 32 conditions per place. [2023-08-03 20:27:07,841 INFO L119 LiptonReduction]: Number of co-enabled transitions 6000 [2023-08-03 20:27:10,026 INFO L134 LiptonReduction]: Checked pairs total: 8679 [2023-08-03 20:27:10,027 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-03 20:27:10,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 20:27:10,030 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@7c084b2e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 20:27:10,030 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 20:27:10,032 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 20:27:10,032 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2023-08-03 20:27:10,032 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 20:27:10,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:10,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 20:27:10,033 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:10,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:10,033 INFO L85 PathProgramCache]: Analyzing trace with hash 684547403, now seen corresponding path program 1 times [2023-08-03 20:27:10,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:10,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512423007] [2023-08-03 20:27:10,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:10,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:27:10,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:10,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512423007] [2023-08-03 20:27:10,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512423007] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:27:10,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:27:10,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 20:27:10,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12550759] [2023-08-03 20:27:10,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:10,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:27:10,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:10,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:27:10,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 20:27:10,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 248 [2023-08-03 20:27:10,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:10,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:10,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 248 [2023-08-03 20:27:10,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:10,908 INFO L124 PetriNetUnfolderBase]: 8526/11037 cut-off events. [2023-08-03 20:27:10,908 INFO L125 PetriNetUnfolderBase]: For 1040/1040 co-relation queries the response was YES. [2023-08-03 20:27:10,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22380 conditions, 11037 events. 8526/11037 cut-off events. For 1040/1040 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 47483 event pairs, 3472 based on Foata normal form. 0/6248 useless extension candidates. Maximal degree in co-relation 6836. Up to 10600 conditions per place. [2023-08-03 20:27:10,977 INFO L140 encePairwiseOnDemand]: 244/248 looper letters, 35 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-03 20:27:10,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 216 flow [2023-08-03 20:27:10,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:27:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:27:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-08-03 20:27:10,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49193548387096775 [2023-08-03 20:27:10,979 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-08-03 20:27:10,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-08-03 20:27:10,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:10,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-08-03 20:27:10,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:10,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:10,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:10,988 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 136 flow. Second operand 3 states and 366 transitions. [2023-08-03 20:27:10,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 216 flow [2023-08-03 20:27:10,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 20:27:10,992 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 146 flow [2023-08-03 20:27:10,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2023-08-03 20:27:10,993 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-03 20:27:10,993 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 146 flow [2023-08-03 20:27:10,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:10,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:10,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:10,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 20:27:10,994 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:10,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1278214390, now seen corresponding path program 1 times [2023-08-03 20:27:10,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:10,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266779159] [2023-08-03 20:27:10,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:10,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:27:11,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:11,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266779159] [2023-08-03 20:27:11,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266779159] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:11,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835427434] [2023-08-03 20:27:11,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:11,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:11,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:27:11,074 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-08-03 20:27:11,094 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-08-03 20:27:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:11,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 20:27:11,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:27:11,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 20:27:11,152 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:27:11,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835427434] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:27:11,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:27:11,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 20:27:11,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727633175] [2023-08-03 20:27:11,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:11,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:27:11,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:11,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:27:11,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:27:11,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 248 [2023-08-03 20:27:11,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:11,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:11,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 248 [2023-08-03 20:27:11,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:11,852 INFO L124 PetriNetUnfolderBase]: 8488/11053 cut-off events. [2023-08-03 20:27:11,852 INFO L125 PetriNetUnfolderBase]: For 898/898 co-relation queries the response was YES. [2023-08-03 20:27:11,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22377 conditions, 11053 events. 8488/11053 cut-off events. For 898/898 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 49848 event pairs, 3438 based on Foata normal form. 0/6301 useless extension candidates. Maximal degree in co-relation 22347. Up to 10389 conditions per place. [2023-08-03 20:27:11,921 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 40 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-03 20:27:11,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 246 flow [2023-08-03 20:27:11,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:27:11,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:27:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-08-03 20:27:11,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959677419354839 [2023-08-03 20:27:11,923 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-08-03 20:27:11,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-08-03 20:27:11,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:11,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-08-03 20:27:11,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:11,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:11,926 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:11,926 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 146 flow. Second operand 3 states and 369 transitions. [2023-08-03 20:27:11,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 246 flow [2023-08-03 20:27:11,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 20:27:11,929 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 156 flow [2023-08-03 20:27:11,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2023-08-03 20:27:11,930 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-03 20:27:11,930 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 156 flow [2023-08-03 20:27:11,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:11,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:11,931 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 20:27:11,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-03 20:27:12,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:12,136 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:12,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:12,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1130901059, now seen corresponding path program 1 times [2023-08-03 20:27:12,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:12,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67258725] [2023-08-03 20:27:12,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:12,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:27:12,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:12,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67258725] [2023-08-03 20:27:12,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67258725] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:12,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893825470] [2023-08-03 20:27:12,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:12,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:12,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:27:12,197 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:27:12,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 20:27:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:12,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 20:27:12,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:27:12,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:27:12,303 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:27:12,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893825470] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:27:12,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:27:12,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 20:27:12,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552381345] [2023-08-03 20:27:12,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:12,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:27:12,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:12,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:27:12,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 20:27:12,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 248 [2023-08-03 20:27:12,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:12,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:12,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 248 [2023-08-03 20:27:12,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:12,993 INFO L124 PetriNetUnfolderBase]: 8464/11017 cut-off events. [2023-08-03 20:27:12,993 INFO L125 PetriNetUnfolderBase]: For 1131/1131 co-relation queries the response was YES. [2023-08-03 20:27:13,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22577 conditions, 11017 events. 8464/11017 cut-off events. For 1131/1131 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 49428 event pairs, 2427 based on Foata normal form. 9/6430 useless extension candidates. Maximal degree in co-relation 6914. Up to 10492 conditions per place. [2023-08-03 20:27:13,061 INFO L140 encePairwiseOnDemand]: 244/248 looper letters, 39 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-08-03 20:27:13,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 257 flow [2023-08-03 20:27:13,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:27:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:27:13,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2023-08-03 20:27:13,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47016129032258064 [2023-08-03 20:27:13,063 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 583 transitions. [2023-08-03 20:27:13,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 583 transitions. [2023-08-03 20:27:13,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:13,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 583 transitions. [2023-08-03 20:27:13,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:13,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:13,068 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:13,068 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 156 flow. Second operand 5 states and 583 transitions. [2023-08-03 20:27:13,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 257 flow [2023-08-03 20:27:13,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 248 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 20:27:13,072 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 165 flow [2023-08-03 20:27:13,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2023-08-03 20:27:13,072 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-08-03 20:27:13,073 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 165 flow [2023-08-03 20:27:13,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:13,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:13,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:13,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-03 20:27:13,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:13,279 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:13,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:13,280 INFO L85 PathProgramCache]: Analyzing trace with hash -497141764, now seen corresponding path program 1 times [2023-08-03 20:27:13,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:13,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867255437] [2023-08-03 20:27:13,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:13,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 20:27:13,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:13,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867255437] [2023-08-03 20:27:13,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867255437] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:13,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11200924] [2023-08-03 20:27:13,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:13,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:13,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:27:13,362 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:27:13,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 20:27:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:13,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 20:27:13,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:27:13,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 20:27:13,433 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:27:13,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11200924] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:27:13,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:27:13,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 20:27:13,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538141576] [2023-08-03 20:27:13,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:13,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:27:13,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:13,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:27:13,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:27:13,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 248 [2023-08-03 20:27:13,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:13,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:13,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 248 [2023-08-03 20:27:13,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:14,068 INFO L124 PetriNetUnfolderBase]: 7233/9555 cut-off events. [2023-08-03 20:27:14,068 INFO L125 PetriNetUnfolderBase]: For 775/775 co-relation queries the response was YES. [2023-08-03 20:27:14,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19560 conditions, 9555 events. 7233/9555 cut-off events. For 775/775 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 43655 event pairs, 2468 based on Foata normal form. 0/5681 useless extension candidates. Maximal degree in co-relation 6706. Up to 6763 conditions per place. [2023-08-03 20:27:14,108 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 48 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-03 20:27:14,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 303 flow [2023-08-03 20:27:14,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:27:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:27:14,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-03 20:27:14,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040322580645161 [2023-08-03 20:27:14,110 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-03 20:27:14,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-03 20:27:14,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:14,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-03 20:27:14,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:14,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:14,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:14,113 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 165 flow. Second operand 3 states and 375 transitions. [2023-08-03 20:27:14,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 303 flow [2023-08-03 20:27:14,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 296 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 20:27:14,115 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 170 flow [2023-08-03 20:27:14,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2023-08-03 20:27:14,116 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-08-03 20:27:14,116 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 170 flow [2023-08-03 20:27:14,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:14,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:14,117 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:14,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-03 20:27:14,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:14,322 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:14,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:14,323 INFO L85 PathProgramCache]: Analyzing trace with hash -797679345, now seen corresponding path program 1 times [2023-08-03 20:27:14,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:14,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084483549] [2023-08-03 20:27:14,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:14,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:14,394 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:27:14,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:14,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084483549] [2023-08-03 20:27:14,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084483549] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:14,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248236512] [2023-08-03 20:27:14,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:14,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:14,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:27:14,407 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:27:14,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-03 20:27:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:14,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 20:27:14,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:27:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:27:14,480 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:27:14,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:27:14,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248236512] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:27:14,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:27:14,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 20:27:14,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681359958] [2023-08-03 20:27:14,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:27:14,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:27:14,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:14,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:27:14,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:27:14,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 248 [2023-08-03 20:27:14,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:14,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:14,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 248 [2023-08-03 20:27:14,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:15,100 INFO L124 PetriNetUnfolderBase]: 6552/8619 cut-off events. [2023-08-03 20:27:15,101 INFO L125 PetriNetUnfolderBase]: For 1300/1300 co-relation queries the response was YES. [2023-08-03 20:27:15,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18203 conditions, 8619 events. 6552/8619 cut-off events. For 1300/1300 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 38291 event pairs, 1930 based on Foata normal form. 3/5259 useless extension candidates. Maximal degree in co-relation 5227. Up to 8209 conditions per place. [2023-08-03 20:27:15,138 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 40 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2023-08-03 20:27:15,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 264 flow [2023-08-03 20:27:15,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:27:15,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:27:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 474 transitions. [2023-08-03 20:27:15,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4778225806451613 [2023-08-03 20:27:15,141 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 474 transitions. [2023-08-03 20:27:15,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 474 transitions. [2023-08-03 20:27:15,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:15,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 474 transitions. [2023-08-03 20:27:15,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:15,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:15,145 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:15,145 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 170 flow. Second operand 4 states and 474 transitions. [2023-08-03 20:27:15,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 264 flow [2023-08-03 20:27:15,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 20:27:15,151 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 166 flow [2023-08-03 20:27:15,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2023-08-03 20:27:15,153 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2023-08-03 20:27:15,153 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 166 flow [2023-08-03 20:27:15,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:15,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:15,154 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:15,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-03 20:27:15,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:15,359 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:15,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:15,360 INFO L85 PathProgramCache]: Analyzing trace with hash 144395151, now seen corresponding path program 1 times [2023-08-03 20:27:15,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:15,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993873574] [2023-08-03 20:27:15,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:15,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:15,439 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 20:27:15,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:15,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993873574] [2023-08-03 20:27:15,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993873574] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:15,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840784314] [2023-08-03 20:27:15,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:15,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:15,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:27:15,442 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:27:15,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-03 20:27:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:15,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 20:27:15,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:27:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 20:27:15,535 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:27:15,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840784314] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:27:15,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:27:15,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 20:27:15,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154877047] [2023-08-03 20:27:15,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:15,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:27:15,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:15,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:27:15,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 20:27:15,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 248 [2023-08-03 20:27:15,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:15,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:15,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 248 [2023-08-03 20:27:15,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:16,084 INFO L124 PetriNetUnfolderBase]: 6120/8058 cut-off events. [2023-08-03 20:27:16,084 INFO L125 PetriNetUnfolderBase]: For 928/928 co-relation queries the response was YES. [2023-08-03 20:27:16,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16949 conditions, 8058 events. 6120/8058 cut-off events. For 928/928 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 35751 event pairs, 400 based on Foata normal form. 81/4992 useless extension candidates. Maximal degree in co-relation 7285. Up to 6966 conditions per place. [2023-08-03 20:27:16,127 INFO L140 encePairwiseOnDemand]: 244/248 looper letters, 52 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2023-08-03 20:27:16,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 316 flow [2023-08-03 20:27:16,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:27:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:27:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2023-08-03 20:27:16,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4798387096774194 [2023-08-03 20:27:16,129 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 595 transitions. [2023-08-03 20:27:16,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 595 transitions. [2023-08-03 20:27:16,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:16,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 595 transitions. [2023-08-03 20:27:16,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:16,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:16,133 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:16,133 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 166 flow. Second operand 5 states and 595 transitions. [2023-08-03 20:27:16,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 316 flow [2023-08-03 20:27:16,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 304 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-03 20:27:16,139 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 171 flow [2023-08-03 20:27:16,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2023-08-03 20:27:16,140 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2023-08-03 20:27:16,140 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 171 flow [2023-08-03 20:27:16,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:16,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:16,141 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:16,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-03 20:27:16,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:16,347 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:16,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:16,347 INFO L85 PathProgramCache]: Analyzing trace with hash -265751687, now seen corresponding path program 1 times [2023-08-03 20:27:16,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:16,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901668925] [2023-08-03 20:27:16,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:16,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-03 20:27:16,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:16,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901668925] [2023-08-03 20:27:16,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901668925] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:16,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404509300] [2023-08-03 20:27:16,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:16,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:16,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:27:16,387 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:27:16,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-03 20:27:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:16,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 20:27:16,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:27:16,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:27:16,461 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:27:16,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404509300] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:27:16,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:27:16,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-03 20:27:16,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690097955] [2023-08-03 20:27:16,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:16,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:27:16,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:16,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:27:16,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:27:16,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 248 [2023-08-03 20:27:16,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:16,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:16,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 248 [2023-08-03 20:27:16,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:16,881 INFO L124 PetriNetUnfolderBase]: 5997/8008 cut-off events. [2023-08-03 20:27:16,881 INFO L125 PetriNetUnfolderBase]: For 1520/1520 co-relation queries the response was YES. [2023-08-03 20:27:16,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17005 conditions, 8008 events. 5997/8008 cut-off events. For 1520/1520 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 36566 event pairs, 2243 based on Foata normal form. 0/5017 useless extension candidates. Maximal degree in co-relation 7491. Up to 5805 conditions per place. [2023-08-03 20:27:16,910 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 49 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-03 20:27:16,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 309 flow [2023-08-03 20:27:16,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:27:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:27:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-03 20:27:16,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040322580645161 [2023-08-03 20:27:16,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-03 20:27:16,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-03 20:27:16,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:16,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-03 20:27:16,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:16,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:16,914 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:16,914 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 171 flow. Second operand 3 states and 375 transitions. [2023-08-03 20:27:16,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 309 flow [2023-08-03 20:27:16,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 302 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 20:27:16,918 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 176 flow [2023-08-03 20:27:16,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-08-03 20:27:16,919 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2023-08-03 20:27:16,919 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 176 flow [2023-08-03 20:27:16,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:16,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:16,919 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:16,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-03 20:27:17,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:17,125 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:17,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:17,126 INFO L85 PathProgramCache]: Analyzing trace with hash -303964889, now seen corresponding path program 1 times [2023-08-03 20:27:17,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:17,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791511262] [2023-08-03 20:27:17,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:17,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:27:17,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:17,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791511262] [2023-08-03 20:27:17,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791511262] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:17,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824264325] [2023-08-03 20:27:17,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:17,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:17,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:27:17,176 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:27:17,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-03 20:27:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:17,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 20:27:17,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:27:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:27:17,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:27:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:27:17,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824264325] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:27:17,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:27:17,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 20:27:17,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715011020] [2023-08-03 20:27:17,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:27:17,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:27:17,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:17,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:27:17,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:27:17,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 248 [2023-08-03 20:27:17,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:17,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:17,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 248 [2023-08-03 20:27:17,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:17,681 INFO L124 PetriNetUnfolderBase]: 5682/7585 cut-off events. [2023-08-03 20:27:17,681 INFO L125 PetriNetUnfolderBase]: For 1232/1232 co-relation queries the response was YES. [2023-08-03 20:27:17,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16360 conditions, 7585 events. 5682/7585 cut-off events. For 1232/1232 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 34839 event pairs, 1645 based on Foata normal form. 27/4832 useless extension candidates. Maximal degree in co-relation 10425. Up to 6552 conditions per place. [2023-08-03 20:27:17,716 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 49 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-03 20:27:17,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 304 flow [2023-08-03 20:27:17,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:27:17,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:27:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-08-03 20:27:17,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48588709677419356 [2023-08-03 20:27:17,718 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-08-03 20:27:17,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-08-03 20:27:17,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:17,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-08-03 20:27:17,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:17,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:17,721 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:17,721 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 176 flow. Second operand 4 states and 482 transitions. [2023-08-03 20:27:17,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 304 flow [2023-08-03 20:27:17,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 20:27:17,733 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 172 flow [2023-08-03 20:27:17,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-08-03 20:27:17,733 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-08-03 20:27:17,734 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 172 flow [2023-08-03 20:27:17,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:17,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:17,734 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:17,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-03 20:27:17,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:17,939 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:17,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:17,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1755200312, now seen corresponding path program 1 times [2023-08-03 20:27:17,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:17,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136070346] [2023-08-03 20:27:17,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:17,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 20:27:17,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:17,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136070346] [2023-08-03 20:27:17,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136070346] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:17,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130586887] [2023-08-03 20:27:17,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:17,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:17,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:27:17,994 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:27:17,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-03 20:27:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:18,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 20:27:18,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:27:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 20:27:18,076 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:27:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 20:27:18,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130586887] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:27:18,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:27:18,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 20:27:18,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730063273] [2023-08-03 20:27:18,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:27:18,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:27:18,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:18,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:27:18,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:27:18,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 248 [2023-08-03 20:27:18,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:18,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:18,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 248 [2023-08-03 20:27:18,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:18,418 INFO L124 PetriNetUnfolderBase]: 4136/5529 cut-off events. [2023-08-03 20:27:18,418 INFO L125 PetriNetUnfolderBase]: For 1255/1255 co-relation queries the response was YES. [2023-08-03 20:27:18,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11920 conditions, 5529 events. 4136/5529 cut-off events. For 1255/1255 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 22903 event pairs, 747 based on Foata normal form. 108/3585 useless extension candidates. Maximal degree in co-relation 10506. Up to 2080 conditions per place. [2023-08-03 20:27:18,440 INFO L140 encePairwiseOnDemand]: 244/248 looper letters, 55 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-08-03 20:27:18,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 342 flow [2023-08-03 20:27:18,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:27:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:27:18,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-03 20:27:18,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49294354838709675 [2023-08-03 20:27:18,443 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-03 20:27:18,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-03 20:27:18,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:18,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-03 20:27:18,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:18,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:18,446 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:18,446 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 172 flow. Second operand 4 states and 489 transitions. [2023-08-03 20:27:18,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 342 flow [2023-08-03 20:27:18,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 336 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 20:27:18,452 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 186 flow [2023-08-03 20:27:18,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-08-03 20:27:18,453 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2023-08-03 20:27:18,453 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 186 flow [2023-08-03 20:27:18,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:18,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:18,453 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:18,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-03 20:27:18,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-03 20:27:18,654 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:18,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:18,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1704239472, now seen corresponding path program 1 times [2023-08-03 20:27:18,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:18,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784101223] [2023-08-03 20:27:18,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:18,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:27:18,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:18,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784101223] [2023-08-03 20:27:18,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784101223] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:18,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190959002] [2023-08-03 20:27:18,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:18,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:18,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:27:18,713 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:27:18,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-03 20:27:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:18,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 20:27:18,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:27:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:27:18,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:27:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:27:18,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190959002] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:27:18,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:27:18,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 20:27:18,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094992167] [2023-08-03 20:27:18,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:27:18,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:27:18,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:18,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:27:18,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:27:18,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 248 [2023-08-03 20:27:18,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:18,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:18,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 248 [2023-08-03 20:27:18,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:19,199 INFO L124 PetriNetUnfolderBase]: 4120/5502 cut-off events. [2023-08-03 20:27:19,199 INFO L125 PetriNetUnfolderBase]: For 2154/2154 co-relation queries the response was YES. [2023-08-03 20:27:19,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12568 conditions, 5502 events. 4120/5502 cut-off events. For 2154/2154 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 22775 event pairs, 1861 based on Foata normal form. 13/3471 useless extension candidates. Maximal degree in co-relation 11152. Up to 4661 conditions per place. [2023-08-03 20:27:19,218 INFO L140 encePairwiseOnDemand]: 244/248 looper letters, 55 selfloop transitions, 3 changer transitions 2/68 dead transitions. [2023-08-03 20:27:19,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 358 flow [2023-08-03 20:27:19,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:27:19,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:27:19,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-03 20:27:19,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49294354838709675 [2023-08-03 20:27:19,220 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-03 20:27:19,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-03 20:27:19,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:19,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-03 20:27:19,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:19,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:19,224 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:19,224 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 186 flow. Second operand 4 states and 489 transitions. [2023-08-03 20:27:19,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 358 flow [2023-08-03 20:27:19,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 354 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 20:27:19,234 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 190 flow [2023-08-03 20:27:19,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2023-08-03 20:27:19,235 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2023-08-03 20:27:19,235 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 190 flow [2023-08-03 20:27:19,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:19,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:19,236 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:19,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-03 20:27:19,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:19,438 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:19,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:19,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1172233499, now seen corresponding path program 1 times [2023-08-03 20:27:19,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:19,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337782091] [2023-08-03 20:27:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:19,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-03 20:27:19,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:19,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337782091] [2023-08-03 20:27:19,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337782091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:27:19,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:27:19,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 20:27:19,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157940616] [2023-08-03 20:27:19,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:19,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:27:19,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:19,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:27:19,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 20:27:19,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 248 [2023-08-03 20:27:19,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:19,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:19,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 248 [2023-08-03 20:27:19,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:20,076 INFO L124 PetriNetUnfolderBase]: 4362/5806 cut-off events. [2023-08-03 20:27:20,076 INFO L125 PetriNetUnfolderBase]: For 3151/3151 co-relation queries the response was YES. [2023-08-03 20:27:20,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13629 conditions, 5806 events. 4362/5806 cut-off events. For 3151/3151 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 24150 event pairs, 733 based on Foata normal form. 1/3745 useless extension candidates. Maximal degree in co-relation 13349. Up to 4855 conditions per place. [2023-08-03 20:27:20,097 INFO L140 encePairwiseOnDemand]: 242/248 looper letters, 65 selfloop transitions, 3 changer transitions 1/77 dead transitions. [2023-08-03 20:27:20,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 77 transitions, 483 flow [2023-08-03 20:27:20,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:27:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:27:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-08-03 20:27:20,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5295698924731183 [2023-08-03 20:27:20,098 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-08-03 20:27:20,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-08-03 20:27:20,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:20,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-08-03 20:27:20,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:20,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:20,101 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:20,101 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 190 flow. Second operand 3 states and 394 transitions. [2023-08-03 20:27:20,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 77 transitions, 483 flow [2023-08-03 20:27:20,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 467 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-03 20:27:20,110 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 205 flow [2023-08-03 20:27:20,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2023-08-03 20:27:20,110 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2023-08-03 20:27:20,110 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 205 flow [2023-08-03 20:27:20,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:20,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:20,111 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:20,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-03 20:27:20,111 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:20,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:20,111 INFO L85 PathProgramCache]: Analyzing trace with hash 137661240, now seen corresponding path program 1 times [2023-08-03 20:27:20,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:20,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122578574] [2023-08-03 20:27:20,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:20,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 20:27:20,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:20,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122578574] [2023-08-03 20:27:20,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122578574] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:27:20,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:27:20,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-03 20:27:20,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962131988] [2023-08-03 20:27:20,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:20,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:27:20,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:20,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:27:20,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:27:20,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 248 [2023-08-03 20:27:20,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:20,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:20,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 248 [2023-08-03 20:27:20,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:20,999 INFO L124 PetriNetUnfolderBase]: 6015/8743 cut-off events. [2023-08-03 20:27:20,999 INFO L125 PetriNetUnfolderBase]: For 5964/5964 co-relation queries the response was YES. [2023-08-03 20:27:21,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22934 conditions, 8743 events. 6015/8743 cut-off events. For 5964/5964 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 47418 event pairs, 1809 based on Foata normal form. 619/9362 useless extension candidates. Maximal degree in co-relation 22437. Up to 4587 conditions per place. [2023-08-03 20:27:21,023 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 97 selfloop transitions, 4 changer transitions 30/137 dead transitions. [2023-08-03 20:27:21,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 137 transitions, 895 flow [2023-08-03 20:27:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:27:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:27:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 628 transitions. [2023-08-03 20:27:21,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064516129032258 [2023-08-03 20:27:21,025 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 628 transitions. [2023-08-03 20:27:21,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 628 transitions. [2023-08-03 20:27:21,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:21,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 628 transitions. [2023-08-03 20:27:21,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:21,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:21,032 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:21,032 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 205 flow. Second operand 5 states and 628 transitions. [2023-08-03 20:27:21,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 137 transitions, 895 flow [2023-08-03 20:27:21,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 137 transitions, 891 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 20:27:21,057 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 237 flow [2023-08-03 20:27:21,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2023-08-03 20:27:21,058 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2023-08-03 20:27:21,058 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 237 flow [2023-08-03 20:27:21,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:21,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:21,059 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:21,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-03 20:27:21,059 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:21,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:21,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1992334924, now seen corresponding path program 1 times [2023-08-03 20:27:21,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:21,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39588064] [2023-08-03 20:27:21,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:21,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:27:21,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:21,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39588064] [2023-08-03 20:27:21,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39588064] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:27:21,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:27:21,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 20:27:21,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432350932] [2023-08-03 20:27:21,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:21,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 20:27:21,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:21,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 20:27:21,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 20:27:21,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 248 [2023-08-03 20:27:21,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 49 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:21,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:21,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 248 [2023-08-03 20:27:21,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:21,301 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][57], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 1114#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 83#L41-4true, Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 70#L41-4true, 79#L51-4true, Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, 7#L71-6true, 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 19#L51-4true, 1096#true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,302 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-03 20:27:21,302 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-03 20:27:21,302 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-03 20:27:21,302 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-03 20:27:21,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][57], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 1114#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 70#L41-4true, 79#L51-4true, Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), 61#thread1EXITtrue, Black: 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, 7#L71-6true, 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 19#L51-4true, 1096#true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,323 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-03 20:27:21,324 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-03 20:27:21,324 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-03 20:27:21,324 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-03 20:27:21,367 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][57], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 1114#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 83#L41-4true, Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 70#L41-4true, 79#L51-4true, Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 51#L71-11true, 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 19#L51-4true, 1096#true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,367 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-03 20:27:21,367 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-03 20:27:21,367 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-03 20:27:21,367 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-03 20:27:21,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][57], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 1114#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 70#L41-4true, 79#L51-4true, Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 51#L71-11true, 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 61#thread1EXITtrue, Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 1096#true, 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,389 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-03 20:27:21,389 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-03 20:27:21,389 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-03 20:27:21,389 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-03 20:27:21,400 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][57], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 1114#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 33#L72-8true, 83#L41-4true, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 70#L41-4true, 79#L51-4true, Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 655#true, Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 1096#true, 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,400 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-03 20:27:21,400 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-03 20:27:21,400 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-03 20:27:21,400 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-03 20:27:21,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][57], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1114#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 33#L72-8true, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 70#L41-4true, 79#L51-4true, Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 61#thread1EXITtrue, Black: 655#true, Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 1096#true, 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,421 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-03 20:27:21,421 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-03 20:27:21,421 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-03 20:27:21,421 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-03 20:27:21,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][57], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 1114#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 83#L41-4true, 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 70#L41-4true, 41#L72-3true, 79#L51-4true, Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 655#true, Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 1096#true, 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,429 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-03 20:27:21,429 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-03 20:27:21,429 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-03 20:27:21,429 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-03 20:27:21,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][57], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 1114#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 70#L41-4true, 41#L72-3true, 79#L51-4true, Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), 61#thread1EXITtrue, Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 655#true, Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 1096#true, 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,447 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-03 20:27:21,447 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 20:27:21,447 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 20:27:21,447 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-03 20:27:21,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][53], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 70#L41-4true, 1113#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 84#$Ultimate##0true, 112#L72-4true, 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 655#true, Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1NotInUse, 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 1096#true, 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,447 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-03 20:27:21,447 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 20:27:21,447 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 20:27:21,447 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-03 20:27:21,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][53], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 70#L41-4true, 79#L51-4true, 1113#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 112#L72-4true, 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 655#true, Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1NotInUse, Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 1096#true, 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,477 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-03 20:27:21,477 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 20:27:21,477 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 20:27:21,477 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 20:27:21,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][57], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 1114#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 79#L51-4true, 70#L41-4true, Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 112#L72-4true, Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 655#true, Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1NotInUse, 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 1096#true, 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,478 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-03 20:27:21,478 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 20:27:21,478 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 20:27:21,478 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 20:27:21,507 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][53], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 70#L41-4true, 1113#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 112#L72-4true, Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 655#true, Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1NotInUse, Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 13#thread2EXITtrue, 19#L51-4true, 1096#true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,507 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-03 20:27:21,507 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 20:27:21,507 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 20:27:21,507 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 20:27:21,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][53], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 33#L72-8true, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 70#L41-4true, 1113#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 84#$Ultimate##0true, 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 655#true, Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1NotInUse, 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 1096#true, 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,508 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-03 20:27:21,508 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 20:27:21,508 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 20:27:21,508 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 20:27:21,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][53], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 33#L72-8true, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 70#L41-4true, 79#L51-4true, 1113#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 655#true, Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1NotInUse, Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 1096#true, 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,534 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-03 20:27:21,534 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 20:27:21,534 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 20:27:21,534 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 20:27:21,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][57], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 1114#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 33#L72-8true, 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 79#L51-4true, 70#L41-4true, Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 655#true, Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1NotInUse, 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 19#L51-4true, 1096#true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,535 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-03 20:27:21,535 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 20:27:21,535 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 20:27:21,535 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 20:27:21,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][53], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 41#L72-3true, 1113#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 70#L41-4true, Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 84#$Ultimate##0true, 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 655#true, Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1NotInUse, 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 19#L51-4true, 1096#true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,535 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-03 20:27:21,535 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 20:27:21,536 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 20:27:21,536 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 20:27:21,577 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][53], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 33#L72-8true, 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 70#L41-4true, 1113#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 655#true, Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1NotInUse, Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 13#thread2EXITtrue, 19#L51-4true, 1096#true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,578 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-03 20:27:21,578 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 20:27:21,578 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 20:27:21,578 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 20:27:21,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][53], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 79#L51-4true, 70#L41-4true, 41#L72-3true, 1113#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 655#true, Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1NotInUse, Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 1096#true, 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,578 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-03 20:27:21,579 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 20:27:21,579 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 20:27:21,579 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 20:27:21,579 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][57], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 1114#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 41#L72-3true, 79#L51-4true, 70#L41-4true, Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 655#true, Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1NotInUse, 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 19#L51-4true, 1096#true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,579 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-03 20:27:21,579 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 20:27:21,579 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 20:27:21,579 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 20:27:21,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][53], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1113#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 70#L41-4true, 41#L72-3true, Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 655#true, thread1Thread1of2ForFork1NotInUse, Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 13#thread2EXITtrue, 19#L51-4true, 1096#true, thread2Thread1of2ForFork0InUse]) [2023-08-03 20:27:21,615 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-03 20:27:21,615 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 20:27:21,615 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-03 20:27:21,615 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-03 20:27:21,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][53], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 70#L41-4true, 1113#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 112#L72-4true, Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 655#true, Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1NotInUse, Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 19#L51-4true, 1096#true, thread2Thread1of2ForFork0NotInUse]) [2023-08-03 20:27:21,637 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-03 20:27:21,637 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-03 20:27:21,637 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-03 20:27:21,638 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-03 20:27:21,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][53], [Black: 478#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 33#L72-8true, Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 70#L41-4true, 1113#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1NotInUse, Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 19#L51-4true, 1096#true, thread2Thread1of2ForFork0NotInUse]) [2023-08-03 20:27:21,688 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-03 20:27:21,688 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-03 20:27:21,688 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-03 20:27:21,688 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-03 20:27:21,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][53], [Black: 855#true, Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1113#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 70#L41-4true, Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 10#L73-8true, 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1NotInUse, Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 19#L51-4true, 1096#true, thread2Thread1of2ForFork0NotInUse, 857#(= 0 |ULTIMATE.start_main_~asdf~3#1|)]) [2023-08-03 20:27:21,718 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-03 20:27:21,718 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-03 20:27:21,718 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-03 20:27:21,719 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-03 20:27:21,734 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([673] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_83 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (< 0 (mod v_~counter~0_105 4294967296)) 1 0)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= v_~counter~0_105 (+ v_~c~0_74 v_~counter~0_104))) InVars {~counter~0=v_~counter~0_105, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_74, ~N~0=v_~N~0_83} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_15|, ~counter~0=v_~counter~0_104, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_74, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~N~0=v_~N~0_83, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][53], [Black: 855#true, Black: 858#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1093#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1113#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 70#L41-4true, Black: 167#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 117#L73-3true, 346#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1098#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1105#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 240#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 658#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1102#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1NotInUse, Black: 345#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), 168#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 19#L51-4true, 1096#true, thread2Thread1of2ForFork0NotInUse, 857#(= 0 |ULTIMATE.start_main_~asdf~3#1|)]) [2023-08-03 20:27:21,735 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-03 20:27:21,735 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-03 20:27:21,735 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-03 20:27:21,735 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-03 20:27:21,762 INFO L124 PetriNetUnfolderBase]: 5971/8431 cut-off events. [2023-08-03 20:27:21,763 INFO L125 PetriNetUnfolderBase]: For 10145/11060 co-relation queries the response was YES. [2023-08-03 20:27:21,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26627 conditions, 8431 events. 5971/8431 cut-off events. For 10145/11060 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 43276 event pairs, 1227 based on Foata normal form. 972/9180 useless extension candidates. Maximal degree in co-relation 26167. Up to 5362 conditions per place. [2023-08-03 20:27:21,813 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 90 selfloop transitions, 4 changer transitions 5/106 dead transitions. [2023-08-03 20:27:21,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 106 transitions, 715 flow [2023-08-03 20:27:21,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:27:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:27:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-08-03 20:27:21,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060483870967742 [2023-08-03 20:27:21,815 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-08-03 20:27:21,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-08-03 20:27:21,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:21,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-08-03 20:27:21,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:21,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:21,819 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:21,819 INFO L175 Difference]: Start difference. First operand has 65 places, 49 transitions, 237 flow. Second operand 4 states and 502 transitions. [2023-08-03 20:27:21,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 106 transitions, 715 flow [2023-08-03 20:27:21,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 703 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-03 20:27:21,840 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 256 flow [2023-08-03 20:27:21,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=256, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2023-08-03 20:27:21,840 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2023-08-03 20:27:21,840 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 256 flow [2023-08-03 20:27:21,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:21,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:21,841 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:21,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-03 20:27:21,841 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:21,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:21,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1047498931, now seen corresponding path program 1 times [2023-08-03 20:27:21,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:21,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27539446] [2023-08-03 20:27:21,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:21,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 20:27:21,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:21,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27539446] [2023-08-03 20:27:21,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27539446] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:27:21,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:27:21,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-03 20:27:21,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007743091] [2023-08-03 20:27:21,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:21,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:27:21,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:21,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:27:21,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:27:22,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 248 [2023-08-03 20:27:22,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:22,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:22,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 248 [2023-08-03 20:27:22,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:22,747 INFO L124 PetriNetUnfolderBase]: 6025/8906 cut-off events. [2023-08-03 20:27:22,747 INFO L125 PetriNetUnfolderBase]: For 16867/17478 co-relation queries the response was YES. [2023-08-03 20:27:22,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28984 conditions, 8906 events. 6025/8906 cut-off events. For 16867/17478 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 48700 event pairs, 1639 based on Foata normal form. 684/9481 useless extension candidates. Maximal degree in co-relation 28438. Up to 4518 conditions per place. [2023-08-03 20:27:22,790 INFO L140 encePairwiseOnDemand]: 242/248 looper letters, 112 selfloop transitions, 7 changer transitions 35/161 dead transitions. [2023-08-03 20:27:22,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 161 transitions, 1135 flow [2023-08-03 20:27:22,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 20:27:22,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 20:27:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions. [2023-08-03 20:27:22,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49731182795698925 [2023-08-03 20:27:22,795 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 740 transitions. [2023-08-03 20:27:22,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions. [2023-08-03 20:27:22,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:22,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions. [2023-08-03 20:27:22,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:22,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:22,799 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:22,799 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 256 flow. Second operand 6 states and 740 transitions. [2023-08-03 20:27:22,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 161 transitions, 1135 flow [2023-08-03 20:27:22,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 161 transitions, 1126 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-03 20:27:22,833 INFO L231 Difference]: Finished difference. Result has 73 places, 54 transitions, 299 flow [2023-08-03 20:27:22,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=299, PETRI_PLACES=73, PETRI_TRANSITIONS=54} [2023-08-03 20:27:22,833 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2023-08-03 20:27:22,833 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 54 transitions, 299 flow [2023-08-03 20:27:22,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:22,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:22,834 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:22,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-03 20:27:22,834 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:22,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:22,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1197856626, now seen corresponding path program 2 times [2023-08-03 20:27:22,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:22,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914261784] [2023-08-03 20:27:22,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:22,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:27:22,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:22,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914261784] [2023-08-03 20:27:22,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914261784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:27:22,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:27:22,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 20:27:22,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818909714] [2023-08-03 20:27:22,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:22,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 20:27:22,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:22,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 20:27:22,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 20:27:22,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 248 [2023-08-03 20:27:22,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 54 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:22,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:22,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 248 [2023-08-03 20:27:22,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:23,879 INFO L124 PetriNetUnfolderBase]: 10419/14853 cut-off events. [2023-08-03 20:27:23,880 INFO L125 PetriNetUnfolderBase]: For 30629/32774 co-relation queries the response was YES. [2023-08-03 20:27:23,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54914 conditions, 14853 events. 10419/14853 cut-off events. For 30629/32774 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 84026 event pairs, 2851 based on Foata normal form. 1385/16104 useless extension candidates. Maximal degree in co-relation 54076. Up to 6668 conditions per place. [2023-08-03 20:27:23,972 INFO L140 encePairwiseOnDemand]: 242/248 looper letters, 95 selfloop transitions, 13 changer transitions 2/118 dead transitions. [2023-08-03 20:27:23,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 118 transitions, 877 flow [2023-08-03 20:27:23,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:27:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:27:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2023-08-03 20:27:23,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050403225806451 [2023-08-03 20:27:23,974 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2023-08-03 20:27:23,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2023-08-03 20:27:23,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:23,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2023-08-03 20:27:23,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:23,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:23,977 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:23,977 INFO L175 Difference]: Start difference. First operand has 73 places, 54 transitions, 299 flow. Second operand 4 states and 501 transitions. [2023-08-03 20:27:23,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 118 transitions, 877 flow [2023-08-03 20:27:24,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 118 transitions, 850 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-03 20:27:24,041 INFO L231 Difference]: Finished difference. Result has 75 places, 64 transitions, 424 flow [2023-08-03 20:27:24,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=424, PETRI_PLACES=75, PETRI_TRANSITIONS=64} [2023-08-03 20:27:24,042 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places. [2023-08-03 20:27:24,042 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 64 transitions, 424 flow [2023-08-03 20:27:24,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:24,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:24,043 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:24,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-03 20:27:24,043 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:24,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:24,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1435065383, now seen corresponding path program 1 times [2023-08-03 20:27:24,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:24,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329209939] [2023-08-03 20:27:24,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:24,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:24,198 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 20:27:24,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:24,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329209939] [2023-08-03 20:27:24,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329209939] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:27:24,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:27:24,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-03 20:27:24,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958101157] [2023-08-03 20:27:24,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:24,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:27:24,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:24,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:27:24,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:27:24,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 248 [2023-08-03 20:27:24,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 64 transitions, 424 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:24,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:24,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 248 [2023-08-03 20:27:24,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:26,140 INFO L124 PetriNetUnfolderBase]: 14787/22322 cut-off events. [2023-08-03 20:27:26,141 INFO L125 PetriNetUnfolderBase]: For 82943/85412 co-relation queries the response was YES. [2023-08-03 20:27:26,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85792 conditions, 22322 events. 14787/22322 cut-off events. For 82943/85412 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 145219 event pairs, 4509 based on Foata normal form. 3443/25320 useless extension candidates. Maximal degree in co-relation 84185. Up to 12042 conditions per place. [2023-08-03 20:27:26,236 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 135 selfloop transitions, 5 changer transitions 0/148 dead transitions. [2023-08-03 20:27:26,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 148 transitions, 1242 flow [2023-08-03 20:27:26,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:27:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:27:26,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-08-03 20:27:26,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4935483870967742 [2023-08-03 20:27:26,238 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-08-03 20:27:26,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-08-03 20:27:26,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:26,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-08-03 20:27:26,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:26,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:26,242 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:26,242 INFO L175 Difference]: Start difference. First operand has 75 places, 64 transitions, 424 flow. Second operand 5 states and 612 transitions. [2023-08-03 20:27:26,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 148 transitions, 1242 flow [2023-08-03 20:27:26,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 148 transitions, 1234 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 20:27:26,353 INFO L231 Difference]: Finished difference. Result has 81 places, 68 transitions, 537 flow [2023-08-03 20:27:26,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=537, PETRI_PLACES=81, PETRI_TRANSITIONS=68} [2023-08-03 20:27:26,353 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 40 predicate places. [2023-08-03 20:27:26,353 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 68 transitions, 537 flow [2023-08-03 20:27:26,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:26,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:26,354 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:26,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-03 20:27:26,354 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:26,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:26,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1307660200, now seen corresponding path program 3 times [2023-08-03 20:27:26,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:26,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237368269] [2023-08-03 20:27:26,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:26,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-03 20:27:26,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:26,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237368269] [2023-08-03 20:27:26,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237368269] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:27:26,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:27:26,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 20:27:26,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486728067] [2023-08-03 20:27:26,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:26,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 20:27:26,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:26,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 20:27:26,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-03 20:27:26,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 248 [2023-08-03 20:27:26,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 68 transitions, 537 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:26,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:26,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 248 [2023-08-03 20:27:26,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:27,985 INFO L124 PetriNetUnfolderBase]: 9959/15887 cut-off events. [2023-08-03 20:27:27,985 INFO L125 PetriNetUnfolderBase]: For 66255/68972 co-relation queries the response was YES. [2023-08-03 20:27:28,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69441 conditions, 15887 events. 9959/15887 cut-off events. For 66255/68972 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 107328 event pairs, 4028 based on Foata normal form. 1829/17539 useless extension candidates. Maximal degree in co-relation 68322. Up to 8205 conditions per place. [2023-08-03 20:27:28,062 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 80 selfloop transitions, 5 changer transitions 25/119 dead transitions. [2023-08-03 20:27:28,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 119 transitions, 1048 flow [2023-08-03 20:27:28,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:27:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:27:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2023-08-03 20:27:28,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49899193548387094 [2023-08-03 20:27:28,064 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 495 transitions. [2023-08-03 20:27:28,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 495 transitions. [2023-08-03 20:27:28,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:28,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 495 transitions. [2023-08-03 20:27:28,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:28,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:28,067 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:28,067 INFO L175 Difference]: Start difference. First operand has 81 places, 68 transitions, 537 flow. Second operand 4 states and 495 transitions. [2023-08-03 20:27:28,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 119 transitions, 1048 flow [2023-08-03 20:27:28,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 119 transitions, 1036 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-03 20:27:28,145 INFO L231 Difference]: Finished difference. Result has 85 places, 68 transitions, 553 flow [2023-08-03 20:27:28,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=553, PETRI_PLACES=85, PETRI_TRANSITIONS=68} [2023-08-03 20:27:28,146 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2023-08-03 20:27:28,146 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 68 transitions, 553 flow [2023-08-03 20:27:28,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:28,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:28,146 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:28,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-03 20:27:28,147 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:28,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:28,147 INFO L85 PathProgramCache]: Analyzing trace with hash -985980861, now seen corresponding path program 1 times [2023-08-03 20:27:28,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:28,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408115148] [2023-08-03 20:27:28,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:28,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-03 20:27:28,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:28,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408115148] [2023-08-03 20:27:28,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408115148] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:28,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264581645] [2023-08-03 20:27:28,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:28,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:28,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:27:28,333 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:27:28,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-03 20:27:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:28,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 20:27:28,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:27:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-03 20:27:28,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:27:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-03 20:27:28,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264581645] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:27:28,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:27:28,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-03 20:27:28,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694411018] [2023-08-03 20:27:28,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:27:28,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-03 20:27:28,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:28,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-03 20:27:28,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-03 20:27:28,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 248 [2023-08-03 20:27:28,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 68 transitions, 553 flow. Second operand has 8 states, 8 states have (on average 105.5) internal successors, (844), 8 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:28,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:28,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 248 [2023-08-03 20:27:28,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:30,795 INFO L124 PetriNetUnfolderBase]: 14656/22438 cut-off events. [2023-08-03 20:27:30,795 INFO L125 PetriNetUnfolderBase]: For 131550/135139 co-relation queries the response was YES. [2023-08-03 20:27:30,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104234 conditions, 22438 events. 14656/22438 cut-off events. For 131550/135139 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 146900 event pairs, 5902 based on Foata normal form. 3760/26128 useless extension candidates. Maximal degree in co-relation 102632. Up to 12409 conditions per place. [2023-08-03 20:27:30,907 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 132 selfloop transitions, 27 changer transitions 12/178 dead transitions. [2023-08-03 20:27:30,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 178 transitions, 1706 flow [2023-08-03 20:27:30,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:27:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:27:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 622 transitions. [2023-08-03 20:27:30,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016129032258064 [2023-08-03 20:27:30,909 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 622 transitions. [2023-08-03 20:27:30,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 622 transitions. [2023-08-03 20:27:30,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:30,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 622 transitions. [2023-08-03 20:27:30,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:30,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:30,913 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:30,913 INFO L175 Difference]: Start difference. First operand has 85 places, 68 transitions, 553 flow. Second operand 5 states and 622 transitions. [2023-08-03 20:27:30,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 178 transitions, 1706 flow [2023-08-03 20:27:31,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 178 transitions, 1672 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-03 20:27:31,086 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 905 flow [2023-08-03 20:27:31,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=905, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2023-08-03 20:27:31,087 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places. [2023-08-03 20:27:31,087 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 905 flow [2023-08-03 20:27:31,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.5) internal successors, (844), 8 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:31,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:31,087 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:31,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-03 20:27:31,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:31,292 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:31,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1694953501, now seen corresponding path program 2 times [2023-08-03 20:27:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:31,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189716578] [2023-08-03 20:27:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:31,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:31,404 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-03 20:27:31,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:31,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189716578] [2023-08-03 20:27:31,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189716578] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:31,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432909517] [2023-08-03 20:27:31,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 20:27:31,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:31,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:27:31,406 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:27:31,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-03 20:27:31,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 20:27:31,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 20:27:31,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 20:27:31,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:27:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-03 20:27:31,541 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:27:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-03 20:27:31,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432909517] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:31,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-03 20:27:31,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2023-08-03 20:27:31,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284777289] [2023-08-03 20:27:31,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:31,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 20:27:31,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:31,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 20:27:31,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-03 20:27:31,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 248 [2023-08-03 20:27:31,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 905 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:31,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:31,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 248 [2023-08-03 20:27:31,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:33,518 INFO L124 PetriNetUnfolderBase]: 13246/20243 cut-off events. [2023-08-03 20:27:33,518 INFO L125 PetriNetUnfolderBase]: For 147948/152420 co-relation queries the response was YES. [2023-08-03 20:27:33,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105003 conditions, 20243 events. 13246/20243 cut-off events. For 147948/152420 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 132396 event pairs, 5049 based on Foata normal form. 3923/24023 useless extension candidates. Maximal degree in co-relation 104267. Up to 15662 conditions per place. [2023-08-03 20:27:33,640 INFO L140 encePairwiseOnDemand]: 244/248 looper letters, 111 selfloop transitions, 17 changer transitions 12/150 dead transitions. [2023-08-03 20:27:33,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 150 transitions, 1636 flow [2023-08-03 20:27:33,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:27:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:27:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-08-03 20:27:33,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060483870967742 [2023-08-03 20:27:33,643 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-08-03 20:27:33,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-08-03 20:27:33,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:33,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-08-03 20:27:33,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:33,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:33,646 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:33,646 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 905 flow. Second operand 4 states and 502 transitions. [2023-08-03 20:27:33,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 150 transitions, 1636 flow [2023-08-03 20:27:33,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 150 transitions, 1604 flow, removed 16 selfloop flow, removed 0 redundant places. [2023-08-03 20:27:33,808 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 978 flow [2023-08-03 20:27:33,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=978, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2023-08-03 20:27:33,809 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 52 predicate places. [2023-08-03 20:27:33,809 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 978 flow [2023-08-03 20:27:33,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:33,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:33,809 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:33,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-03 20:27:34,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-03 20:27:34,010 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:34,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:34,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1057746990, now seen corresponding path program 1 times [2023-08-03 20:27:34,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:34,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325006594] [2023-08-03 20:27:34,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:34,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 20:27:34,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:34,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325006594] [2023-08-03 20:27:34,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325006594] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:34,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266293957] [2023-08-03 20:27:34,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:34,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:34,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:27:34,254 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:27:34,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-03 20:27:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:34,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 20:27:34,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:27:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 20:27:34,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:27:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 20:27:34,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266293957] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:27:34,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:27:34,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-03 20:27:34,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90824038] [2023-08-03 20:27:34,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:27:34,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-03 20:27:34,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:34,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-03 20:27:34,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-03 20:27:34,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 248 [2023-08-03 20:27:34,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 978 flow. Second operand has 8 states, 8 states have (on average 106.375) internal successors, (851), 8 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:34,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:34,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 248 [2023-08-03 20:27:34,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:36,824 INFO L124 PetriNetUnfolderBase]: 14865/22519 cut-off events. [2023-08-03 20:27:36,824 INFO L125 PetriNetUnfolderBase]: For 189859/193528 co-relation queries the response was YES. [2023-08-03 20:27:36,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120358 conditions, 22519 events. 14865/22519 cut-off events. For 189859/193528 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 146424 event pairs, 5976 based on Foata normal form. 3754/26225 useless extension candidates. Maximal degree in co-relation 118972. Up to 15252 conditions per place. [2023-08-03 20:27:36,967 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 140 selfloop transitions, 28 changer transitions 4/179 dead transitions. [2023-08-03 20:27:36,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 179 transitions, 2000 flow [2023-08-03 20:27:36,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:27:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:27:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2023-08-03 20:27:36,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49274193548387096 [2023-08-03 20:27:36,970 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 611 transitions. [2023-08-03 20:27:36,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 611 transitions. [2023-08-03 20:27:36,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:36,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 611 transitions. [2023-08-03 20:27:36,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:36,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:36,972 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:36,972 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 978 flow. Second operand 5 states and 611 transitions. [2023-08-03 20:27:36,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 179 transitions, 2000 flow [2023-08-03 20:27:37,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 179 transitions, 1980 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-03 20:27:37,165 INFO L231 Difference]: Finished difference. Result has 98 places, 102 transitions, 1241 flow [2023-08-03 20:27:37,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1241, PETRI_PLACES=98, PETRI_TRANSITIONS=102} [2023-08-03 20:27:37,165 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 57 predicate places. [2023-08-03 20:27:37,165 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 102 transitions, 1241 flow [2023-08-03 20:27:37,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.375) internal successors, (851), 8 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:37,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:37,166 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:37,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-03 20:27:37,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-03 20:27:37,367 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:37,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:37,367 INFO L85 PathProgramCache]: Analyzing trace with hash -100899688, now seen corresponding path program 2 times [2023-08-03 20:27:37,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:37,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023623628] [2023-08-03 20:27:37,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:37,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:37,482 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:27:37,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:37,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023623628] [2023-08-03 20:27:37,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023623628] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:37,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987756625] [2023-08-03 20:27:37,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 20:27:37,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:37,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:27:37,484 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:27:37,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-03 20:27:37,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 20:27:37,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 20:27:37,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 20:27:37,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:27:37,620 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:27:37,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:27:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:27:37,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987756625] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:37,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-03 20:27:37,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2023-08-03 20:27:37,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843089013] [2023-08-03 20:27:37,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:37,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 20:27:37,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:37,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 20:27:37,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-03 20:27:37,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 248 [2023-08-03 20:27:37,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 102 transitions, 1241 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:37,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:37,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 248 [2023-08-03 20:27:37,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:39,722 INFO L124 PetriNetUnfolderBase]: 13780/20159 cut-off events. [2023-08-03 20:27:39,723 INFO L125 PetriNetUnfolderBase]: For 219284/224085 co-relation queries the response was YES. [2023-08-03 20:27:39,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120672 conditions, 20159 events. 13780/20159 cut-off events. For 219284/224085 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 122012 event pairs, 4181 based on Foata normal form. 4218/24111 useless extension candidates. Maximal degree in co-relation 119630. Up to 15567 conditions per place. [2023-08-03 20:27:39,875 INFO L140 encePairwiseOnDemand]: 244/248 looper letters, 124 selfloop transitions, 17 changer transitions 14/165 dead transitions. [2023-08-03 20:27:39,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 165 transitions, 2035 flow [2023-08-03 20:27:39,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:27:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:27:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-08-03 20:27:39,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060483870967742 [2023-08-03 20:27:39,877 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-08-03 20:27:39,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-08-03 20:27:39,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:39,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-08-03 20:27:39,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:39,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:39,880 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:39,880 INFO L175 Difference]: Start difference. First operand has 98 places, 102 transitions, 1241 flow. Second operand 4 states and 502 transitions. [2023-08-03 20:27:39,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 165 transitions, 2035 flow [2023-08-03 20:27:40,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 165 transitions, 1997 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-03 20:27:40,064 INFO L231 Difference]: Finished difference. Result has 101 places, 103 transitions, 1285 flow [2023-08-03 20:27:40,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1285, PETRI_PLACES=101, PETRI_TRANSITIONS=103} [2023-08-03 20:27:40,065 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2023-08-03 20:27:40,065 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 103 transitions, 1285 flow [2023-08-03 20:27:40,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:40,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:40,065 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:40,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-03 20:27:40,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-03 20:27:40,266 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:40,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:40,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1466442191, now seen corresponding path program 3 times [2023-08-03 20:27:40,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:40,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924503617] [2023-08-03 20:27:40,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:40,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-03 20:27:40,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:40,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924503617] [2023-08-03 20:27:40,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924503617] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:27:40,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:27:40,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-03 20:27:40,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091745782] [2023-08-03 20:27:40,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:40,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:27:40,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:40,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:27:40,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:27:40,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 248 [2023-08-03 20:27:40,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 103 transitions, 1285 flow. Second operand has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:40,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:40,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 248 [2023-08-03 20:27:40,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:42,577 INFO L124 PetriNetUnfolderBase]: 14250/20990 cut-off events. [2023-08-03 20:27:42,577 INFO L125 PetriNetUnfolderBase]: For 252693/256251 co-relation queries the response was YES. [2023-08-03 20:27:42,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124588 conditions, 20990 events. 14250/20990 cut-off events. For 252693/256251 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 127756 event pairs, 5976 based on Foata normal form. 3209/24137 useless extension candidates. Maximal degree in co-relation 123522. Up to 13001 conditions per place. [2023-08-03 20:27:42,725 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 128 selfloop transitions, 18 changer transitions 22/175 dead transitions. [2023-08-03 20:27:42,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 175 transitions, 2120 flow [2023-08-03 20:27:42,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:27:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:27:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2023-08-03 20:27:42,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4854838709677419 [2023-08-03 20:27:42,727 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2023-08-03 20:27:42,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2023-08-03 20:27:42,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:42,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2023-08-03 20:27:42,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:42,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:42,730 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:42,730 INFO L175 Difference]: Start difference. First operand has 101 places, 103 transitions, 1285 flow. Second operand 5 states and 602 transitions. [2023-08-03 20:27:42,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 175 transitions, 2120 flow [2023-08-03 20:27:42,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 175 transitions, 1968 flow, removed 53 selfloop flow, removed 4 redundant places. [2023-08-03 20:27:42,949 INFO L231 Difference]: Finished difference. Result has 99 places, 103 transitions, 1184 flow [2023-08-03 20:27:42,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1184, PETRI_PLACES=99, PETRI_TRANSITIONS=103} [2023-08-03 20:27:42,950 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2023-08-03 20:27:42,950 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 103 transitions, 1184 flow [2023-08-03 20:27:42,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:42,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:42,950 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:42,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-03 20:27:42,951 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:42,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:42,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1426969431, now seen corresponding path program 1 times [2023-08-03 20:27:42,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:42,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170232889] [2023-08-03 20:27:42,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:42,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-03 20:27:43,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:43,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170232889] [2023-08-03 20:27:43,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170232889] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:27:43,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:27:43,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-03 20:27:43,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57075472] [2023-08-03 20:27:43,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:43,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:27:43,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:43,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:27:43,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:27:43,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 248 [2023-08-03 20:27:43,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 103 transitions, 1184 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:43,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:43,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 248 [2023-08-03 20:27:43,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:45,225 INFO L124 PetriNetUnfolderBase]: 12603/18336 cut-off events. [2023-08-03 20:27:45,225 INFO L125 PetriNetUnfolderBase]: For 194239/197262 co-relation queries the response was YES. [2023-08-03 20:27:45,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107024 conditions, 18336 events. 12603/18336 cut-off events. For 194239/197262 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 106347 event pairs, 5061 based on Foata normal form. 2704/20982 useless extension candidates. Maximal degree in co-relation 106325. Up to 13001 conditions per place. [2023-08-03 20:27:45,335 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 114 selfloop transitions, 15 changer transitions 35/171 dead transitions. [2023-08-03 20:27:45,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 171 transitions, 1993 flow [2023-08-03 20:27:45,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:27:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:27:45,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2023-08-03 20:27:45,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4854838709677419 [2023-08-03 20:27:45,338 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2023-08-03 20:27:45,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2023-08-03 20:27:45,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:45,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2023-08-03 20:27:45,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:45,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:45,340 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:45,341 INFO L175 Difference]: Start difference. First operand has 99 places, 103 transitions, 1184 flow. Second operand 5 states and 602 transitions. [2023-08-03 20:27:45,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 171 transitions, 1993 flow [2023-08-03 20:27:45,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 171 transitions, 1947 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-03 20:27:45,470 INFO L231 Difference]: Finished difference. Result has 102 places, 103 transitions, 1193 flow [2023-08-03 20:27:45,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1193, PETRI_PLACES=102, PETRI_TRANSITIONS=103} [2023-08-03 20:27:45,471 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 61 predicate places. [2023-08-03 20:27:45,471 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 103 transitions, 1193 flow [2023-08-03 20:27:45,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:45,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:45,471 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:45,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-03 20:27:45,471 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:45,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:45,472 INFO L85 PathProgramCache]: Analyzing trace with hash -282315968, now seen corresponding path program 1 times [2023-08-03 20:27:45,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:45,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415431021] [2023-08-03 20:27:45,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:45,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-03 20:27:45,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:45,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415431021] [2023-08-03 20:27:45,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415431021] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:45,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103392924] [2023-08-03 20:27:45,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:45,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:45,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:27:45,565 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:27:45,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-03 20:27:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:45,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 20:27:45,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:27:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-03 20:27:45,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:27:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-03 20:27:45,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103392924] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:45,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-03 20:27:45,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2023-08-03 20:27:45,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002728900] [2023-08-03 20:27:45,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:27:45,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 20:27:45,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:45,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 20:27:45,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-03 20:27:45,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 248 [2023-08-03 20:27:45,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 103 transitions, 1193 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:45,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:45,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 248 [2023-08-03 20:27:45,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:47,932 INFO L124 PetriNetUnfolderBase]: 15925/22053 cut-off events. [2023-08-03 20:27:47,933 INFO L125 PetriNetUnfolderBase]: For 256216/263843 co-relation queries the response was YES. [2023-08-03 20:27:48,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137279 conditions, 22053 events. 15925/22053 cut-off events. For 256216/263843 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 120353 event pairs, 3990 based on Foata normal form. 3163/24667 useless extension candidates. Maximal degree in co-relation 136864. Up to 18170 conditions per place. [2023-08-03 20:27:48,133 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 140 selfloop transitions, 19 changer transitions 3/174 dead transitions. [2023-08-03 20:27:48,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 174 transitions, 2248 flow [2023-08-03 20:27:48,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:27:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:27:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-08-03 20:27:48,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4909274193548387 [2023-08-03 20:27:48,135 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-08-03 20:27:48,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-08-03 20:27:48,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:48,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-08-03 20:27:48,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:48,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:48,138 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:48,138 INFO L175 Difference]: Start difference. First operand has 102 places, 103 transitions, 1193 flow. Second operand 4 states and 487 transitions. [2023-08-03 20:27:48,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 174 transitions, 2248 flow [2023-08-03 20:27:48,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 174 transitions, 2141 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-08-03 20:27:48,558 INFO L231 Difference]: Finished difference. Result has 99 places, 110 transitions, 1268 flow [2023-08-03 20:27:48,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1268, PETRI_PLACES=99, PETRI_TRANSITIONS=110} [2023-08-03 20:27:48,558 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2023-08-03 20:27:48,558 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 110 transitions, 1268 flow [2023-08-03 20:27:48,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:48,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:48,558 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:48,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-03 20:27:48,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:48,759 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:48,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:48,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1583810668, now seen corresponding path program 1 times [2023-08-03 20:27:48,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:48,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319700697] [2023-08-03 20:27:48,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:48,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:27:48,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:48,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319700697] [2023-08-03 20:27:48,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319700697] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:48,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454905184] [2023-08-03 20:27:48,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:48,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:48,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:27:48,850 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:27:48,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-03 20:27:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:48,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 20:27:48,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:27:49,000 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:27:49,001 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:27:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-03 20:27:49,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454905184] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:27:49,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:27:49,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2023-08-03 20:27:49,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010196850] [2023-08-03 20:27:49,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:27:49,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 20:27:49,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:49,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 20:27:49,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-03 20:27:49,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 248 [2023-08-03 20:27:49,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 110 transitions, 1268 flow. Second operand has 7 states, 7 states have (on average 108.14285714285714) internal successors, (757), 7 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:49,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:49,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 248 [2023-08-03 20:27:49,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:52,356 INFO L124 PetriNetUnfolderBase]: 22394/30701 cut-off events. [2023-08-03 20:27:52,356 INFO L125 PetriNetUnfolderBase]: For 326695/330770 co-relation queries the response was YES. [2023-08-03 20:27:52,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190479 conditions, 30701 events. 22394/30701 cut-off events. For 326695/330770 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 169985 event pairs, 4983 based on Foata normal form. 3492/34005 useless extension candidates. Maximal degree in co-relation 189699. Up to 16192 conditions per place. [2023-08-03 20:27:52,637 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 257 selfloop transitions, 82 changer transitions 6/354 dead transitions. [2023-08-03 20:27:52,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 354 transitions, 4660 flow [2023-08-03 20:27:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-03 20:27:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-03 20:27:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 967 transitions. [2023-08-03 20:27:52,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4873991935483871 [2023-08-03 20:27:52,639 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 967 transitions. [2023-08-03 20:27:52,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 967 transitions. [2023-08-03 20:27:52,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:52,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 967 transitions. [2023-08-03 20:27:52,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.875) internal successors, (967), 8 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:52,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:52,642 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:52,642 INFO L175 Difference]: Start difference. First operand has 99 places, 110 transitions, 1268 flow. Second operand 8 states and 967 transitions. [2023-08-03 20:27:52,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 354 transitions, 4660 flow [2023-08-03 20:27:52,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 354 transitions, 4636 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 20:27:52,921 INFO L231 Difference]: Finished difference. Result has 109 places, 177 transitions, 2621 flow [2023-08-03 20:27:52,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2621, PETRI_PLACES=109, PETRI_TRANSITIONS=177} [2023-08-03 20:27:52,921 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2023-08-03 20:27:52,921 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 177 transitions, 2621 flow [2023-08-03 20:27:52,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.14285714285714) internal successors, (757), 7 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:52,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:52,922 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:52,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-03 20:27:53,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-03 20:27:53,123 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:53,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash 219357468, now seen corresponding path program 2 times [2023-08-03 20:27:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:53,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399037205] [2023-08-03 20:27:53,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:53,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:53,220 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-03 20:27:53,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:53,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399037205] [2023-08-03 20:27:53,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399037205] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:53,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926801857] [2023-08-03 20:27:53,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 20:27:53,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:53,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:27:53,223 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:27:53,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-03 20:27:53,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 20:27:53,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 20:27:53,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 20:27:53,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:27:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-03 20:27:53,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:27:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-03 20:27:53,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926801857] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:27:53,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:27:53,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-03 20:27:53,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351846055] [2023-08-03 20:27:53,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:27:53,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-03 20:27:53,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:53,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-03 20:27:53,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-03 20:27:53,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 248 [2023-08-03 20:27:53,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 177 transitions, 2621 flow. Second operand has 8 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:53,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:53,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 248 [2023-08-03 20:27:53,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:27:57,041 INFO L124 PetriNetUnfolderBase]: 22466/29772 cut-off events. [2023-08-03 20:27:57,042 INFO L125 PetriNetUnfolderBase]: For 434815/438673 co-relation queries the response was YES. [2023-08-03 20:27:57,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211860 conditions, 29772 events. 22466/29772 cut-off events. For 434815/438673 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 150592 event pairs, 4256 based on Foata normal form. 3525/33273 useless extension candidates. Maximal degree in co-relation 211177. Up to 17117 conditions per place. [2023-08-03 20:27:57,303 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 181 selfloop transitions, 125 changer transitions 4/319 dead transitions. [2023-08-03 20:27:57,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 319 transitions, 4983 flow [2023-08-03 20:27:57,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 20:27:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 20:27:57,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 717 transitions. [2023-08-03 20:27:57,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48185483870967744 [2023-08-03 20:27:57,305 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 717 transitions. [2023-08-03 20:27:57,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 717 transitions. [2023-08-03 20:27:57,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:27:57,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 717 transitions. [2023-08-03 20:27:57,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:57,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:57,309 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:57,309 INFO L175 Difference]: Start difference. First operand has 109 places, 177 transitions, 2621 flow. Second operand 6 states and 717 transitions. [2023-08-03 20:27:57,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 319 transitions, 4983 flow [2023-08-03 20:27:57,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 319 transitions, 4967 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-08-03 20:27:57,758 INFO L231 Difference]: Finished difference. Result has 117 places, 227 transitions, 3946 flow [2023-08-03 20:27:57,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=2605, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3946, PETRI_PLACES=117, PETRI_TRANSITIONS=227} [2023-08-03 20:27:57,759 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2023-08-03 20:27:57,759 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 227 transitions, 3946 flow [2023-08-03 20:27:57,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:57,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:27:57,759 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:27:57,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-03 20:27:57,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-03 20:27:57,960 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:27:57,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:27:57,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1471681275, now seen corresponding path program 1 times [2023-08-03 20:27:57,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:27:57,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169983042] [2023-08-03 20:27:57,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:57,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:27:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 20:27:58,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:27:58,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169983042] [2023-08-03 20:27:58,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169983042] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:27:58,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702709019] [2023-08-03 20:27:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:27:58,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:27:58,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:27:58,154 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:27:58,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-03 20:27:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:27:58,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-03 20:27:58,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:27:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-03 20:27:58,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:27:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-03 20:27:58,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702709019] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:27:58,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:27:58,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 4 [2023-08-03 20:27:58,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561119780] [2023-08-03 20:27:58,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:27:58,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-03 20:27:58,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:27:58,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-03 20:27:58,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-03 20:27:58,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 248 [2023-08-03 20:27:58,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 227 transitions, 3946 flow. Second operand has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:27:58,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:27:58,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 248 [2023-08-03 20:27:58,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:28:05,537 INFO L124 PetriNetUnfolderBase]: 42255/56819 cut-off events. [2023-08-03 20:28:05,537 INFO L125 PetriNetUnfolderBase]: For 1165701/1195495 co-relation queries the response was YES. [2023-08-03 20:28:05,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426824 conditions, 56819 events. 42255/56819 cut-off events. For 1165701/1195495 co-relation queries the response was YES. Maximal size of possible extension queue 1548. Compared 331267 event pairs, 5000 based on Foata normal form. 11927/65600 useless extension candidates. Maximal degree in co-relation 425988. Up to 32897 conditions per place. [2023-08-03 20:28:06,097 INFO L140 encePairwiseOnDemand]: 242/248 looper letters, 232 selfloop transitions, 195 changer transitions 1/448 dead transitions. [2023-08-03 20:28:06,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 448 transitions, 8038 flow [2023-08-03 20:28:06,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:28:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:28:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 527 transitions. [2023-08-03 20:28:06,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2023-08-03 20:28:06,099 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 527 transitions. [2023-08-03 20:28:06,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 527 transitions. [2023-08-03 20:28:06,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:28:06,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 527 transitions. [2023-08-03 20:28:06,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:28:06,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:28:06,100 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:28:06,100 INFO L175 Difference]: Start difference. First operand has 117 places, 227 transitions, 3946 flow. Second operand 4 states and 527 transitions. [2023-08-03 20:28:06,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 448 transitions, 8038 flow [2023-08-03 20:28:07,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 448 transitions, 7493 flow, removed 210 selfloop flow, removed 2 redundant places. [2023-08-03 20:28:07,682 INFO L231 Difference]: Finished difference. Result has 119 places, 387 transitions, 7379 flow [2023-08-03 20:28:07,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=3637, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7379, PETRI_PLACES=119, PETRI_TRANSITIONS=387} [2023-08-03 20:28:07,683 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places. [2023-08-03 20:28:07,683 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 387 transitions, 7379 flow [2023-08-03 20:28:07,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:28:07,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:28:07,684 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:28:07,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-03 20:28:07,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-03 20:28:07,888 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:28:07,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:28:07,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1373594753, now seen corresponding path program 2 times [2023-08-03 20:28:07,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:28:07,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163905101] [2023-08-03 20:28:07,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:28:07,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:28:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:28:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:28:08,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:28:08,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163905101] [2023-08-03 20:28:08,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163905101] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:28:08,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274233369] [2023-08-03 20:28:08,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 20:28:08,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:28:08,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:28:08,078 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:28:08,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-03 20:28:08,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 20:28:08,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 20:28:08,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-03 20:28:08,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:28:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 20:28:08,342 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:28:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 20:28:08,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274233369] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:28:08,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:28:08,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-08-03 20:28:08,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126059786] [2023-08-03 20:28:08,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:28:08,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-03 20:28:08,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:28:08,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-03 20:28:08,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-08-03 20:28:08,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 248 [2023-08-03 20:28:08,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 387 transitions, 7379 flow. Second operand has 10 states, 10 states have (on average 111.6) internal successors, (1116), 10 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:28:08,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:28:08,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 248 [2023-08-03 20:28:08,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:28:25,329 INFO L124 PetriNetUnfolderBase]: 86006/117008 cut-off events. [2023-08-03 20:28:25,330 INFO L125 PetriNetUnfolderBase]: For 2563856/2589557 co-relation queries the response was YES. [2023-08-03 20:28:25,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933419 conditions, 117008 events. 86006/117008 cut-off events. For 2563856/2589557 co-relation queries the response was YES. Maximal size of possible extension queue 3095. Compared 765226 event pairs, 10085 based on Foata normal form. 15780/129549 useless extension candidates. Maximal degree in co-relation 932112. Up to 63154 conditions per place. [2023-08-03 20:28:26,627 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 284 selfloop transitions, 460 changer transitions 5/765 dead transitions. [2023-08-03 20:28:26,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 765 transitions, 14621 flow [2023-08-03 20:28:26,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 20:28:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 20:28:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 780 transitions. [2023-08-03 20:28:26,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5241935483870968 [2023-08-03 20:28:26,629 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 780 transitions. [2023-08-03 20:28:26,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 780 transitions. [2023-08-03 20:28:26,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:28:26,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 780 transitions. [2023-08-03 20:28:26,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:28:26,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:28:26,631 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:28:26,632 INFO L175 Difference]: Start difference. First operand has 119 places, 387 transitions, 7379 flow. Second operand 6 states and 780 transitions. [2023-08-03 20:28:26,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 765 transitions, 14621 flow [2023-08-03 20:28:36,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 765 transitions, 14621 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 20:28:36,455 INFO L231 Difference]: Finished difference. Result has 127 places, 652 transitions, 14490 flow [2023-08-03 20:28:36,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=7379, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=279, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=14490, PETRI_PLACES=127, PETRI_TRANSITIONS=652} [2023-08-03 20:28:36,456 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 86 predicate places. [2023-08-03 20:28:36,456 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 652 transitions, 14490 flow [2023-08-03 20:28:36,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 111.6) internal successors, (1116), 10 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:28:36,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:28:36,457 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:28:36,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-03 20:28:36,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:28:36,661 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:28:36,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:28:36,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1024463455, now seen corresponding path program 1 times [2023-08-03 20:28:36,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:28:36,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929157591] [2023-08-03 20:28:36,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:28:36,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:28:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:28:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 20:28:36,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:28:36,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929157591] [2023-08-03 20:28:36,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929157591] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:28:36,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855973602] [2023-08-03 20:28:36,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:28:36,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:28:36,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:28:36,836 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:28:36,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-03 20:28:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:28:36,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-03 20:28:36,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:28:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-03 20:28:37,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:28:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-03 20:28:37,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855973602] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:28:37,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:28:37,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2023-08-03 20:28:37,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015491368] [2023-08-03 20:28:37,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:28:37,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-03 20:28:37,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:28:37,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-03 20:28:37,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-08-03 20:28:37,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 248 [2023-08-03 20:28:37,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 652 transitions, 14490 flow. Second operand has 15 states, 15 states have (on average 103.73333333333333) internal successors, (1556), 15 states have internal predecessors, (1556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:28:37,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:28:37,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 248 [2023-08-03 20:28:37,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:30:43,154 INFO L124 PetriNetUnfolderBase]: 414495/589188 cut-off events. [2023-08-03 20:30:43,154 INFO L125 PetriNetUnfolderBase]: For 13224301/13259599 co-relation queries the response was YES. [2023-08-03 20:30:48,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4678564 conditions, 589188 events. 414495/589188 cut-off events. For 13224301/13259599 co-relation queries the response was YES. Maximal size of possible extension queue 15639. Compared 5039280 event pairs, 16575 based on Foata normal form. 52187/639344 useless extension candidates. Maximal degree in co-relation 4676203. Up to 258489 conditions per place. [2023-08-03 20:30:53,711 INFO L140 encePairwiseOnDemand]: 238/248 looper letters, 4367 selfloop transitions, 2469 changer transitions 275/7121 dead transitions. [2023-08-03 20:30:53,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 7121 transitions, 151553 flow [2023-08-03 20:30:53,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2023-08-03 20:30:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2023-08-03 20:30:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 12293 transitions. [2023-08-03 20:30:53,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47208141321044544 [2023-08-03 20:30:53,727 INFO L72 ComplementDD]: Start complementDD. Operand 105 states and 12293 transitions. [2023-08-03 20:30:53,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 12293 transitions. [2023-08-03 20:30:53,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:30:53,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 105 states and 12293 transitions. [2023-08-03 20:30:53,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 106 states, 105 states have (on average 117.07619047619048) internal successors, (12293), 105 states have internal predecessors, (12293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:30:53,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 106 states, 106 states have (on average 248.0) internal successors, (26288), 106 states have internal predecessors, (26288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:30:53,823 INFO L81 ComplementDD]: Finished complementDD. Result has 106 states, 106 states have (on average 248.0) internal successors, (26288), 106 states have internal predecessors, (26288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 20:30:53,837 INFO L175 Difference]: Start difference. First operand has 127 places, 652 transitions, 14490 flow. Second operand 105 states and 12293 transitions. [2023-08-03 20:30:53,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 7121 transitions, 151553 flow Received shutdown request... [2023-08-03 20:37:40,666 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-03 20:37:40,667 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-03 20:37:41,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-03 20:37:41,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown