/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 21:31:00,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 21:31:00,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 21:31:00,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 21:31:00,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 21:31:00,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 21:31:00,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 21:31:00,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 21:31:00,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 21:31:00,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 21:31:00,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 21:31:00,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 21:31:00,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 21:31:00,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 21:31:00,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 21:31:00,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 21:31:00,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 21:31:00,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 21:31:00,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 21:31:00,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 21:31:00,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 21:31:00,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 21:31:00,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 21:31:00,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 21:31:00,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 21:31:00,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 21:31:00,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 21:31:00,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 21:31:00,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 21:31:00,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 21:31:00,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 21:31:00,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 21:31:00,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 21:31:00,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 21:31:00,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 21:31:00,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 21:31:00,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 21:31:00,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 21:31:00,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 21:31:00,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 21:31:00,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 21:31:00,524 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 21:31:00,537 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 21:31:00,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 21:31:00,537 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 21:31:00,537 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 21:31:00,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 21:31:00,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 21:31:00,538 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 21:31:00,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 21:31:00,538 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 21:31:00,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 21:31:00,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 21:31:00,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 21:31:00,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 21:31:00,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 21:31:00,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 21:31:00,539 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 21:31:00,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 21:31:00,539 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 21:31:00,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 21:31:00,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 21:31:00,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 21:31:00,540 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 21:31:00,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 21:31:00,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 21:31:00,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 21:31:00,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 21:31:00,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 21:31:00,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 21:31:00,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 21:31:00,541 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 21:31:00,541 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 21:31:00,541 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-01-27 21:31:00,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 21:31:00,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 21:31:00,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 21:31:00,721 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 21:31:00,723 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 21:31:00,724 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-01-27 21:31:01,583 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 21:31:01,743 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 21:31:01,743 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-01-27 21:31:01,747 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07bbf4902/85c9e643c8ed4519a4ce38f2e9313c5f/FLAG9cf9ad2eb [2023-01-27 21:31:01,757 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07bbf4902/85c9e643c8ed4519a4ce38f2e9313c5f [2023-01-27 21:31:01,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 21:31:01,759 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 21:31:01,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 21:31:01,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 21:31:01,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 21:31:01,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 09:31:01" (1/1) ... [2023-01-27 21:31:01,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@597398a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:31:01, skipping insertion in model container [2023-01-27 21:31:01,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 09:31:01" (1/1) ... [2023-01-27 21:31:01,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 21:31:01,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 21:31:01,910 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2023-01-27 21:31:01,912 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 21:31:01,918 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 21:31:01,932 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2023-01-27 21:31:01,933 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 21:31:01,938 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 21:31:01,938 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 21:31:01,942 INFO L208 MainTranslator]: Completed translation [2023-01-27 21:31:01,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:31:01 WrapperNode [2023-01-27 21:31:01,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 21:31:01,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 21:31:01,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 21:31:01,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 21:31:01,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:31:01" (1/1) ... [2023-01-27 21:31:01,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:31:01" (1/1) ... [2023-01-27 21:31:01,966 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2023-01-27 21:31:01,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 21:31:01,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 21:31:01,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 21:31:01,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 21:31:01,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:31:01" (1/1) ... [2023-01-27 21:31:01,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:31:01" (1/1) ... [2023-01-27 21:31:01,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:31:01" (1/1) ... [2023-01-27 21:31:01,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:31:01" (1/1) ... [2023-01-27 21:31:01,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:31:01" (1/1) ... [2023-01-27 21:31:01,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:31:01" (1/1) ... [2023-01-27 21:31:01,982 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:31:01" (1/1) ... [2023-01-27 21:31:01,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:31:01" (1/1) ... [2023-01-27 21:31:01,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 21:31:01,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 21:31:01,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 21:31:01,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 21:31:01,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:31:01" (1/1) ... [2023-01-27 21:31:01,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 21:31:01,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:31:02,007 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-01-27 21:31:02,009 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-01-27 21:31:02,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 21:31:02,032 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 21:31:02,032 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 21:31:02,032 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 21:31:02,032 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 21:31:02,032 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-27 21:31:02,032 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-27 21:31:02,033 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-01-27 21:31:02,033 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-01-27 21:31:02,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 21:31:02,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 21:31:02,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 21:31:02,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 21:31:02,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 21:31:02,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 21:31:02,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 21:31:02,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 21:31:02,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 21:31:02,035 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 21:31:02,132 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 21:31:02,134 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 21:31:02,332 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 21:31:02,381 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 21:31:02,381 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-01-27 21:31:02,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 09:31:02 BoogieIcfgContainer [2023-01-27 21:31:02,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 21:31:02,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 21:31:02,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 21:31:02,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 21:31:02,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 09:31:01" (1/3) ... [2023-01-27 21:31:02,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e532cff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 09:31:02, skipping insertion in model container [2023-01-27 21:31:02,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:31:01" (2/3) ... [2023-01-27 21:31:02,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e532cff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 09:31:02, skipping insertion in model container [2023-01-27 21:31:02,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 09:31:02" (3/3) ... [2023-01-27 21:31:02,397 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2023-01-27 21:31:02,410 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 21:31:02,410 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 21:31:02,410 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 21:31:02,496 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-01-27 21:31:02,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 120 transitions, 272 flow [2023-01-27 21:31:02,572 INFO L130 PetriNetUnfolder]: 9/116 cut-off events. [2023-01-27 21:31:02,572 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-27 21:31:02,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 116 events. 9/116 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-01-27 21:31:02,577 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 120 transitions, 272 flow [2023-01-27 21:31:02,579 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 104 transitions, 232 flow [2023-01-27 21:31:02,582 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 21:31:02,587 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 104 transitions, 232 flow [2023-01-27 21:31:02,589 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 104 transitions, 232 flow [2023-01-27 21:31:02,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 104 transitions, 232 flow [2023-01-27 21:31:02,608 INFO L130 PetriNetUnfolder]: 9/104 cut-off events. [2023-01-27 21:31:02,608 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-27 21:31:02,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 104 events. 9/104 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-01-27 21:31:02,610 INFO L119 LiptonReduction]: Number of co-enabled transitions 2520 [2023-01-27 21:31:04,897 INFO L134 LiptonReduction]: Checked pairs total: 2606 [2023-01-27 21:31:04,898 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-01-27 21:31:04,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 21:31:04,918 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@26c15e5a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 21:31:04,918 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-27 21:31:04,924 INFO L130 PetriNetUnfolder]: 4/28 cut-off events. [2023-01-27 21:31:04,924 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-27 21:31:04,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:31:04,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:31:04,925 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:31:04,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:31:04,928 INFO L85 PathProgramCache]: Analyzing trace with hash -475984634, now seen corresponding path program 1 times [2023-01-27 21:31:04,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:31:04,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173607556] [2023-01-27 21:31:04,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:04,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:31:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:05,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:31:05,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173607556] [2023-01-27 21:31:05,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173607556] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:31:05,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:31:05,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 21:31:05,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814083431] [2023-01-27 21:31:05,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:31:05,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 21:31:05,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:31:05,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 21:31:05,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 21:31:05,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 202 [2023-01-27 21:31:05,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:05,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:31:05,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 202 [2023-01-27 21:31:05,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:31:05,462 INFO L130 PetriNetUnfolder]: 1537/1954 cut-off events. [2023-01-27 21:31:05,462 INFO L131 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2023-01-27 21:31:05,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4056 conditions, 1954 events. 1537/1954 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6355 event pairs, 141 based on Foata normal form. 1/1138 useless extension candidates. Maximal degree in co-relation 3091. Up to 1733 conditions per place. [2023-01-27 21:31:05,474 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 41 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2023-01-27 21:31:05,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 241 flow [2023-01-27 21:31:05,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 21:31:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 21:31:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-01-27 21:31:05,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5693069306930693 [2023-01-27 21:31:05,484 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-01-27 21:31:05,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-01-27 21:31:05,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:31:05,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-01-27 21:31:05,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:05,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:05,493 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:05,494 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 82 flow. Second operand 3 states and 345 transitions. [2023-01-27 21:31:05,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 241 flow [2023-01-27 21:31:05,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 51 transitions, 211 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-01-27 21:31:05,498 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 99 flow [2023-01-27 21:31:05,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=33, PETRI_TRANSITIONS=33} [2023-01-27 21:31:05,502 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2023-01-27 21:31:05,502 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 99 flow [2023-01-27 21:31:05,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:05,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:31:05,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:31:05,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 21:31:05,503 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:31:05,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:31:05,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2131273016, now seen corresponding path program 1 times [2023-01-27 21:31:05,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:31:05,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717643900] [2023-01-27 21:31:05,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:05,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:31:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:05,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:31:05,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717643900] [2023-01-27 21:31:05,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717643900] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:31:05,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:31:05,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:31:05,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770232633] [2023-01-27 21:31:05,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:31:05,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:31:05,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:31:05,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:31:05,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:31:05,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:31:05,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:05,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:31:05,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:31:05,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:31:05,902 INFO L130 PetriNetUnfolder]: 2645/3467 cut-off events. [2023-01-27 21:31:05,902 INFO L131 PetriNetUnfolder]: For 1092/1092 co-relation queries the response was YES. [2023-01-27 21:31:05,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8501 conditions, 3467 events. 2645/3467 cut-off events. For 1092/1092 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 15047 event pairs, 598 based on Foata normal form. 62/3529 useless extension candidates. Maximal degree in co-relation 2589. Up to 1576 conditions per place. [2023-01-27 21:31:05,919 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 86 selfloop transitions, 5 changer transitions 0/93 dead transitions. [2023-01-27 21:31:05,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 93 transitions, 461 flow [2023-01-27 21:31:05,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:31:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:31:05,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2023-01-27 21:31:05,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504950495049505 [2023-01-27 21:31:05,922 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2023-01-27 21:31:05,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2023-01-27 21:31:05,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:31:05,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2023-01-27 21:31:05,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:05,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:05,927 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:05,927 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 99 flow. Second operand 5 states and 510 transitions. [2023-01-27 21:31:05,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 93 transitions, 461 flow [2023-01-27 21:31:05,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 93 transitions, 448 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 21:31:05,930 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 129 flow [2023-01-27 21:31:05,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2023-01-27 21:31:05,931 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2023-01-27 21:31:05,931 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 129 flow [2023-01-27 21:31:05,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:05,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:31:05,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:31:05,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 21:31:05,932 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:31:05,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:31:05,933 INFO L85 PathProgramCache]: Analyzing trace with hash 134921043, now seen corresponding path program 1 times [2023-01-27 21:31:05,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:31:05,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44873888] [2023-01-27 21:31:05,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:05,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:31:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:06,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:06,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:31:06,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44873888] [2023-01-27 21:31:06,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44873888] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:31:06,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402188427] [2023-01-27 21:31:06,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:06,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:31:06,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:31:06,011 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-01-27 21:31:06,020 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-01-27 21:31:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:06,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-27 21:31:06,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:31:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:06,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:31:06,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:06,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402188427] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:31:06,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:31:06,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-01-27 21:31:06,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541370770] [2023-01-27 21:31:06,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:31:06,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 21:31:06,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:31:06,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 21:31:06,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-27 21:31:06,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:31:06,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 129 flow. Second operand has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:06,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:31:06,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:31:06,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:31:06,542 INFO L130 PetriNetUnfolder]: 3569/4785 cut-off events. [2023-01-27 21:31:06,543 INFO L131 PetriNetUnfolder]: For 3429/3842 co-relation queries the response was YES. [2023-01-27 21:31:06,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12910 conditions, 4785 events. 3569/4785 cut-off events. For 3429/3842 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 21796 event pairs, 436 based on Foata normal form. 523/5265 useless extension candidates. Maximal degree in co-relation 8290. Up to 1988 conditions per place. [2023-01-27 21:31:06,563 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 87 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2023-01-27 21:31:06,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 95 transitions, 523 flow [2023-01-27 21:31:06,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:31:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:31:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-01-27 21:31:06,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502970297029703 [2023-01-27 21:31:06,565 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-01-27 21:31:06,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-01-27 21:31:06,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:31:06,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-01-27 21:31:06,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:06,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:06,567 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:06,568 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 129 flow. Second operand 5 states and 508 transitions. [2023-01-27 21:31:06,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 95 transitions, 523 flow [2023-01-27 21:31:06,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 95 transitions, 504 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-27 21:31:06,571 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 159 flow [2023-01-27 21:31:06,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2023-01-27 21:31:06,572 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2023-01-27 21:31:06,572 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 159 flow [2023-01-27 21:31:06,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:06,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:31:06,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:31:06,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-27 21:31:06,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:31:06,778 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:31:06,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:31:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash -950453983, now seen corresponding path program 1 times [2023-01-27 21:31:06,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:31:06,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139642439] [2023-01-27 21:31:06,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:06,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:31:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:06,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:06,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:31:06,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139642439] [2023-01-27 21:31:06,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139642439] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:31:06,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468271279] [2023-01-27 21:31:06,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:06,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:31:06,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:31:06,841 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-01-27 21:31:06,843 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-01-27 21:31:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:06,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-27 21:31:06,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:31:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:06,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:31:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:06,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468271279] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:31:06,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:31:06,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-01-27 21:31:06,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211975981] [2023-01-27 21:31:06,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:31:06,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 21:31:06,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:31:06,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 21:31:06,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-27 21:31:06,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:31:06,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 159 flow. Second operand has 8 states, 8 states have (on average 90.0) internal successors, (720), 8 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:06,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:31:06,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:31:06,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:31:07,329 INFO L130 PetriNetUnfolder]: 3913/5227 cut-off events. [2023-01-27 21:31:07,329 INFO L131 PetriNetUnfolder]: For 6362/6627 co-relation queries the response was YES. [2023-01-27 21:31:07,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16167 conditions, 5227 events. 3913/5227 cut-off events. For 6362/6627 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 23233 event pairs, 852 based on Foata normal form. 365/5557 useless extension candidates. Maximal degree in co-relation 10491. Up to 2296 conditions per place. [2023-01-27 21:31:07,355 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 90 selfloop transitions, 7 changer transitions 0/100 dead transitions. [2023-01-27 21:31:07,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 100 transitions, 596 flow [2023-01-27 21:31:07,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:31:07,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:31:07,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2023-01-27 21:31:07,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504950495049505 [2023-01-27 21:31:07,357 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2023-01-27 21:31:07,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2023-01-27 21:31:07,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:31:07,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2023-01-27 21:31:07,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:07,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:07,360 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:07,360 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 159 flow. Second operand 5 states and 510 transitions. [2023-01-27 21:31:07,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 100 transitions, 596 flow [2023-01-27 21:31:07,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 100 transitions, 587 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-01-27 21:31:07,369 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 212 flow [2023-01-27 21:31:07,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-01-27 21:31:07,370 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2023-01-27 21:31:07,370 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 212 flow [2023-01-27 21:31:07,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.0) internal successors, (720), 8 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:07,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:31:07,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:31:07,375 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-01-27 21:31:07,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-01-27 21:31:07,576 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:31:07,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:31:07,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1864400695, now seen corresponding path program 2 times [2023-01-27 21:31:07,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:31:07,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055556705] [2023-01-27 21:31:07,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:07,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:31:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:07,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:31:07,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055556705] [2023-01-27 21:31:07,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055556705] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:31:07,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:31:07,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:31:07,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531104692] [2023-01-27 21:31:07,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:31:07,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:31:07,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:31:07,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:31:07,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:31:07,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:31:07,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:07,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:31:07,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:31:07,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:31:08,135 INFO L130 PetriNetUnfolder]: 5551/7498 cut-off events. [2023-01-27 21:31:08,135 INFO L131 PetriNetUnfolder]: For 14127/14505 co-relation queries the response was YES. [2023-01-27 21:31:08,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24955 conditions, 7498 events. 5551/7498 cut-off events. For 14127/14505 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 36765 event pairs, 1429 based on Foata normal form. 411/7848 useless extension candidates. Maximal degree in co-relation 15467. Up to 3703 conditions per place. [2023-01-27 21:31:08,166 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 94 selfloop transitions, 11 changer transitions 0/108 dead transitions. [2023-01-27 21:31:08,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 108 transitions, 703 flow [2023-01-27 21:31:08,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:31:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:31:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-01-27 21:31:08,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502970297029703 [2023-01-27 21:31:08,168 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-01-27 21:31:08,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-01-27 21:31:08,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:31:08,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-01-27 21:31:08,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:08,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:08,172 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:08,172 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 212 flow. Second operand 5 states and 508 transitions. [2023-01-27 21:31:08,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 108 transitions, 703 flow [2023-01-27 21:31:08,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 108 transitions, 689 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 21:31:08,184 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 269 flow [2023-01-27 21:31:08,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-01-27 21:31:08,185 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2023-01-27 21:31:08,186 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 269 flow [2023-01-27 21:31:08,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:08,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:31:08,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:31:08,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 21:31:08,187 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:31:08,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:31:08,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1282882796, now seen corresponding path program 2 times [2023-01-27 21:31:08,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:31:08,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874801182] [2023-01-27 21:31:08,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:08,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:31:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:08,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:31:08,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874801182] [2023-01-27 21:31:08,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874801182] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:31:08,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:31:08,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:31:08,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481004739] [2023-01-27 21:31:08,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:31:08,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:31:08,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:31:08,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:31:08,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:31:08,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:31:08,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 269 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:08,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:31:08,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:31:08,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:31:08,747 INFO L130 PetriNetUnfolder]: 5671/7868 cut-off events. [2023-01-27 21:31:08,748 INFO L131 PetriNetUnfolder]: For 25451/26949 co-relation queries the response was YES. [2023-01-27 21:31:08,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29008 conditions, 7868 events. 5671/7868 cut-off events. For 25451/26949 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 41212 event pairs, 1919 based on Foata normal form. 1586/9272 useless extension candidates. Maximal degree in co-relation 21702. Up to 4441 conditions per place. [2023-01-27 21:31:08,781 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 108 selfloop transitions, 6 changer transitions 0/120 dead transitions. [2023-01-27 21:31:08,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 120 transitions, 891 flow [2023-01-27 21:31:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:31:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:31:08,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-01-27 21:31:08,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502970297029703 [2023-01-27 21:31:08,783 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-01-27 21:31:08,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-01-27 21:31:08,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:31:08,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-01-27 21:31:08,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:08,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:08,786 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:08,786 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 269 flow. Second operand 5 states and 508 transitions. [2023-01-27 21:31:08,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 120 transitions, 891 flow [2023-01-27 21:31:08,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 120 transitions, 825 flow, removed 24 selfloop flow, removed 1 redundant places. [2023-01-27 21:31:08,800 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 291 flow [2023-01-27 21:31:08,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=248, 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=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-01-27 21:31:08,801 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2023-01-27 21:31:08,802 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 291 flow [2023-01-27 21:31:08,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:08,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:31:08,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:31:08,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 21:31:08,802 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:31:08,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:31:08,802 INFO L85 PathProgramCache]: Analyzing trace with hash -786111875, now seen corresponding path program 3 times [2023-01-27 21:31:08,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:31:08,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301806999] [2023-01-27 21:31:08,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:08,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:31:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:08,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:31:08,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301806999] [2023-01-27 21:31:08,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301806999] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:31:08,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235597424] [2023-01-27 21:31:08,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 21:31:08,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:31:08,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:31:08,866 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-01-27 21:31:08,868 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-01-27 21:31:08,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 21:31:08,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:31:08,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-27 21:31:08,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:31:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:08,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:31:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:08,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235597424] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:31:08,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:31:08,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-27 21:31:08,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179760574] [2023-01-27 21:31:08,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:31:08,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 21:31:08,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:31:08,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 21:31:08,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-01-27 21:31:08,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:31:08,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 291 flow. Second operand has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:08,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:31:08,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:31:08,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:31:09,816 INFO L130 PetriNetUnfolder]: 8386/11509 cut-off events. [2023-01-27 21:31:09,816 INFO L131 PetriNetUnfolder]: For 32012/33129 co-relation queries the response was YES. [2023-01-27 21:31:09,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43270 conditions, 11509 events. 8386/11509 cut-off events. For 32012/33129 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 62789 event pairs, 1876 based on Foata normal form. 1224/12563 useless extension candidates. Maximal degree in co-relation 28010. Up to 4315 conditions per place. [2023-01-27 21:31:09,885 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 152 selfloop transitions, 20 changer transitions 0/177 dead transitions. [2023-01-27 21:31:09,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 177 transitions, 1265 flow [2023-01-27 21:31:09,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 21:31:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 21:31:09,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 819 transitions. [2023-01-27 21:31:09,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068069306930693 [2023-01-27 21:31:09,887 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 819 transitions. [2023-01-27 21:31:09,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 819 transitions. [2023-01-27 21:31:09,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:31:09,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 819 transitions. [2023-01-27 21:31:09,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.375) internal successors, (819), 8 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:09,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:09,891 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:09,891 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 291 flow. Second operand 8 states and 819 transitions. [2023-01-27 21:31:09,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 177 transitions, 1265 flow [2023-01-27 21:31:09,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 177 transitions, 1223 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-01-27 21:31:09,924 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 466 flow [2023-01-27 21:31:09,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=466, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-01-27 21:31:09,925 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 32 predicate places. [2023-01-27 21:31:09,925 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 466 flow [2023-01-27 21:31:09,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:09,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:31:09,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:31:10,007 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-01-27 21:31:10,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:31:10,193 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:31:10,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:31:10,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1812859993, now seen corresponding path program 4 times [2023-01-27 21:31:10,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:31:10,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619859027] [2023-01-27 21:31:10,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:10,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:31:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:10,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:31:10,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619859027] [2023-01-27 21:31:10,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619859027] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:31:10,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:31:10,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:31:10,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813158027] [2023-01-27 21:31:10,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:31:10,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:31:10,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:31:10,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:31:10,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:31:10,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:31:10,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 466 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:10,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:31:10,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:31:10,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:31:11,188 INFO L130 PetriNetUnfolder]: 10374/14611 cut-off events. [2023-01-27 21:31:11,188 INFO L131 PetriNetUnfolder]: For 59618/61272 co-relation queries the response was YES. [2023-01-27 21:31:11,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57540 conditions, 14611 events. 10374/14611 cut-off events. For 59618/61272 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 85611 event pairs, 2227 based on Foata normal form. 1805/16079 useless extension candidates. Maximal degree in co-relation 50504. Up to 6194 conditions per place. [2023-01-27 21:31:11,263 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 137 selfloop transitions, 17 changer transitions 0/164 dead transitions. [2023-01-27 21:31:11,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 164 transitions, 1364 flow [2023-01-27 21:31:11,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 21:31:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 21:31:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2023-01-27 21:31:11,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5074257425742574 [2023-01-27 21:31:11,265 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 615 transitions. [2023-01-27 21:31:11,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 615 transitions. [2023-01-27 21:31:11,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:31:11,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 615 transitions. [2023-01-27 21:31:11,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:11,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:11,268 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:11,268 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 466 flow. Second operand 6 states and 615 transitions. [2023-01-27 21:31:11,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 164 transitions, 1364 flow [2023-01-27 21:31:11,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 164 transitions, 1326 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-01-27 21:31:11,333 INFO L231 Difference]: Finished difference. Result has 74 places, 72 transitions, 576 flow [2023-01-27 21:31:11,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=576, PETRI_PLACES=74, PETRI_TRANSITIONS=72} [2023-01-27 21:31:11,334 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2023-01-27 21:31:11,334 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 72 transitions, 576 flow [2023-01-27 21:31:11,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:11,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:31:11,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:31:11,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 21:31:11,335 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:31:11,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:31:11,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2097457269, now seen corresponding path program 5 times [2023-01-27 21:31:11,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:31:11,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858376546] [2023-01-27 21:31:11,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:11,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:31:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:11,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:31:11,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858376546] [2023-01-27 21:31:11,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858376546] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:31:11,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:31:11,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:31:11,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482672690] [2023-01-27 21:31:11,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:31:11,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:31:11,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:31:11,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:31:11,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:31:11,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:31:11,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 72 transitions, 576 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:11,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:31:11,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:31:11,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:31:12,416 INFO L130 PetriNetUnfolder]: 11079/15861 cut-off events. [2023-01-27 21:31:12,416 INFO L131 PetriNetUnfolder]: For 70431/72335 co-relation queries the response was YES. [2023-01-27 21:31:12,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64859 conditions, 15861 events. 11079/15861 cut-off events. For 70431/72335 co-relation queries the response was YES. Maximal size of possible extension queue 908. Compared 97497 event pairs, 2860 based on Foata normal form. 1937/17446 useless extension candidates. Maximal degree in co-relation 58035. Up to 6945 conditions per place. [2023-01-27 21:31:12,493 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 141 selfloop transitions, 11 changer transitions 0/162 dead transitions. [2023-01-27 21:31:12,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 162 transitions, 1461 flow [2023-01-27 21:31:12,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:31:12,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:31:12,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-01-27 21:31:12,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069306930693069 [2023-01-27 21:31:12,495 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-01-27 21:31:12,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-01-27 21:31:12,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:31:12,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-01-27 21:31:12,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:12,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:12,497 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:12,497 INFO L175 Difference]: Start difference. First operand has 74 places, 72 transitions, 576 flow. Second operand 5 states and 512 transitions. [2023-01-27 21:31:12,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 162 transitions, 1461 flow [2023-01-27 21:31:12,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 162 transitions, 1461 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 21:31:12,601 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 638 flow [2023-01-27 21:31:12,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=638, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2023-01-27 21:31:12,602 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2023-01-27 21:31:12,602 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 638 flow [2023-01-27 21:31:12,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:12,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:31:12,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:31:12,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 21:31:12,603 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:31:12,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:31:12,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1571815567, now seen corresponding path program 6 times [2023-01-27 21:31:12,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:31:12,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387912490] [2023-01-27 21:31:12,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:12,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:31:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:12,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:31:12,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387912490] [2023-01-27 21:31:12,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387912490] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:31:12,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587636043] [2023-01-27 21:31:12,650 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 21:31:12,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:31:12,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:31:12,651 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-01-27 21:31:12,760 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-01-27 21:31:12,811 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-27 21:31:12,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:31:12,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-27 21:31:12,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:31:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:12,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:31:12,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:12,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587636043] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:31:12,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:31:12,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-27 21:31:12,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051005974] [2023-01-27 21:31:12,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:31:12,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 21:31:12,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:31:12,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 21:31:12,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-01-27 21:31:12,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:31:12,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 638 flow. Second operand has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:12,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:31:12,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:31:12,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:31:13,182 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 698#(= thread3Thread1of1ForFork3_~i~2 0), Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-27 21:31:13,182 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-01-27 21:31:13,182 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-27 21:31:13,182 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-01-27 21:31:13,182 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-01-27 21:31:13,185 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), 73#$Ultimate##0true, Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-27 21:31:13,185 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-01-27 21:31:13,185 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-01-27 21:31:13,185 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-27 21:31:13,185 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-01-27 21:31:13,282 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 64#thread1EXITtrue, 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-27 21:31:13,282 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,282 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,282 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-27 21:31:13,282 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-27 21:31:13,284 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), 73#$Ultimate##0true, Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0), 64#thread1EXITtrue]) [2023-01-27 21:31:13,284 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,284 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-27 21:31:13,284 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-27 21:31:13,284 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,292 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 698#(= thread3Thread1of1ForFork3_~i~2 0), 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-27 21:31:13,292 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,292 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-27 21:31:13,292 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,292 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-27 21:31:13,293 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, 665#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-01-27 21:31:13,293 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,293 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-27 21:31:13,293 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,293 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-27 21:31:13,294 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-27 21:31:13,294 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,294 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,294 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-27 21:31:13,294 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-01-27 21:31:13,514 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 698#(= thread3Thread1of1ForFork3_~i~2 0), 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 64#thread1EXITtrue, 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-27 21:31:13,514 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,514 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,514 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,514 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,515 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0), 64#thread1EXITtrue]) [2023-01-27 21:31:13,515 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,515 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,515 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,515 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,519 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 48#L92-2true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), 73#$Ultimate##0true, Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-27 21:31:13,519 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,519 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,519 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,519 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,530 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 117#thread3EXITtrue, 10#L91-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-27 21:31:13,530 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,530 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,530 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,530 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,531 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 665#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-01-27 21:31:13,531 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,531 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,531 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,532 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,532 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-27 21:31:13,533 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,533 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,533 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,533 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,534 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 665#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 64#thread1EXITtrue]) [2023-01-27 21:31:13,534 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,534 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,535 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,535 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:13,678 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 117#thread3EXITtrue, 10#L91-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0), 64#thread1EXITtrue]) [2023-01-27 21:31:13,678 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,678 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,678 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,678 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,680 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0), 64#thread1EXITtrue]) [2023-01-27 21:31:13,680 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,680 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,680 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,680 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,681 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 48#L92-2true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-27 21:31:13,681 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,681 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,682 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,682 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,683 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), 73#$Ultimate##0true, Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-27 21:31:13,684 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,684 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,684 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,684 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,692 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 117#thread3EXITtrue, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-27 21:31:13,692 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,692 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,692 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,692 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,693 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 665#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 64#thread1EXITtrue]) [2023-01-27 21:31:13,693 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,693 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,693 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,694 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:13,808 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 117#thread3EXITtrue, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0), 64#thread1EXITtrue]) [2023-01-27 21:31:13,808 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-27 21:31:13,809 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-27 21:31:13,809 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,809 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,810 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, 48#L92-2true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-27 21:31:13,810 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-27 21:31:13,810 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,810 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-27 21:31:13,810 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,812 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-27 21:31:13,812 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-27 21:31:13,812 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,812 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-27 21:31:13,812 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,819 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 665#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), 48#L92-2true, Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-01-27 21:31:13,819 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-27 21:31:13,819 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-27 21:31:13,820 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,820 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:13,901 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, 48#L92-2true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 117#thread3EXITtrue, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-27 21:31:13,901 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-27 21:31:13,901 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-27 21:31:13,902 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-27 21:31:13,902 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 21:31:13,902 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-27 21:31:13,902 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-27 21:31:13,902 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-27 21:31:13,903 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 21:31:13,903 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-27 21:31:13,908 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][33], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 665#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-01-27 21:31:13,908 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-27 21:31:13,908 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 21:31:13,908 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-27 21:31:13,909 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-27 21:31:13,972 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_39 |v_thread2Thread1of1ForFork2_~i~1#1_21|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_21|, ~N~0=v_~N~0_39, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][13], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 696#true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 472#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 9#thread2EXITtrue, Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 117#thread3EXITtrue, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 528#(<= 0 thread1Thread1of1ForFork0_~i~0)]) [2023-01-27 21:31:13,972 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-27 21:31:13,972 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 21:31:13,973 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 21:31:13,973 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-27 21:31:14,185 INFO L130 PetriNetUnfolder]: 12225/17299 cut-off events. [2023-01-27 21:31:14,186 INFO L131 PetriNetUnfolder]: For 90018/91284 co-relation queries the response was YES. [2023-01-27 21:31:14,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74018 conditions, 17299 events. 12225/17299 cut-off events. For 90018/91284 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 103390 event pairs, 3391 based on Foata normal form. 1383/18291 useless extension candidates. Maximal degree in co-relation 60175. Up to 6942 conditions per place. [2023-01-27 21:31:14,271 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 119 selfloop transitions, 31 changer transitions 0/157 dead transitions. [2023-01-27 21:31:14,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 157 transitions, 1499 flow [2023-01-27 21:31:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:31:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:31:14,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-01-27 21:31:14,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099009900990099 [2023-01-27 21:31:14,273 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-01-27 21:31:14,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-01-27 21:31:14,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:31:14,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-01-27 21:31:14,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:14,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:14,275 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:14,275 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 638 flow. Second operand 5 states and 515 transitions. [2023-01-27 21:31:14,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 157 transitions, 1499 flow [2023-01-27 21:31:14,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 157 transitions, 1460 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 21:31:14,370 INFO L231 Difference]: Finished difference. Result has 85 places, 85 transitions, 875 flow [2023-01-27 21:31:14,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=875, PETRI_PLACES=85, PETRI_TRANSITIONS=85} [2023-01-27 21:31:14,370 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 47 predicate places. [2023-01-27 21:31:14,370 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 85 transitions, 875 flow [2023-01-27 21:31:14,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:14,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:31:14,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:31:14,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-27 21:31:14,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:31:14,576 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:31:14,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:31:14,576 INFO L85 PathProgramCache]: Analyzing trace with hash -212221697, now seen corresponding path program 1 times [2023-01-27 21:31:14,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:31:14,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124637212] [2023-01-27 21:31:14,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:14,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:31:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:14,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:31:14,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124637212] [2023-01-27 21:31:14,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124637212] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:31:14,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:31:14,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:31:14,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980579699] [2023-01-27 21:31:14,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:31:14,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:31:14,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:31:14,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:31:14,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:31:14,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:31:14,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 85 transitions, 875 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:14,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:31:14,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:31:14,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:31:16,217 INFO L130 PetriNetUnfolder]: 15528/22702 cut-off events. [2023-01-27 21:31:16,217 INFO L131 PetriNetUnfolder]: For 139262/141033 co-relation queries the response was YES. [2023-01-27 21:31:16,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102188 conditions, 22702 events. 15528/22702 cut-off events. For 139262/141033 co-relation queries the response was YES. Maximal size of possible extension queue 1142. Compared 147110 event pairs, 3078 based on Foata normal form. 1878/24441 useless extension candidates. Maximal degree in co-relation 85103. Up to 7619 conditions per place. [2023-01-27 21:31:16,345 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 161 selfloop transitions, 52 changer transitions 4/226 dead transitions. [2023-01-27 21:31:16,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 226 transitions, 2528 flow [2023-01-27 21:31:16,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 21:31:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 21:31:16,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 607 transitions. [2023-01-27 21:31:16,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008250825082509 [2023-01-27 21:31:16,347 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 607 transitions. [2023-01-27 21:31:16,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 607 transitions. [2023-01-27 21:31:16,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:31:16,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 607 transitions. [2023-01-27 21:31:16,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:16,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:16,350 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:16,350 INFO L175 Difference]: Start difference. First operand has 85 places, 85 transitions, 875 flow. Second operand 6 states and 607 transitions. [2023-01-27 21:31:16,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 226 transitions, 2528 flow [2023-01-27 21:31:16,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 226 transitions, 2444 flow, removed 22 selfloop flow, removed 1 redundant places. [2023-01-27 21:31:16,608 INFO L231 Difference]: Finished difference. Result has 93 places, 114 transitions, 1322 flow [2023-01-27 21:31:16,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1322, PETRI_PLACES=93, PETRI_TRANSITIONS=114} [2023-01-27 21:31:16,608 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 55 predicate places. [2023-01-27 21:31:16,608 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 114 transitions, 1322 flow [2023-01-27 21:31:16,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:16,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:31:16,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:31:16,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 21:31:16,609 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:31:16,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:31:16,609 INFO L85 PathProgramCache]: Analyzing trace with hash 550303848, now seen corresponding path program 3 times [2023-01-27 21:31:16,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:31:16,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317858184] [2023-01-27 21:31:16,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:16,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:31:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:16,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:16,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:31:16,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317858184] [2023-01-27 21:31:16,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317858184] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:31:16,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:31:16,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:31:16,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556322636] [2023-01-27 21:31:16,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:31:16,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:31:16,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:31:16,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:31:16,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:31:16,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:31:16,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 114 transitions, 1322 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:16,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:31:16,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:31:16,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:31:17,445 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-27 21:31:17,445 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2023-01-27 21:31:17,445 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-01-27 21:31:17,445 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-01-27 21:31:17,445 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-01-27 21:31:17,462 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 82#thread4EXITtrue, Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-27 21:31:17,462 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-27 21:31:17,463 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:17,463 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:17,463 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-27 21:31:17,763 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 671#true, 698#(= thread3Thread1of1ForFork3_~i~2 0), Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 64#thread1EXITtrue, 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-27 21:31:17,763 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2023-01-27 21:31:17,763 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-01-27 21:31:17,763 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-01-27 21:31:17,763 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-01-27 21:31:17,776 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 82#thread4EXITtrue, Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 10#L91-4true, 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 64#thread1EXITtrue, 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-27 21:31:17,777 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-27 21:31:17,777 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:17,777 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:17,777 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:17,791 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-27 21:31:17,791 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2023-01-27 21:31:17,791 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-01-27 21:31:17,791 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-01-27 21:31:17,791 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-01-27 21:31:17,806 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 101#L41-4true, 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 82#thread4EXITtrue, Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-27 21:31:17,806 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-27 21:31:17,806 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:17,806 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:17,806 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-27 21:31:18,175 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 671#true, 698#(= thread3Thread1of1ForFork3_~i~2 0), 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 64#thread1EXITtrue, 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-27 21:31:18,175 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is not cut-off event [2023-01-27 21:31:18,176 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-01-27 21:31:18,176 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-01-27 21:31:18,176 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-01-27 21:31:18,188 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, 84#L92-1true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 82#thread4EXITtrue, Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 64#thread1EXITtrue, 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-27 21:31:18,188 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-27 21:31:18,188 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:18,188 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:18,188 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:18,189 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), 48#L92-2true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-27 21:31:18,189 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-01-27 21:31:18,189 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:18,189 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:18,189 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-01-27 21:31:18,404 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), 48#L92-2true, Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 82#thread4EXITtrue, Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-27 21:31:18,404 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-27 21:31:18,404 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-27 21:31:18,404 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-27 21:31:18,404 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-27 21:31:18,404 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [42#L72-4true, Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-27 21:31:18,404 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-27 21:31:18,405 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-27 21:31:18,405 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-27 21:31:18,405 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-27 21:31:18,672 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([445] L51-4-->L51-4: Formula: (and (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_24| 1) |v_thread2Thread1of1ForFork2_~i~1#1_23|) (< |v_thread2Thread1of1ForFork2_~i~1#1_24| v_~N~0_47) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (= v_~counter1~0_57 (+ v_~counter1~0_56 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (< 0 v_~counter1~0_57) 1 0)) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|))) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_24|, ~counter1~0=v_~counter1~0_57, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_9|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_17|, ~counter1~0=v_~counter1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#t~post3#1, ~counter1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][25], [Black: 129#(= ~counter2~0 ~counter1~0), 33#L51-4true, 304#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 698#(= thread3Thread1of1ForFork3_~i~2 0), 671#true, Black: 140#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 138#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 134#(= thread1Thread1of1ForFork0_~i~0 0), 90#L93-1true, 874#true, Black: 470#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), 864#(= thread3Thread1of1ForFork3_~i~2 0), Black: 504#(= thread1Thread1of1ForFork0_~i~0 0), Black: 699#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 505#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), 82#thread4EXITtrue, Black: 857#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 663#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 482#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 865#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 868#(and (= thread3Thread1of1ForFork3_~i~2 0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (<= ~N~0 0)), 478#(= thread3Thread1of1ForFork3_~i~2 0), Black: 484#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 674#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 866#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 0)), Black: 677#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 40#L62-4true, Black: 497#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 495#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), Black: 491#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 306#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), Black: 691#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 688#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 532#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork3_~i~2 0))]) [2023-01-27 21:31:18,672 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-27 21:31:18,672 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 21:31:18,672 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 21:31:18,672 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-27 21:31:18,980 INFO L130 PetriNetUnfolder]: 20473/29469 cut-off events. [2023-01-27 21:31:18,980 INFO L131 PetriNetUnfolder]: For 236429/240162 co-relation queries the response was YES. [2023-01-27 21:31:19,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147314 conditions, 29469 events. 20473/29469 cut-off events. For 236429/240162 co-relation queries the response was YES. Maximal size of possible extension queue 1691. Compared 196382 event pairs, 4703 based on Foata normal form. 4146/33372 useless extension candidates. Maximal degree in co-relation 127841. Up to 12333 conditions per place. [2023-01-27 21:31:19,177 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 246 selfloop transitions, 47 changer transitions 1/303 dead transitions. [2023-01-27 21:31:19,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 303 transitions, 4000 flow [2023-01-27 21:31:19,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 21:31:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 21:31:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 601 transitions. [2023-01-27 21:31:19,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49587458745874585 [2023-01-27 21:31:19,181 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 601 transitions. [2023-01-27 21:31:19,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 601 transitions. [2023-01-27 21:31:19,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:31:19,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 601 transitions. [2023-01-27 21:31:19,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:19,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:19,184 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:19,184 INFO L175 Difference]: Start difference. First operand has 93 places, 114 transitions, 1322 flow. Second operand 6 states and 601 transitions. [2023-01-27 21:31:19,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 303 transitions, 4000 flow [2023-01-27 21:31:19,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 303 transitions, 3992 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-01-27 21:31:19,925 INFO L231 Difference]: Finished difference. Result has 102 places, 147 transitions, 1986 flow [2023-01-27 21:31:19,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1986, PETRI_PLACES=102, PETRI_TRANSITIONS=147} [2023-01-27 21:31:19,925 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 64 predicate places. [2023-01-27 21:31:19,926 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 147 transitions, 1986 flow [2023-01-27 21:31:19,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:19,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:31:19,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:31:19,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 21:31:19,926 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:31:19,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:31:19,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1556227291, now seen corresponding path program 2 times [2023-01-27 21:31:19,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:31:19,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200820563] [2023-01-27 21:31:19,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:19,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:31:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:19,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:31:19,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200820563] [2023-01-27 21:31:19,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200820563] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:31:19,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:31:19,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:31:19,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251286181] [2023-01-27 21:31:19,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:31:19,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:31:19,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:31:19,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:31:19,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:31:19,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:31:19,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 147 transitions, 1986 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:19,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:31:19,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:31:19,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:31:22,391 INFO L130 PetriNetUnfolder]: 19448/28253 cut-off events. [2023-01-27 21:31:22,391 INFO L131 PetriNetUnfolder]: For 276671/281367 co-relation queries the response was YES. [2023-01-27 21:31:22,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152388 conditions, 28253 events. 19448/28253 cut-off events. For 276671/281367 co-relation queries the response was YES. Maximal size of possible extension queue 1625. Compared 190687 event pairs, 4561 based on Foata normal form. 3786/31525 useless extension candidates. Maximal degree in co-relation 130869. Up to 13463 conditions per place. [2023-01-27 21:31:22,602 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 268 selfloop transitions, 41 changer transitions 11/337 dead transitions. [2023-01-27 21:31:22,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 337 transitions, 4694 flow [2023-01-27 21:31:22,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 21:31:22,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 21:31:22,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 613 transitions. [2023-01-27 21:31:22,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057755775577558 [2023-01-27 21:31:22,604 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 613 transitions. [2023-01-27 21:31:22,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 613 transitions. [2023-01-27 21:31:22,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:31:22,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 613 transitions. [2023-01-27 21:31:22,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:22,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:22,740 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:22,741 INFO L175 Difference]: Start difference. First operand has 102 places, 147 transitions, 1986 flow. Second operand 6 states and 613 transitions. [2023-01-27 21:31:22,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 337 transitions, 4694 flow [2023-01-27 21:31:23,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 337 transitions, 4592 flow, removed 51 selfloop flow, removed 0 redundant places. [2023-01-27 21:31:23,534 INFO L231 Difference]: Finished difference. Result has 110 places, 172 transitions, 2600 flow [2023-01-27 21:31:23,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1964, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2600, PETRI_PLACES=110, PETRI_TRANSITIONS=172} [2023-01-27 21:31:23,534 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 72 predicate places. [2023-01-27 21:31:23,534 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 172 transitions, 2600 flow [2023-01-27 21:31:23,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:23,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:31:23,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:31:23,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 21:31:23,535 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:31:23,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:31:23,535 INFO L85 PathProgramCache]: Analyzing trace with hash 371724395, now seen corresponding path program 3 times [2023-01-27 21:31:23,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:31:23,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559463534] [2023-01-27 21:31:23,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:23,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:31:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:23,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:31:23,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559463534] [2023-01-27 21:31:23,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559463534] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:31:23,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:31:23,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:31:23,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500958284] [2023-01-27 21:31:23,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:31:23,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:31:23,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:31:23,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:31:23,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:31:23,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:31:23,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 172 transitions, 2600 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:23,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:31:23,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:31:23,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:31:26,858 INFO L130 PetriNetUnfolder]: 23525/35070 cut-off events. [2023-01-27 21:31:26,858 INFO L131 PetriNetUnfolder]: For 340488/342579 co-relation queries the response was YES. [2023-01-27 21:31:27,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192742 conditions, 35070 events. 23525/35070 cut-off events. For 340488/342579 co-relation queries the response was YES. Maximal size of possible extension queue 1887. Compared 250497 event pairs, 5250 based on Foata normal form. 2789/37354 useless extension candidates. Maximal degree in co-relation 164072. Up to 14042 conditions per place. [2023-01-27 21:31:27,110 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 283 selfloop transitions, 48 changer transitions 22/390 dead transitions. [2023-01-27 21:31:27,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 390 transitions, 5724 flow [2023-01-27 21:31:27,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 21:31:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 21:31:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2023-01-27 21:31:27,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041254125412541 [2023-01-27 21:31:27,112 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 611 transitions. [2023-01-27 21:31:27,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 611 transitions. [2023-01-27 21:31:27,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:31:27,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 611 transitions. [2023-01-27 21:31:27,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 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-01-27 21:31:27,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:27,114 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:27,115 INFO L175 Difference]: Start difference. First operand has 110 places, 172 transitions, 2600 flow. Second operand 6 states and 611 transitions. [2023-01-27 21:31:27,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 390 transitions, 5724 flow [2023-01-27 21:31:28,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 390 transitions, 5605 flow, removed 42 selfloop flow, removed 2 redundant places. [2023-01-27 21:31:28,709 INFO L231 Difference]: Finished difference. Result has 117 places, 211 transitions, 3311 flow [2023-01-27 21:31:28,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=2529, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3311, PETRI_PLACES=117, PETRI_TRANSITIONS=211} [2023-01-27 21:31:28,710 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 79 predicate places. [2023-01-27 21:31:28,710 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 211 transitions, 3311 flow [2023-01-27 21:31:28,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:28,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:31:28,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:31:28,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-27 21:31:28,710 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:31:28,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:31:28,710 INFO L85 PathProgramCache]: Analyzing trace with hash 153042763, now seen corresponding path program 4 times [2023-01-27 21:31:28,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:31:28,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576386473] [2023-01-27 21:31:28,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:28,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:31:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:28,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:31:28,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576386473] [2023-01-27 21:31:28,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576386473] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:31:28,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:31:28,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:31:28,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690867408] [2023-01-27 21:31:28,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:31:28,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:31:28,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:31:28,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:31:28,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:31:28,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:31:28,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 211 transitions, 3311 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:28,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:31:28,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:31:28,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:31:32,736 INFO L130 PetriNetUnfolder]: 26685/40089 cut-off events. [2023-01-27 21:31:32,737 INFO L131 PetriNetUnfolder]: For 493723/496874 co-relation queries the response was YES. [2023-01-27 21:31:32,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232960 conditions, 40089 events. 26685/40089 cut-off events. For 493723/496874 co-relation queries the response was YES. Maximal size of possible extension queue 2213. Compared 292880 event pairs, 6666 based on Foata normal form. 3099/42875 useless extension candidates. Maximal degree in co-relation 198842. Up to 17529 conditions per place. [2023-01-27 21:31:33,232 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 337 selfloop transitions, 48 changer transitions 20/442 dead transitions. [2023-01-27 21:31:33,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 442 transitions, 7325 flow [2023-01-27 21:31:33,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:31:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:31:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-01-27 21:31:33,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.498019801980198 [2023-01-27 21:31:33,234 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-01-27 21:31:33,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-01-27 21:31:33,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:31:33,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-01-27 21:31:33,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:33,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:33,236 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:33,236 INFO L175 Difference]: Start difference. First operand has 117 places, 211 transitions, 3311 flow. Second operand 5 states and 503 transitions. [2023-01-27 21:31:33,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 442 transitions, 7325 flow [2023-01-27 21:31:36,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 442 transitions, 7257 flow, removed 34 selfloop flow, removed 0 redundant places. [2023-01-27 21:31:36,560 INFO L231 Difference]: Finished difference. Result has 124 places, 240 transitions, 3899 flow [2023-01-27 21:31:36,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=3273, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3899, PETRI_PLACES=124, PETRI_TRANSITIONS=240} [2023-01-27 21:31:36,561 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 86 predicate places. [2023-01-27 21:31:36,561 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 240 transitions, 3899 flow [2023-01-27 21:31:36,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:36,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:31:36,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:31:36,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-27 21:31:36,561 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:31:36,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:31:36,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1733936133, now seen corresponding path program 5 times [2023-01-27 21:31:36,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:31:36,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069686621] [2023-01-27 21:31:36,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:36,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:31:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:36,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:36,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:31:36,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069686621] [2023-01-27 21:31:36,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069686621] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:31:36,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:31:36,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:31:36,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248981832] [2023-01-27 21:31:36,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:31:36,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:31:36,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:31:36,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:31:36,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:31:36,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:31:36,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 240 transitions, 3899 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:36,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:31:36,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:31:36,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:31:40,823 INFO L130 PetriNetUnfolder]: 26719/40118 cut-off events. [2023-01-27 21:31:40,823 INFO L131 PetriNetUnfolder]: For 567927/573002 co-relation queries the response was YES. [2023-01-27 21:31:41,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251915 conditions, 40118 events. 26719/40118 cut-off events. For 567927/573002 co-relation queries the response was YES. Maximal size of possible extension queue 2456. Compared 296876 event pairs, 7549 based on Foata normal form. 4098/43649 useless extension candidates. Maximal degree in co-relation 214000. Up to 15734 conditions per place. [2023-01-27 21:31:41,174 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 257 selfloop transitions, 75 changer transitions 8/362 dead transitions. [2023-01-27 21:31:41,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 362 transitions, 5973 flow [2023-01-27 21:31:41,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:31:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:31:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-01-27 21:31:41,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099009900990099 [2023-01-27 21:31:41,175 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-01-27 21:31:41,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-01-27 21:31:41,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:31:41,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-01-27 21:31:41,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:41,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:41,177 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:41,177 INFO L175 Difference]: Start difference. First operand has 124 places, 240 transitions, 3899 flow. Second operand 5 states and 515 transitions. [2023-01-27 21:31:41,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 362 transitions, 5973 flow [2023-01-27 21:31:44,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 362 transitions, 5904 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-01-27 21:31:44,086 INFO L231 Difference]: Finished difference. Result has 128 places, 246 transitions, 4156 flow [2023-01-27 21:31:44,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=3859, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4156, PETRI_PLACES=128, PETRI_TRANSITIONS=246} [2023-01-27 21:31:44,086 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 90 predicate places. [2023-01-27 21:31:44,086 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 246 transitions, 4156 flow [2023-01-27 21:31:44,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:44,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:31:44,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:31:44,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-27 21:31:44,087 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:31:44,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:31:44,087 INFO L85 PathProgramCache]: Analyzing trace with hash 724866881, now seen corresponding path program 2 times [2023-01-27 21:31:44,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:31:44,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718477051] [2023-01-27 21:31:44,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:44,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:31:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:44,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:44,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:31:44,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718477051] [2023-01-27 21:31:44,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718477051] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:31:44,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180579428] [2023-01-27 21:31:44,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 21:31:44,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:31:44,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:31:44,143 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-01-27 21:31:44,145 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-01-27 21:31:44,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 21:31:44,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:31:44,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-27 21:31:44,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:31:44,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:44,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:31:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:44,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180579428] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:31:44,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:31:44,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-01-27 21:31:44,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513588676] [2023-01-27 21:31:44,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:31:44,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 21:31:44,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:31:44,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 21:31:44,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-27 21:31:44,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:31:44,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 246 transitions, 4156 flow. Second operand has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:44,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:31:44,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:31:44,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:31:48,734 INFO L130 PetriNetUnfolder]: 28102/42070 cut-off events. [2023-01-27 21:31:48,734 INFO L131 PetriNetUnfolder]: For 584259/587926 co-relation queries the response was YES. [2023-01-27 21:31:49,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266787 conditions, 42070 events. 28102/42070 cut-off events. For 584259/587926 co-relation queries the response was YES. Maximal size of possible extension queue 2565. Compared 313697 event pairs, 4899 based on Foata normal form. 2906/44097 useless extension candidates. Maximal degree in co-relation 229533. Up to 26800 conditions per place. [2023-01-27 21:31:49,130 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 282 selfloop transitions, 74 changer transitions 17/390 dead transitions. [2023-01-27 21:31:49,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 390 transitions, 6870 flow [2023-01-27 21:31:49,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:31:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:31:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 502 transitions. [2023-01-27 21:31:49,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.497029702970297 [2023-01-27 21:31:49,131 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 502 transitions. [2023-01-27 21:31:49,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 502 transitions. [2023-01-27 21:31:49,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:31:49,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 502 transitions. [2023-01-27 21:31:49,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.4) internal successors, (502), 5 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-01-27 21:31:49,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:49,134 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:49,134 INFO L175 Difference]: Start difference. First operand has 128 places, 246 transitions, 4156 flow. Second operand 5 states and 502 transitions. [2023-01-27 21:31:49,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 390 transitions, 6870 flow [2023-01-27 21:31:53,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 390 transitions, 6701 flow, removed 26 selfloop flow, removed 2 redundant places. [2023-01-27 21:31:53,046 INFO L231 Difference]: Finished difference. Result has 132 places, 257 transitions, 4529 flow [2023-01-27 21:31:53,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=4043, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4529, PETRI_PLACES=132, PETRI_TRANSITIONS=257} [2023-01-27 21:31:53,046 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 94 predicate places. [2023-01-27 21:31:53,046 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 257 transitions, 4529 flow [2023-01-27 21:31:53,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:53,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:31:53,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:31:53,051 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-01-27 21:31:53,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-27 21:31:53,249 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:31:53,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:31:53,249 INFO L85 PathProgramCache]: Analyzing trace with hash 661454854, now seen corresponding path program 4 times [2023-01-27 21:31:53,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:31:53,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370016895] [2023-01-27 21:31:53,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:31:53,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:31:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:31:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:31:53,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:31:53,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370016895] [2023-01-27 21:31:53,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370016895] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:31:53,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:31:53,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:31:53,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495078063] [2023-01-27 21:31:53,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:31:53,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:31:53,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:31:53,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:31:53,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:31:53,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:31:53,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 257 transitions, 4529 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:53,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:31:53,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:31:53,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:31:57,668 INFO L130 PetriNetUnfolder]: 27022/40814 cut-off events. [2023-01-27 21:31:57,668 INFO L131 PetriNetUnfolder]: For 648539/653209 co-relation queries the response was YES. [2023-01-27 21:31:58,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260199 conditions, 40814 events. 27022/40814 cut-off events. For 648539/653209 co-relation queries the response was YES. Maximal size of possible extension queue 2518. Compared 306608 event pairs, 7155 based on Foata normal form. 4021/44368 useless extension candidates. Maximal degree in co-relation 221887. Up to 15876 conditions per place. [2023-01-27 21:31:58,207 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 273 selfloop transitions, 120 changer transitions 31/441 dead transitions. [2023-01-27 21:31:58,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 441 transitions, 8068 flow [2023-01-27 21:31:58,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:31:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:31:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 513 transitions. [2023-01-27 21:31:58,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079207920792079 [2023-01-27 21:31:58,208 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 513 transitions. [2023-01-27 21:31:58,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 513 transitions. [2023-01-27 21:31:58,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:31:58,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 513 transitions. [2023-01-27 21:31:58,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:58,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:58,210 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:31:58,210 INFO L175 Difference]: Start difference. First operand has 132 places, 257 transitions, 4529 flow. Second operand 5 states and 513 transitions. [2023-01-27 21:31:58,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 441 transitions, 8068 flow [2023-01-27 21:32:01,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 441 transitions, 7929 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-01-27 21:32:01,836 INFO L231 Difference]: Finished difference. Result has 137 places, 295 transitions, 5544 flow [2023-01-27 21:32:01,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=4420, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5544, PETRI_PLACES=137, PETRI_TRANSITIONS=295} [2023-01-27 21:32:01,836 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 99 predicate places. [2023-01-27 21:32:01,836 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 295 transitions, 5544 flow [2023-01-27 21:32:01,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:01,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:32:01,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:32:01,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-27 21:32:01,837 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:32:01,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:32:01,837 INFO L85 PathProgramCache]: Analyzing trace with hash -593576133, now seen corresponding path program 3 times [2023-01-27 21:32:01,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:32:01,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713383068] [2023-01-27 21:32:01,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:32:01,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:32:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:32:01,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:32:01,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:32:01,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713383068] [2023-01-27 21:32:01,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713383068] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:32:01,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:32:01,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:32:01,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943737809] [2023-01-27 21:32:01,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:32:01,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:32:01,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:32:01,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:32:01,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:32:01,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:32:01,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 295 transitions, 5544 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:01,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:32:01,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:32:01,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:32:07,255 INFO L130 PetriNetUnfolder]: 29877/44914 cut-off events. [2023-01-27 21:32:07,256 INFO L131 PetriNetUnfolder]: For 718125/722944 co-relation queries the response was YES. [2023-01-27 21:32:07,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295671 conditions, 44914 events. 29877/44914 cut-off events. For 718125/722944 co-relation queries the response was YES. Maximal size of possible extension queue 2839. Compared 340177 event pairs, 7513 based on Foata normal form. 3729/47583 useless extension candidates. Maximal degree in co-relation 256515. Up to 16539 conditions per place. [2023-01-27 21:32:07,627 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 294 selfloop transitions, 121 changer transitions 8/445 dead transitions. [2023-01-27 21:32:07,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 445 transitions, 8306 flow [2023-01-27 21:32:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:32:07,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:32:07,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2023-01-27 21:32:07,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138613861386139 [2023-01-27 21:32:07,628 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 519 transitions. [2023-01-27 21:32:07,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 519 transitions. [2023-01-27 21:32:07,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:32:07,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 519 transitions. [2023-01-27 21:32:07,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:07,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:07,630 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:07,630 INFO L175 Difference]: Start difference. First operand has 137 places, 295 transitions, 5544 flow. Second operand 5 states and 519 transitions. [2023-01-27 21:32:07,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 445 transitions, 8306 flow [2023-01-27 21:32:12,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 445 transitions, 8082 flow, removed 58 selfloop flow, removed 1 redundant places. [2023-01-27 21:32:12,363 INFO L231 Difference]: Finished difference. Result has 141 places, 307 transitions, 5912 flow [2023-01-27 21:32:12,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=5356, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5912, PETRI_PLACES=141, PETRI_TRANSITIONS=307} [2023-01-27 21:32:12,364 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 103 predicate places. [2023-01-27 21:32:12,364 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 307 transitions, 5912 flow [2023-01-27 21:32:12,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:12,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:32:12,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:32:12,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-01-27 21:32:12,364 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:32:12,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:32:12,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1280457636, now seen corresponding path program 5 times [2023-01-27 21:32:12,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:32:12,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996677503] [2023-01-27 21:32:12,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:32:12,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:32:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:32:12,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:32:12,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:32:12,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996677503] [2023-01-27 21:32:12,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996677503] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:32:12,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758767773] [2023-01-27 21:32:12,418 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 21:32:12,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:32:12,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:32:12,419 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-01-27 21:32:12,421 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-01-27 21:32:12,500 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 21:32:12,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:32:12,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-27 21:32:12,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:32:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:32:12,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:32:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:32:12,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758767773] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:32:12,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:32:12,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-01-27 21:32:12,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136616263] [2023-01-27 21:32:12,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:32:12,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 21:32:12,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:32:12,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 21:32:12,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-27 21:32:12,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:32:12,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 307 transitions, 5912 flow. Second operand has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:12,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:32:12,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:32:12,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:32:18,001 INFO L130 PetriNetUnfolder]: 30927/46403 cut-off events. [2023-01-27 21:32:18,001 INFO L131 PetriNetUnfolder]: For 782816/787508 co-relation queries the response was YES. [2023-01-27 21:32:18,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306594 conditions, 46403 events. 30927/46403 cut-off events. For 782816/787508 co-relation queries the response was YES. Maximal size of possible extension queue 2740. Compared 347457 event pairs, 6549 based on Foata normal form. 4025/50056 useless extension candidates. Maximal degree in co-relation 265828. Up to 27244 conditions per place. [2023-01-27 21:32:18,672 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 399 selfloop transitions, 64 changer transitions 22/502 dead transitions. [2023-01-27 21:32:18,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 502 transitions, 10330 flow [2023-01-27 21:32:18,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:32:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:32:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 498 transitions. [2023-01-27 21:32:18,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49306930693069306 [2023-01-27 21:32:18,674 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 498 transitions. [2023-01-27 21:32:18,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 498 transitions. [2023-01-27 21:32:18,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:32:18,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 498 transitions. [2023-01-27 21:32:18,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:18,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:18,676 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:18,676 INFO L175 Difference]: Start difference. First operand has 141 places, 307 transitions, 5912 flow. Second operand 5 states and 498 transitions. [2023-01-27 21:32:18,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 502 transitions, 10330 flow [2023-01-27 21:32:24,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 502 transitions, 9931 flow, removed 45 selfloop flow, removed 2 redundant places. [2023-01-27 21:32:24,730 INFO L231 Difference]: Finished difference. Result has 145 places, 331 transitions, 6445 flow [2023-01-27 21:32:24,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=5646, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6445, PETRI_PLACES=145, PETRI_TRANSITIONS=331} [2023-01-27 21:32:24,730 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 107 predicate places. [2023-01-27 21:32:24,730 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 331 transitions, 6445 flow [2023-01-27 21:32:24,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.75) internal successors, (718), 8 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:24,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:32:24,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:32:24,739 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-01-27 21:32:24,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:32:24,936 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:32:24,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:32:24,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1098078909, now seen corresponding path program 4 times [2023-01-27 21:32:24,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:32:24,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320596033] [2023-01-27 21:32:24,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:32:24,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:32:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:32:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:32:24,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:32:24,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320596033] [2023-01-27 21:32:24,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320596033] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:32:24,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:32:24,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:32:24,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082393119] [2023-01-27 21:32:24,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:32:24,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:32:24,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:32:24,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:32:24,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:32:24,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:32:24,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 331 transitions, 6445 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:24,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:32:24,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:32:24,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:32:30,890 INFO L130 PetriNetUnfolder]: 32086/48461 cut-off events. [2023-01-27 21:32:30,890 INFO L131 PetriNetUnfolder]: For 856277/861744 co-relation queries the response was YES. [2023-01-27 21:32:31,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323315 conditions, 48461 events. 32086/48461 cut-off events. For 856277/861744 co-relation queries the response was YES. Maximal size of possible extension queue 3140. Compared 373632 event pairs, 7386 based on Foata normal form. 4189/51590 useless extension candidates. Maximal degree in co-relation 283420. Up to 18163 conditions per place. [2023-01-27 21:32:31,417 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 249 selfloop transitions, 147 changer transitions 23/441 dead transitions. [2023-01-27 21:32:31,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 441 transitions, 8570 flow [2023-01-27 21:32:31,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:32:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:32:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-01-27 21:32:31,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069306930693069 [2023-01-27 21:32:31,418 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-01-27 21:32:31,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-01-27 21:32:31,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:32:31,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-01-27 21:32:31,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:31,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:31,420 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:31,420 INFO L175 Difference]: Start difference. First operand has 145 places, 331 transitions, 6445 flow. Second operand 5 states and 512 transitions. [2023-01-27 21:32:31,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 441 transitions, 8570 flow [2023-01-27 21:32:36,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 441 transitions, 8442 flow, removed 25 selfloop flow, removed 3 redundant places. [2023-01-27 21:32:36,183 INFO L231 Difference]: Finished difference. Result has 148 places, 334 transitions, 6718 flow [2023-01-27 21:32:36,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=6328, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6718, PETRI_PLACES=148, PETRI_TRANSITIONS=334} [2023-01-27 21:32:36,184 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 110 predicate places. [2023-01-27 21:32:36,184 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 334 transitions, 6718 flow [2023-01-27 21:32:36,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:36,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:32:36,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:32:36,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-01-27 21:32:36,184 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:32:36,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:32:36,184 INFO L85 PathProgramCache]: Analyzing trace with hash -75263484, now seen corresponding path program 6 times [2023-01-27 21:32:36,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:32:36,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551960975] [2023-01-27 21:32:36,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:32:36,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:32:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:32:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:32:36,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:32:36,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551960975] [2023-01-27 21:32:36,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551960975] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:32:36,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:32:36,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:32:36,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773300307] [2023-01-27 21:32:36,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:32:36,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:32:36,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:32:36,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:32:36,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:32:36,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:32:36,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 334 transitions, 6718 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:36,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:32:36,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:32:36,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:32:42,285 INFO L130 PetriNetUnfolder]: 31442/47939 cut-off events. [2023-01-27 21:32:42,285 INFO L131 PetriNetUnfolder]: For 864160/866898 co-relation queries the response was YES. [2023-01-27 21:32:42,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318852 conditions, 47939 events. 31442/47939 cut-off events. For 864160/866898 co-relation queries the response was YES. Maximal size of possible extension queue 2788. Compared 371200 event pairs, 6897 based on Foata normal form. 2516/50112 useless extension candidates. Maximal degree in co-relation 283808. Up to 18393 conditions per place. [2023-01-27 21:32:42,769 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 403 selfloop transitions, 104 changer transitions 73/617 dead transitions. [2023-01-27 21:32:42,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 617 transitions, 12476 flow [2023-01-27 21:32:42,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 21:32:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 21:32:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2023-01-27 21:32:42,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4991749174917492 [2023-01-27 21:32:42,770 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 605 transitions. [2023-01-27 21:32:42,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 605 transitions. [2023-01-27 21:32:42,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:32:42,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 605 transitions. [2023-01-27 21:32:42,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:42,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:42,772 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:42,772 INFO L175 Difference]: Start difference. First operand has 148 places, 334 transitions, 6718 flow. Second operand 6 states and 605 transitions. [2023-01-27 21:32:42,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 617 transitions, 12476 flow [2023-01-27 21:32:47,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 617 transitions, 12120 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-27 21:32:47,862 INFO L231 Difference]: Finished difference. Result has 155 places, 390 transitions, 7945 flow [2023-01-27 21:32:47,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=6438, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7945, PETRI_PLACES=155, PETRI_TRANSITIONS=390} [2023-01-27 21:32:47,863 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 117 predicate places. [2023-01-27 21:32:47,863 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 390 transitions, 7945 flow [2023-01-27 21:32:47,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:47,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:32:47,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:32:47,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-01-27 21:32:47,863 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:32:47,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:32:47,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1821063516, now seen corresponding path program 7 times [2023-01-27 21:32:47,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:32:47,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496360586] [2023-01-27 21:32:47,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:32:47,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:32:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:32:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:32:47,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:32:47,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496360586] [2023-01-27 21:32:47,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496360586] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:32:47,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:32:47,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:32:47,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092073636] [2023-01-27 21:32:47,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:32:47,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:32:47,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:32:47,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:32:47,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:32:47,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:32:47,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 390 transitions, 7945 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:47,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:32:47,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:32:47,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:32:54,157 INFO L130 PetriNetUnfolder]: 30968/46642 cut-off events. [2023-01-27 21:32:54,157 INFO L131 PetriNetUnfolder]: For 926450/929539 co-relation queries the response was YES. [2023-01-27 21:32:54,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331385 conditions, 46642 events. 30968/46642 cut-off events. For 926450/929539 co-relation queries the response was YES. Maximal size of possible extension queue 2795. Compared 349861 event pairs, 9053 based on Foata normal form. 2471/48755 useless extension candidates. Maximal degree in co-relation 295279. Up to 16874 conditions per place. [2023-01-27 21:32:54,699 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 306 selfloop transitions, 169 changer transitions 22/530 dead transitions. [2023-01-27 21:32:54,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 530 transitions, 11154 flow [2023-01-27 21:32:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:32:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:32:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-01-27 21:32:54,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501980198019802 [2023-01-27 21:32:54,700 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-01-27 21:32:54,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-01-27 21:32:54,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:32:54,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-01-27 21:32:54,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:54,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:54,702 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:32:54,702 INFO L175 Difference]: Start difference. First operand has 155 places, 390 transitions, 7945 flow. Second operand 5 states and 507 transitions. [2023-01-27 21:32:54,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 530 transitions, 11154 flow [2023-01-27 21:33:00,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 530 transitions, 11078 flow, removed 38 selfloop flow, removed 0 redundant places. [2023-01-27 21:33:00,604 INFO L231 Difference]: Finished difference. Result has 160 places, 409 transitions, 8720 flow [2023-01-27 21:33:00,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=7877, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8720, PETRI_PLACES=160, PETRI_TRANSITIONS=409} [2023-01-27 21:33:00,605 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 122 predicate places. [2023-01-27 21:33:00,605 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 409 transitions, 8720 flow [2023-01-27 21:33:00,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:00,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:33:00,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:33:00,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-01-27 21:33:00,606 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:33:00,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:33:00,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2013740015, now seen corresponding path program 5 times [2023-01-27 21:33:00,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:33:00,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243348912] [2023-01-27 21:33:00,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:33:00,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:33:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:33:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:33:00,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:33:00,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243348912] [2023-01-27 21:33:00,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243348912] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:33:00,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:33:00,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:33:00,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591910918] [2023-01-27 21:33:00,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:33:00,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:33:00,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:33:00,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:33:00,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:33:00,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:33:00,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 409 transitions, 8720 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:00,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:33:00,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:33:00,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:33:06,434 INFO L130 PetriNetUnfolder]: 27955/41862 cut-off events. [2023-01-27 21:33:06,434 INFO L131 PetriNetUnfolder]: For 940457/946048 co-relation queries the response was YES. [2023-01-27 21:33:07,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308888 conditions, 41862 events. 27955/41862 cut-off events. For 940457/946048 co-relation queries the response was YES. Maximal size of possible extension queue 2756. Compared 311318 event pairs, 7203 based on Foata normal form. 4581/45565 useless extension candidates. Maximal degree in co-relation 288644. Up to 18914 conditions per place. [2023-01-27 21:33:07,125 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 314 selfloop transitions, 185 changer transitions 30/551 dead transitions. [2023-01-27 21:33:07,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 551 transitions, 11826 flow [2023-01-27 21:33:07,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:33:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:33:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-01-27 21:33:07,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099009900990099 [2023-01-27 21:33:07,126 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-01-27 21:33:07,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-01-27 21:33:07,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:33:07,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-01-27 21:33:07,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:07,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:07,128 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:07,128 INFO L175 Difference]: Start difference. First operand has 160 places, 409 transitions, 8720 flow. Second operand 5 states and 515 transitions. [2023-01-27 21:33:07,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 551 transitions, 11826 flow [2023-01-27 21:33:11,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 551 transitions, 11392 flow, removed 45 selfloop flow, removed 3 redundant places. [2023-01-27 21:33:11,607 INFO L231 Difference]: Finished difference. Result has 162 places, 420 transitions, 9009 flow [2023-01-27 21:33:11,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=8292, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9009, PETRI_PLACES=162, PETRI_TRANSITIONS=420} [2023-01-27 21:33:11,608 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 124 predicate places. [2023-01-27 21:33:11,608 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 420 transitions, 9009 flow [2023-01-27 21:33:11,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:11,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:33:11,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:33:11,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-01-27 21:33:11,609 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:33:11,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:33:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash 328926055, now seen corresponding path program 6 times [2023-01-27 21:33:11,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:33:11,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052514517] [2023-01-27 21:33:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:33:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:33:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:33:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:33:11,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:33:11,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052514517] [2023-01-27 21:33:11,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052514517] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:33:11,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016698385] [2023-01-27 21:33:11,650 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 21:33:11,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:33:11,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:33:11,653 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-01-27 21:33:11,655 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-01-27 21:33:11,742 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-01-27 21:33:11,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:33:11,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-27 21:33:11,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:33:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:33:11,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:33:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:33:11,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016698385] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:33:11,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:33:11,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-27 21:33:11,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207825144] [2023-01-27 21:33:11,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:33:11,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 21:33:11,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:33:11,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 21:33:11,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-01-27 21:33:11,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:33:11,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 420 transitions, 9009 flow. Second operand has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:11,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:33:11,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:33:11,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:33:18,486 INFO L130 PetriNetUnfolder]: 30804/45994 cut-off events. [2023-01-27 21:33:18,487 INFO L131 PetriNetUnfolder]: For 1028273/1032695 co-relation queries the response was YES. [2023-01-27 21:33:18,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337437 conditions, 45994 events. 30804/45994 cut-off events. For 1028273/1032695 co-relation queries the response was YES. Maximal size of possible extension queue 2811. Compared 340648 event pairs, 7530 based on Foata normal form. 4096/49359 useless extension candidates. Maximal degree in co-relation 316189. Up to 17610 conditions per place. [2023-01-27 21:33:19,024 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 416 selfloop transitions, 163 changer transitions 26/651 dead transitions. [2023-01-27 21:33:19,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 651 transitions, 14204 flow [2023-01-27 21:33:19,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:33:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:33:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-01-27 21:33:19,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099009900990099 [2023-01-27 21:33:19,025 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-01-27 21:33:19,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-01-27 21:33:19,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:33:19,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-01-27 21:33:19,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:19,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:19,027 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:19,027 INFO L175 Difference]: Start difference. First operand has 162 places, 420 transitions, 9009 flow. Second operand 5 states and 515 transitions. [2023-01-27 21:33:19,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 651 transitions, 14204 flow [2023-01-27 21:33:24,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 651 transitions, 13622 flow, removed 54 selfloop flow, removed 4 redundant places. [2023-01-27 21:33:24,860 INFO L231 Difference]: Finished difference. Result has 165 places, 481 transitions, 10412 flow [2023-01-27 21:33:24,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=8543, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10412, PETRI_PLACES=165, PETRI_TRANSITIONS=481} [2023-01-27 21:33:24,860 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 127 predicate places. [2023-01-27 21:33:24,861 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 481 transitions, 10412 flow [2023-01-27 21:33:24,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:24,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:33:24,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:33:24,867 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-01-27 21:33:25,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:33:25,066 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:33:25,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:33:25,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1550796492, now seen corresponding path program 8 times [2023-01-27 21:33:25,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:33:25,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863685537] [2023-01-27 21:33:25,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:33:25,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:33:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:33:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:33:25,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:33:25,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863685537] [2023-01-27 21:33:25,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863685537] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:33:25,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:33:25,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:33:25,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697481743] [2023-01-27 21:33:25,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:33:25,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:33:25,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:33:25,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:33:25,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:33:25,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:33:25,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 481 transitions, 10412 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:25,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:33:25,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:33:25,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:33:31,889 INFO L130 PetriNetUnfolder]: 30448/45750 cut-off events. [2023-01-27 21:33:31,889 INFO L131 PetriNetUnfolder]: For 988654/990532 co-relation queries the response was YES. [2023-01-27 21:33:32,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336545 conditions, 45750 events. 30448/45750 cut-off events. For 988654/990532 co-relation queries the response was YES. Maximal size of possible extension queue 2616. Compared 339960 event pairs, 7545 based on Foata normal form. 1138/46536 useless extension candidates. Maximal degree in co-relation 317170. Up to 21598 conditions per place. [2023-01-27 21:33:32,437 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 487 selfloop transitions, 97 changer transitions 77/715 dead transitions. [2023-01-27 21:33:32,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 715 transitions, 15601 flow [2023-01-27 21:33:32,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:33:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:33:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2023-01-27 21:33:32,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505940594059406 [2023-01-27 21:33:32,439 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 511 transitions. [2023-01-27 21:33:32,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 511 transitions. [2023-01-27 21:33:32,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:33:32,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 511 transitions. [2023-01-27 21:33:32,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:32,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:32,440 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:32,440 INFO L175 Difference]: Start difference. First operand has 165 places, 481 transitions, 10412 flow. Second operand 5 states and 511 transitions. [2023-01-27 21:33:32,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 715 transitions, 15601 flow [2023-01-27 21:33:38,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 715 transitions, 15241 flow, removed 96 selfloop flow, removed 1 redundant places. [2023-01-27 21:33:38,774 INFO L231 Difference]: Finished difference. Result has 171 places, 524 transitions, 11402 flow [2023-01-27 21:33:38,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=10101, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11402, PETRI_PLACES=171, PETRI_TRANSITIONS=524} [2023-01-27 21:33:38,775 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 133 predicate places. [2023-01-27 21:33:38,775 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 524 transitions, 11402 flow [2023-01-27 21:33:38,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:38,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:33:38,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:33:38,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-01-27 21:33:38,775 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:33:38,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:33:38,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1955010241, now seen corresponding path program 7 times [2023-01-27 21:33:38,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:33:38,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029173588] [2023-01-27 21:33:38,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:33:38,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:33:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:33:38,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:33:38,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:33:38,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029173588] [2023-01-27 21:33:38,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029173588] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:33:38,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948413858] [2023-01-27 21:33:38,818 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 21:33:38,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:33:38,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:33:38,819 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-01-27 21:33:38,821 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-01-27 21:33:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:33:38,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-27 21:33:38,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:33:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:33:38,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:33:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:33:38,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948413858] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:33:38,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:33:38,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-27 21:33:38,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631836650] [2023-01-27 21:33:38,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:33:38,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 21:33:38,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:33:38,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 21:33:38,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-01-27 21:33:38,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:33:38,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 524 transitions, 11402 flow. Second operand has 10 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:38,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:33:38,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:33:38,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:33:45,852 INFO L130 PetriNetUnfolder]: 28497/42251 cut-off events. [2023-01-27 21:33:45,853 INFO L131 PetriNetUnfolder]: For 1036949/1041043 co-relation queries the response was YES. [2023-01-27 21:33:46,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324920 conditions, 42251 events. 28497/42251 cut-off events. For 1036949/1041043 co-relation queries the response was YES. Maximal size of possible extension queue 2536. Compared 306329 event pairs, 3394 based on Foata normal form. 3859/45367 useless extension candidates. Maximal degree in co-relation 306550. Up to 15562 conditions per place. [2023-01-27 21:33:46,379 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 574 selfloop transitions, 161 changer transitions 81/868 dead transitions. [2023-01-27 21:33:46,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 868 transitions, 18971 flow [2023-01-27 21:33:46,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 21:33:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 21:33:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 813 transitions. [2023-01-27 21:33:46,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030940594059405 [2023-01-27 21:33:46,380 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 813 transitions. [2023-01-27 21:33:46,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 813 transitions. [2023-01-27 21:33:46,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:33:46,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 813 transitions. [2023-01-27 21:33:46,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.625) internal successors, (813), 8 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:46,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:46,383 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:46,383 INFO L175 Difference]: Start difference. First operand has 171 places, 524 transitions, 11402 flow. Second operand 8 states and 813 transitions. [2023-01-27 21:33:46,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 868 transitions, 18971 flow [2023-01-27 21:33:52,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 868 transitions, 18711 flow, removed 101 selfloop flow, removed 1 redundant places. [2023-01-27 21:33:52,340 INFO L231 Difference]: Finished difference. Result has 179 places, 546 transitions, 12220 flow [2023-01-27 21:33:52,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11204, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12220, PETRI_PLACES=179, PETRI_TRANSITIONS=546} [2023-01-27 21:33:52,341 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 141 predicate places. [2023-01-27 21:33:52,341 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 546 transitions, 12220 flow [2023-01-27 21:33:52,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:52,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:33:52,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:33:52,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-01-27 21:33:52,545 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,SelfDestructingSolverStorable26 [2023-01-27 21:33:52,545 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:33:52,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:33:52,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1547411515, now seen corresponding path program 6 times [2023-01-27 21:33:52,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:33:52,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066276238] [2023-01-27 21:33:52,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:33:52,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:33:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:33:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:33:52,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:33:52,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066276238] [2023-01-27 21:33:52,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066276238] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:33:52,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:33:52,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:33:52,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922031879] [2023-01-27 21:33:52,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:33:52,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:33:52,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:33:52,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:33:52,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:33:52,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:33:52,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 546 transitions, 12220 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:52,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:33:52,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:33:52,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:33:58,566 INFO L130 PetriNetUnfolder]: 25160/36932 cut-off events. [2023-01-27 21:33:58,566 INFO L131 PetriNetUnfolder]: For 986589/994236 co-relation queries the response was YES. [2023-01-27 21:33:58,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290487 conditions, 36932 events. 25160/36932 cut-off events. For 986589/994236 co-relation queries the response was YES. Maximal size of possible extension queue 2305. Compared 259742 event pairs, 5948 based on Foata normal form. 5920/41908 useless extension candidates. Maximal degree in co-relation 273173. Up to 16715 conditions per place. [2023-01-27 21:33:58,923 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 388 selfloop transitions, 235 changer transitions 75/729 dead transitions. [2023-01-27 21:33:58,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 729 transitions, 16766 flow [2023-01-27 21:33:58,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 21:33:58,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 21:33:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2023-01-27 21:33:58,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-27 21:33:58,925 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 606 transitions. [2023-01-27 21:33:58,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions. [2023-01-27 21:33:58,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:33:58,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions. [2023-01-27 21:33:58,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:58,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:58,926 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:33:58,926 INFO L175 Difference]: Start difference. First operand has 179 places, 546 transitions, 12220 flow. Second operand 6 states and 606 transitions. [2023-01-27 21:33:58,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 729 transitions, 16766 flow [2023-01-27 21:34:02,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 729 transitions, 16268 flow, removed 86 selfloop flow, removed 5 redundant places. [2023-01-27 21:34:02,943 INFO L231 Difference]: Finished difference. Result has 180 places, 545 transitions, 12355 flow [2023-01-27 21:34:02,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11776, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12355, PETRI_PLACES=180, PETRI_TRANSITIONS=545} [2023-01-27 21:34:02,943 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 142 predicate places. [2023-01-27 21:34:02,943 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 545 transitions, 12355 flow [2023-01-27 21:34:02,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:02,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:34:02,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:34:02,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-01-27 21:34:02,944 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:34:02,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:34:02,944 INFO L85 PathProgramCache]: Analyzing trace with hash 13754851, now seen corresponding path program 7 times [2023-01-27 21:34:02,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:34:02,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88695286] [2023-01-27 21:34:02,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:34:02,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:34:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:34:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:34:02,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:34:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88695286] [2023-01-27 21:34:02,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88695286] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:34:02,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:34:02,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:34:02,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995737960] [2023-01-27 21:34:02,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:34:02,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:34:02,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:34:02,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:34:02,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:34:02,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:34:02,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 545 transitions, 12355 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:02,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:34:02,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:34:02,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:34:08,639 INFO L130 PetriNetUnfolder]: 24669/35922 cut-off events. [2023-01-27 21:34:08,639 INFO L131 PetriNetUnfolder]: For 841027/843152 co-relation queries the response was YES. [2023-01-27 21:34:08,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277215 conditions, 35922 events. 24669/35922 cut-off events. For 841027/843152 co-relation queries the response was YES. Maximal size of possible extension queue 1938. Compared 242490 event pairs, 4292 based on Foata normal form. 1728/37238 useless extension candidates. Maximal degree in co-relation 262952. Up to 18008 conditions per place. [2023-01-27 21:34:09,047 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 439 selfloop transitions, 192 changer transitions 64/733 dead transitions. [2023-01-27 21:34:09,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 733 transitions, 17092 flow [2023-01-27 21:34:09,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:34:09,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:34:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2023-01-27 21:34:09,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500990099009901 [2023-01-27 21:34:09,049 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 506 transitions. [2023-01-27 21:34:09,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 506 transitions. [2023-01-27 21:34:09,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:34:09,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 506 transitions. [2023-01-27 21:34:09,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:09,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:09,050 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:09,050 INFO L175 Difference]: Start difference. First operand has 180 places, 545 transitions, 12355 flow. Second operand 5 states and 506 transitions. [2023-01-27 21:34:09,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 733 transitions, 17092 flow [2023-01-27 21:34:13,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 733 transitions, 16406 flow, removed 112 selfloop flow, removed 5 redundant places. [2023-01-27 21:34:13,432 INFO L231 Difference]: Finished difference. Result has 181 places, 553 transitions, 12456 flow [2023-01-27 21:34:13,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11669, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12456, PETRI_PLACES=181, PETRI_TRANSITIONS=553} [2023-01-27 21:34:13,433 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 143 predicate places. [2023-01-27 21:34:13,433 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 553 transitions, 12456 flow [2023-01-27 21:34:13,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:13,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:34:13,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:34:13,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-01-27 21:34:13,434 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:34:13,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:34:13,434 INFO L85 PathProgramCache]: Analyzing trace with hash 201753452, now seen corresponding path program 9 times [2023-01-27 21:34:13,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:34:13,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058345217] [2023-01-27 21:34:13,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:34:13,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:34:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:34:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:34:13,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:34:13,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058345217] [2023-01-27 21:34:13,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058345217] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:34:13,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:34:13,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:34:13,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097591916] [2023-01-27 21:34:13,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:34:13,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:34:13,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:34:13,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:34:13,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:34:13,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:34:13,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 553 transitions, 12456 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:13,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:34:13,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:34:13,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:34:19,270 INFO L130 PetriNetUnfolder]: 25669/36968 cut-off events. [2023-01-27 21:34:19,271 INFO L131 PetriNetUnfolder]: For 867355/869414 co-relation queries the response was YES. [2023-01-27 21:34:19,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283852 conditions, 36968 events. 25669/36968 cut-off events. For 867355/869414 co-relation queries the response was YES. Maximal size of possible extension queue 1951. Compared 244752 event pairs, 6934 based on Foata normal form. 1210/37880 useless extension candidates. Maximal degree in co-relation 269900. Up to 20029 conditions per place. [2023-01-27 21:34:19,748 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 553 selfloop transitions, 93 changer transitions 22/718 dead transitions. [2023-01-27 21:34:19,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 718 transitions, 16758 flow [2023-01-27 21:34:19,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:34:19,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:34:19,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-01-27 21:34:19,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501980198019802 [2023-01-27 21:34:19,754 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-01-27 21:34:19,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-01-27 21:34:19,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:34:19,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-01-27 21:34:19,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:19,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:19,755 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:19,755 INFO L175 Difference]: Start difference. First operand has 181 places, 553 transitions, 12456 flow. Second operand 5 states and 507 transitions. [2023-01-27 21:34:19,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 718 transitions, 16758 flow [2023-01-27 21:34:25,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 718 transitions, 16201 flow, removed 51 selfloop flow, removed 5 redundant places. [2023-01-27 21:34:25,145 INFO L231 Difference]: Finished difference. Result has 181 places, 562 transitions, 12412 flow [2023-01-27 21:34:25,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11976, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12412, PETRI_PLACES=181, PETRI_TRANSITIONS=562} [2023-01-27 21:34:25,145 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 143 predicate places. [2023-01-27 21:34:25,145 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 562 transitions, 12412 flow [2023-01-27 21:34:25,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:25,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:34:25,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:34:25,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-01-27 21:34:25,146 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:34:25,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:34:25,146 INFO L85 PathProgramCache]: Analyzing trace with hash -303154112, now seen corresponding path program 10 times [2023-01-27 21:34:25,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:34:25,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423548498] [2023-01-27 21:34:25,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:34:25,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:34:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:34:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:34:25,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:34:25,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423548498] [2023-01-27 21:34:25,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423548498] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:34:25,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:34:25,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:34:25,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924510255] [2023-01-27 21:34:25,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:34:25,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:34:25,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:34:25,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:34:25,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:34:25,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:34:25,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 562 transitions, 12412 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:25,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:34:25,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:34:25,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:34:30,470 INFO L130 PetriNetUnfolder]: 23491/33728 cut-off events. [2023-01-27 21:34:30,470 INFO L131 PetriNetUnfolder]: For 806643/809922 co-relation queries the response was YES. [2023-01-27 21:34:30,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261789 conditions, 33728 events. 23491/33728 cut-off events. For 806643/809922 co-relation queries the response was YES. Maximal size of possible extension queue 1895. Compared 221443 event pairs, 6161 based on Foata normal form. 2063/35586 useless extension candidates. Maximal degree in co-relation 251511. Up to 16283 conditions per place. [2023-01-27 21:34:30,896 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 495 selfloop transitions, 131 changer transitions 51/705 dead transitions. [2023-01-27 21:34:30,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 705 transitions, 16312 flow [2023-01-27 21:34:30,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:34:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:34:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-01-27 21:34:30,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49603960396039604 [2023-01-27 21:34:30,897 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-01-27 21:34:30,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-01-27 21:34:30,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:34:30,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-01-27 21:34:30,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 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-01-27 21:34:30,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:30,899 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:30,899 INFO L175 Difference]: Start difference. First operand has 181 places, 562 transitions, 12412 flow. Second operand 5 states and 501 transitions. [2023-01-27 21:34:30,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 705 transitions, 16312 flow [2023-01-27 21:34:35,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 705 transitions, 16044 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-01-27 21:34:35,888 INFO L231 Difference]: Finished difference. Result has 183 places, 550 transitions, 12321 flow [2023-01-27 21:34:35,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=12196, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12321, PETRI_PLACES=183, PETRI_TRANSITIONS=550} [2023-01-27 21:34:35,889 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 145 predicate places. [2023-01-27 21:34:35,889 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 550 transitions, 12321 flow [2023-01-27 21:34:35,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:35,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:34:35,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:34:35,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-01-27 21:34:35,890 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:34:35,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:34:35,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1032574491, now seen corresponding path program 8 times [2023-01-27 21:34:35,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:34:35,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901784864] [2023-01-27 21:34:35,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:34:35,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:34:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:34:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:34:35,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:34:35,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901784864] [2023-01-27 21:34:35,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901784864] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:34:35,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:34:35,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:34:35,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379148365] [2023-01-27 21:34:35,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:34:35,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:34:35,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:34:35,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:34:35,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:34:35,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:34:35,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 550 transitions, 12321 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:35,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:34:35,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:34:35,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:34:40,852 INFO L130 PetriNetUnfolder]: 22334/31675 cut-off events. [2023-01-27 21:34:40,852 INFO L131 PetriNetUnfolder]: For 775607/778609 co-relation queries the response was YES. [2023-01-27 21:34:41,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248094 conditions, 31675 events. 22334/31675 cut-off events. For 775607/778609 co-relation queries the response was YES. Maximal size of possible extension queue 1768. Compared 200690 event pairs, 5780 based on Foata normal form. 2118/32979 useless extension candidates. Maximal degree in co-relation 243421. Up to 16795 conditions per place. [2023-01-27 21:34:41,134 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 370 selfloop transitions, 183 changer transitions 93/692 dead transitions. [2023-01-27 21:34:41,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 692 transitions, 16016 flow [2023-01-27 21:34:41,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:34:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:34:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2023-01-27 21:34:41,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-27 21:34:41,135 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2023-01-27 21:34:41,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2023-01-27 21:34:41,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:34:41,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2023-01-27 21:34:41,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:41,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:41,137 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:41,137 INFO L175 Difference]: Start difference. First operand has 183 places, 550 transitions, 12321 flow. Second operand 5 states and 505 transitions. [2023-01-27 21:34:41,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 692 transitions, 16016 flow [2023-01-27 21:34:44,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 692 transitions, 15511 flow, removed 76 selfloop flow, removed 6 redundant places. [2023-01-27 21:34:44,568 INFO L231 Difference]: Finished difference. Result has 180 places, 550 transitions, 12272 flow [2023-01-27 21:34:44,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11868, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12272, PETRI_PLACES=180, PETRI_TRANSITIONS=550} [2023-01-27 21:34:44,568 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 142 predicate places. [2023-01-27 21:34:44,568 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 550 transitions, 12272 flow [2023-01-27 21:34:44,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:44,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:34:44,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:34:44,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-01-27 21:34:44,569 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:34:44,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:34:44,569 INFO L85 PathProgramCache]: Analyzing trace with hash -481538739, now seen corresponding path program 8 times [2023-01-27 21:34:44,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:34:44,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32825840] [2023-01-27 21:34:44,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:34:44,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:34:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:34:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:34:44,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:34:44,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32825840] [2023-01-27 21:34:44,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32825840] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:34:44,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703567756] [2023-01-27 21:34:44,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 21:34:44,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:34:44,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:34:44,608 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-01-27 21:34:44,610 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-01-27 21:34:44,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 21:34:44,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:34:44,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-27 21:34:44,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:34:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:34:44,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:34:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:34:44,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703567756] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:34:44,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:34:44,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-27 21:34:44,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10885912] [2023-01-27 21:34:44,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:34:44,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 21:34:44,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:34:44,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 21:34:44,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-01-27 21:34:44,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:34:44,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 550 transitions, 12272 flow. Second operand has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:44,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:34:44,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:34:44,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:34:49,611 INFO L130 PetriNetUnfolder]: 22923/32314 cut-off events. [2023-01-27 21:34:49,611 INFO L131 PetriNetUnfolder]: For 737438/739982 co-relation queries the response was YES. [2023-01-27 21:34:49,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251696 conditions, 32314 events. 22923/32314 cut-off events. For 737438/739982 co-relation queries the response was YES. Maximal size of possible extension queue 1770. Compared 201711 event pairs, 2880 based on Foata normal form. 1865/33810 useless extension candidates. Maximal degree in co-relation 227485. Up to 14697 conditions per place. [2023-01-27 21:34:49,909 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 497 selfloop transitions, 230 changer transitions 119/881 dead transitions. [2023-01-27 21:34:49,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 881 transitions, 19638 flow [2023-01-27 21:34:49,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 21:34:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 21:34:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 809 transitions. [2023-01-27 21:34:49,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006188118811881 [2023-01-27 21:34:49,910 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 809 transitions. [2023-01-27 21:34:49,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 809 transitions. [2023-01-27 21:34:49,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:34:49,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 809 transitions. [2023-01-27 21:34:49,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.125) internal successors, (809), 8 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:49,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:49,912 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 202.0) internal successors, (1818), 9 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:49,912 INFO L175 Difference]: Start difference. First operand has 180 places, 550 transitions, 12272 flow. Second operand 8 states and 809 transitions. [2023-01-27 21:34:49,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 881 transitions, 19638 flow [2023-01-27 21:34:54,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 881 transitions, 19252 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-01-27 21:34:54,049 INFO L231 Difference]: Finished difference. Result has 185 places, 560 transitions, 12698 flow [2023-01-27 21:34:54,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11892, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12698, PETRI_PLACES=185, PETRI_TRANSITIONS=560} [2023-01-27 21:34:54,050 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 147 predicate places. [2023-01-27 21:34:54,050 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 560 transitions, 12698 flow [2023-01-27 21:34:54,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:54,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:34:54,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:34:54,058 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-01-27 21:34:54,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:34:54,250 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:34:54,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:34:54,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2051744475, now seen corresponding path program 9 times [2023-01-27 21:34:54,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:34:54,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759617428] [2023-01-27 21:34:54,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:34:54,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:34:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:34:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:34:54,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:34:54,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759617428] [2023-01-27 21:34:54,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759617428] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:34:54,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690811079] [2023-01-27 21:34:54,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 21:34:54,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:34:54,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:34:54,293 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-01-27 21:34:54,301 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-01-27 21:34:54,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 21:34:54,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:34:54,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-27 21:34:54,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:34:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:34:54,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:34:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:34:54,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690811079] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:34:54,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:34:54,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-27 21:34:54,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150041780] [2023-01-27 21:34:54,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:34:54,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 21:34:54,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:34:54,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 21:34:54,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-01-27 21:34:54,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:34:54,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 560 transitions, 12698 flow. Second operand has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:54,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:34:54,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:34:54,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:34:58,961 INFO L130 PetriNetUnfolder]: 21401/29770 cut-off events. [2023-01-27 21:34:58,962 INFO L131 PetriNetUnfolder]: For 730383/733737 co-relation queries the response was YES. [2023-01-27 21:34:59,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239539 conditions, 29770 events. 21401/29770 cut-off events. For 730383/733737 co-relation queries the response was YES. Maximal size of possible extension queue 1611. Compared 179571 event pairs, 5378 based on Foata normal form. 2146/31540 useless extension candidates. Maximal degree in co-relation 207874. Up to 16809 conditions per place. [2023-01-27 21:34:59,253 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 441 selfloop transitions, 154 changer transitions 51/679 dead transitions. [2023-01-27 21:34:59,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 679 transitions, 15822 flow [2023-01-27 21:34:59,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:34:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:34:59,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-01-27 21:34:59,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501980198019802 [2023-01-27 21:34:59,254 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-01-27 21:34:59,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-01-27 21:34:59,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:34:59,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-01-27 21:34:59,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:59,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:59,255 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:34:59,255 INFO L175 Difference]: Start difference. First operand has 185 places, 560 transitions, 12698 flow. Second operand 5 states and 507 transitions. [2023-01-27 21:34:59,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 679 transitions, 15822 flow [2023-01-27 21:35:03,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 679 transitions, 15218 flow, removed 82 selfloop flow, removed 6 redundant places. [2023-01-27 21:35:03,688 INFO L231 Difference]: Finished difference. Result has 183 places, 541 transitions, 12100 flow [2023-01-27 21:35:03,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=12106, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12100, PETRI_PLACES=183, PETRI_TRANSITIONS=541} [2023-01-27 21:35:03,688 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 145 predicate places. [2023-01-27 21:35:03,688 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 541 transitions, 12100 flow [2023-01-27 21:35:03,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:03,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:35:03,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:35:03,693 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-01-27 21:35:03,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-01-27 21:35:03,893 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:35:03,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:35:03,894 INFO L85 PathProgramCache]: Analyzing trace with hash -210520731, now seen corresponding path program 9 times [2023-01-27 21:35:03,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:35:03,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006847005] [2023-01-27 21:35:03,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:35:03,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:35:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:35:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:35:03,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:35:03,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006847005] [2023-01-27 21:35:03,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006847005] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:35:03,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:35:03,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 21:35:03,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280514711] [2023-01-27 21:35:03,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:35:03,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:35:03,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:35:03,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:35:03,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:35:03,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:35:03,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 541 transitions, 12100 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:03,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:35:03,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:35:03,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:35:07,451 INFO L130 PetriNetUnfolder]: 18175/24257 cut-off events. [2023-01-27 21:35:07,451 INFO L131 PetriNetUnfolder]: For 603230/605933 co-relation queries the response was YES. [2023-01-27 21:35:07,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196240 conditions, 24257 events. 18175/24257 cut-off events. For 603230/605933 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 129418 event pairs, 4009 based on Foata normal form. 2024/25529 useless extension candidates. Maximal degree in co-relation 178146. Up to 13332 conditions per place. [2023-01-27 21:35:07,649 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 327 selfloop transitions, 195 changer transitions 61/613 dead transitions. [2023-01-27 21:35:07,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 613 transitions, 14273 flow [2023-01-27 21:35:07,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:35:07,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:35:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-01-27 21:35:07,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49603960396039604 [2023-01-27 21:35:07,650 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-01-27 21:35:07,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-01-27 21:35:07,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:35:07,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-01-27 21:35:07,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 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-01-27 21:35:07,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:07,652 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:07,652 INFO L175 Difference]: Start difference. First operand has 183 places, 541 transitions, 12100 flow. Second operand 5 states and 501 transitions. [2023-01-27 21:35:07,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 613 transitions, 14273 flow [2023-01-27 21:35:10,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 613 transitions, 13631 flow, removed 142 selfloop flow, removed 8 redundant places. [2023-01-27 21:35:10,364 INFO L231 Difference]: Finished difference. Result has 175 places, 509 transitions, 11199 flow [2023-01-27 21:35:10,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11485, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11199, PETRI_PLACES=175, PETRI_TRANSITIONS=509} [2023-01-27 21:35:10,365 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 137 predicate places. [2023-01-27 21:35:10,365 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 509 transitions, 11199 flow [2023-01-27 21:35:10,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:10,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:35:10,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:35:10,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-01-27 21:35:10,366 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:35:10,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:35:10,366 INFO L85 PathProgramCache]: Analyzing trace with hash -667345164, now seen corresponding path program 1 times [2023-01-27 21:35:10,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:35:10,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247291737] [2023-01-27 21:35:10,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:35:10,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:35:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:35:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:35:10,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:35:10,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247291737] [2023-01-27 21:35:10,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247291737] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:35:10,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944416415] [2023-01-27 21:35:10,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:35:10,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:35:10,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:35:10,401 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-01-27 21:35:10,403 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-01-27 21:35:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:35:10,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-27 21:35:10,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:35:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:35:10,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:35:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:35:10,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944416415] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:35:10,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:35:10,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-01-27 21:35:10,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761284995] [2023-01-27 21:35:10,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:35:10,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 21:35:10,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:35:10,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 21:35:10,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-27 21:35:10,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-27 21:35:10,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 509 transitions, 11199 flow. Second operand has 8 states, 8 states have (on average 90.0) internal successors, (720), 8 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:10,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:35:10,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-27 21:35:10,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:35:13,456 INFO L130 PetriNetUnfolder]: 17052/22257 cut-off events. [2023-01-27 21:35:13,456 INFO L131 PetriNetUnfolder]: For 507950/509893 co-relation queries the response was YES. [2023-01-27 21:35:13,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184120 conditions, 22257 events. 17052/22257 cut-off events. For 507950/509893 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 109890 event pairs, 2012 based on Foata normal form. 998/22714 useless extension candidates. Maximal degree in co-relation 168442. Up to 13528 conditions per place. [2023-01-27 21:35:13,663 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 420 selfloop transitions, 169 changer transitions 1/620 dead transitions. [2023-01-27 21:35:13,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 620 transitions, 14088 flow [2023-01-27 21:35:13,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:35:13,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:35:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-01-27 21:35:13,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49603960396039604 [2023-01-27 21:35:13,665 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-01-27 21:35:13,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-01-27 21:35:13,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:35:13,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-01-27 21:35:13,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 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-01-27 21:35:13,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:13,666 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:13,666 INFO L175 Difference]: Start difference. First operand has 175 places, 509 transitions, 11199 flow. Second operand 5 states and 501 transitions. [2023-01-27 21:35:13,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 620 transitions, 14088 flow [2023-01-27 21:35:16,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 620 transitions, 12458 flow, removed 172 selfloop flow, removed 22 redundant places. [2023-01-27 21:35:16,048 INFO L231 Difference]: Finished difference. Result has 143 places, 525 transitions, 10573 flow [2023-01-27 21:35:16,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=9715, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10573, PETRI_PLACES=143, PETRI_TRANSITIONS=525} [2023-01-27 21:35:16,049 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 105 predicate places. [2023-01-27 21:35:16,049 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 525 transitions, 10573 flow [2023-01-27 21:35:16,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.0) internal successors, (720), 8 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:16,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:35:16,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:35:16,053 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-01-27 21:35:16,249 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,SelfDestructingSolverStorable35 [2023-01-27 21:35:16,250 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:35:16,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:35:16,250 INFO L85 PathProgramCache]: Analyzing trace with hash -65837510, now seen corresponding path program 2 times [2023-01-27 21:35:16,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:35:16,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5933769] [2023-01-27 21:35:16,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:35:16,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:35:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:35:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:35:16,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:35:16,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5933769] [2023-01-27 21:35:16,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5933769] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:35:16,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572624535] [2023-01-27 21:35:16,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 21:35:16,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:35:16,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:35:16,285 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-01-27 21:35:16,287 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-01-27 21:35:16,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 21:35:16,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:35:16,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-27 21:35:16,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:35:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:35:16,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:35:16,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:35:16,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572624535] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:35:16,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:35:16,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-27 21:35:16,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821871661] [2023-01-27 21:35:16,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:35:16,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 21:35:16,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:35:16,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 21:35:16,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-01-27 21:35:16,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 202 [2023-01-27 21:35:16,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 525 transitions, 10573 flow. Second operand has 10 states, 10 states have (on average 87.3) internal successors, (873), 10 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:16,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:35:16,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 202 [2023-01-27 21:35:16,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:35:19,676 INFO L130 PetriNetUnfolder]: 19775/25806 cut-off events. [2023-01-27 21:35:19,677 INFO L131 PetriNetUnfolder]: For 471967/473084 co-relation queries the response was YES. [2023-01-27 21:35:19,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203310 conditions, 25806 events. 19775/25806 cut-off events. For 471967/473084 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 128460 event pairs, 1201 based on Foata normal form. 865/26315 useless extension candidates. Maximal degree in co-relation 182335. Up to 15510 conditions per place. [2023-01-27 21:35:19,889 INFO L137 encePairwiseOnDemand]: 195/202 looper letters, 443 selfloop transitions, 385 changer transitions 2/842 dead transitions. [2023-01-27 21:35:19,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 842 transitions, 16889 flow [2023-01-27 21:35:19,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-27 21:35:19,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-01-27 21:35:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1428 transitions. [2023-01-27 21:35:19,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47128712871287126 [2023-01-27 21:35:19,890 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1428 transitions. [2023-01-27 21:35:19,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1428 transitions. [2023-01-27 21:35:19,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:35:19,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1428 transitions. [2023-01-27 21:35:19,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 95.2) internal successors, (1428), 15 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:19,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 202.0) internal successors, (3232), 16 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:19,894 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 202.0) internal successors, (3232), 16 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:19,894 INFO L175 Difference]: Start difference. First operand has 143 places, 525 transitions, 10573 flow. Second operand 15 states and 1428 transitions. [2023-01-27 21:35:19,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 842 transitions, 16889 flow [2023-01-27 21:35:22,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 842 transitions, 16574 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-01-27 21:35:22,077 INFO L231 Difference]: Finished difference. Result has 161 places, 620 transitions, 13397 flow [2023-01-27 21:35:22,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=10319, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=294, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13397, PETRI_PLACES=161, PETRI_TRANSITIONS=620} [2023-01-27 21:35:22,078 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 123 predicate places. [2023-01-27 21:35:22,078 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 620 transitions, 13397 flow [2023-01-27 21:35:22,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.3) internal successors, (873), 10 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:22,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:35:22,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:35:22,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-27 21:35:22,281 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,SelfDestructingSolverStorable36 [2023-01-27 21:35:22,281 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:35:22,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:35:22,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1053393848, now seen corresponding path program 3 times [2023-01-27 21:35:22,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:35:22,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203002718] [2023-01-27 21:35:22,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:35:22,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:35:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:35:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:35:22,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:35:22,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203002718] [2023-01-27 21:35:22,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203002718] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:35:22,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885774885] [2023-01-27 21:35:22,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 21:35:22,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:35:22,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:35:22,316 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-01-27 21:35:22,318 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-01-27 21:35:22,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 21:35:22,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:35:22,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-27 21:35:22,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:35:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:35:22,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:35:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:35:22,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885774885] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:35:22,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:35:22,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-27 21:35:22,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690672032] [2023-01-27 21:35:22,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:35:22,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 21:35:22,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:35:22,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 21:35:22,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-01-27 21:35:22,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 202 [2023-01-27 21:35:22,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 620 transitions, 13397 flow. Second operand has 10 states, 10 states have (on average 87.2) internal successors, (872), 10 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:22,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:35:22,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 202 [2023-01-27 21:35:22,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:35:26,998 INFO L130 PetriNetUnfolder]: 24929/32605 cut-off events. [2023-01-27 21:35:26,998 INFO L131 PetriNetUnfolder]: For 612389/612946 co-relation queries the response was YES. [2023-01-27 21:35:27,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264605 conditions, 32605 events. 24929/32605 cut-off events. For 612389/612946 co-relation queries the response was YES. Maximal size of possible extension queue 1431. Compared 167413 event pairs, 1622 based on Foata normal form. 498/32960 useless extension candidates. Maximal degree in co-relation 240253. Up to 19261 conditions per place. [2023-01-27 21:35:27,300 INFO L137 encePairwiseOnDemand]: 194/202 looper letters, 618 selfloop transitions, 358 changer transitions 1/1001 dead transitions. [2023-01-27 21:35:27,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 1001 transitions, 21666 flow [2023-01-27 21:35:27,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-27 21:35:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-27 21:35:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1341 transitions. [2023-01-27 21:35:27,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4741867043847242 [2023-01-27 21:35:27,302 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1341 transitions. [2023-01-27 21:35:27,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1341 transitions. [2023-01-27 21:35:27,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:35:27,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1341 transitions. [2023-01-27 21:35:27,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 95.78571428571429) internal successors, (1341), 14 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:27,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 202.0) internal successors, (3030), 15 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:27,305 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 202.0) internal successors, (3030), 15 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:27,305 INFO L175 Difference]: Start difference. First operand has 161 places, 620 transitions, 13397 flow. Second operand 14 states and 1341 transitions. [2023-01-27 21:35:27,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 1001 transitions, 21666 flow [2023-01-27 21:35:31,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 1001 transitions, 19189 flow, removed 283 selfloop flow, removed 10 redundant places. [2023-01-27 21:35:31,368 INFO L231 Difference]: Finished difference. Result has 166 places, 742 transitions, 15014 flow [2023-01-27 21:35:31,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=11655, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=235, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=15014, PETRI_PLACES=166, PETRI_TRANSITIONS=742} [2023-01-27 21:35:31,368 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 128 predicate places. [2023-01-27 21:35:31,368 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 742 transitions, 15014 flow [2023-01-27 21:35:31,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.2) internal successors, (872), 10 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:31,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:35:31,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:35:31,373 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-01-27 21:35:31,571 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,SelfDestructingSolverStorable37 [2023-01-27 21:35:31,571 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:35:31,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:35:31,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1871381985, now seen corresponding path program 1 times [2023-01-27 21:35:31,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:35:31,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919998066] [2023-01-27 21:35:31,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:35:31,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:35:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:35:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:35:31,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:35:31,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919998066] [2023-01-27 21:35:31,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919998066] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:35:31,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379137733] [2023-01-27 21:35:31,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:35:31,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:35:31,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:35:31,683 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-01-27 21:35:31,684 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-01-27 21:35:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:35:31,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 17 conjunts are in the unsatisfiable core [2023-01-27 21:35:31,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:35:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:35:31,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:35:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:35:32,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379137733] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:35:32,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:35:32,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 7 [2023-01-27 21:35:32,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473131781] [2023-01-27 21:35:32,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:35:32,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-27 21:35:32,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:35:32,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-27 21:35:32,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-01-27 21:35:32,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 202 [2023-01-27 21:35:32,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 742 transitions, 15014 flow. Second operand has 9 states, 9 states have (on average 104.66666666666667) internal successors, (942), 9 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:32,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:35:32,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 202 [2023-01-27 21:35:32,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:35:39,678 INFO L130 PetriNetUnfolder]: 40667/54062 cut-off events. [2023-01-27 21:35:39,679 INFO L131 PetriNetUnfolder]: For 970693/986750 co-relation queries the response was YES. [2023-01-27 21:35:40,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412629 conditions, 54062 events. 40667/54062 cut-off events. For 970693/986750 co-relation queries the response was YES. Maximal size of possible extension queue 2511. Compared 315673 event pairs, 3619 based on Foata normal form. 8820/60831 useless extension candidates. Maximal degree in co-relation 380576. Up to 32297 conditions per place. [2023-01-27 21:35:40,303 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 482 selfloop transitions, 559 changer transitions 5/1125 dead transitions. [2023-01-27 21:35:40,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 1125 transitions, 23116 flow [2023-01-27 21:35:40,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 21:35:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 21:35:40,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1057 transitions. [2023-01-27 21:35:40,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5814081408140814 [2023-01-27 21:35:40,305 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1057 transitions. [2023-01-27 21:35:40,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1057 transitions. [2023-01-27 21:35:40,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:35:40,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1057 transitions. [2023-01-27 21:35:40,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.44444444444444) internal successors, (1057), 9 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:40,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 202.0) internal successors, (2020), 10 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:40,307 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 202.0) internal successors, (2020), 10 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:40,307 INFO L175 Difference]: Start difference. First operand has 166 places, 742 transitions, 15014 flow. Second operand 9 states and 1057 transitions. [2023-01-27 21:35:40,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 1125 transitions, 23116 flow [2023-01-27 21:35:44,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 1125 transitions, 21178 flow, removed 438 selfloop flow, removed 11 redundant places. [2023-01-27 21:35:44,936 INFO L231 Difference]: Finished difference. Result has 165 places, 1005 transitions, 21197 flow [2023-01-27 21:35:44,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=9252, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=21197, PETRI_PLACES=165, PETRI_TRANSITIONS=1005} [2023-01-27 21:35:44,936 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 127 predicate places. [2023-01-27 21:35:44,936 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 1005 transitions, 21197 flow [2023-01-27 21:35:44,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 104.66666666666667) internal successors, (942), 9 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:44,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:35:44,937 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:35:44,945 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-01-27 21:35:45,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:35:45,144 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:35:45,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:35:45,145 INFO L85 PathProgramCache]: Analyzing trace with hash 787534766, now seen corresponding path program 2 times [2023-01-27 21:35:45,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:35:45,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551017383] [2023-01-27 21:35:45,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:35:45,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:35:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:35:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:35:45,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:35:45,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551017383] [2023-01-27 21:35:45,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551017383] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:35:45,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810825753] [2023-01-27 21:35:45,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 21:35:45,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:35:45,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:35:45,199 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-01-27 21:35:45,200 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-01-27 21:35:45,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 21:35:45,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:35:45,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-27 21:35:45,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:35:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:35:45,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:35:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:35:45,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810825753] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:35:45,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:35:45,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-01-27 21:35:45,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418783388] [2023-01-27 21:35:45,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:35:45,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-27 21:35:45,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:35:45,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-27 21:35:45,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-01-27 21:35:45,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 202 [2023-01-27 21:35:45,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 1005 transitions, 21197 flow. Second operand has 12 states, 12 states have (on average 87.5) internal successors, (1050), 12 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:35:45,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:35:45,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 202 [2023-01-27 21:35:45,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:36:02,166 INFO L130 PetriNetUnfolder]: 78598/104797 cut-off events. [2023-01-27 21:36:02,166 INFO L131 PetriNetUnfolder]: For 1577870/1578845 co-relation queries the response was YES. [2023-01-27 21:36:03,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783151 conditions, 104797 events. 78598/104797 cut-off events. For 1577870/1578845 co-relation queries the response was YES. Maximal size of possible extension queue 4020. Compared 643365 event pairs, 11791 based on Foata normal form. 3039/107475 useless extension candidates. Maximal degree in co-relation 768271. Up to 57556 conditions per place. [2023-01-27 21:36:03,515 INFO L137 encePairwiseOnDemand]: 194/202 looper letters, 1521 selfloop transitions, 456 changer transitions 0/1997 dead transitions. [2023-01-27 21:36:03,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1997 transitions, 42747 flow [2023-01-27 21:36:03,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-27 21:36:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-27 21:36:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1265 transitions. [2023-01-27 21:36:03,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48172124904798175 [2023-01-27 21:36:03,517 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1265 transitions. [2023-01-27 21:36:03,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1265 transitions. [2023-01-27 21:36:03,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:36:03,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1265 transitions. [2023-01-27 21:36:03,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 97.3076923076923) internal successors, (1265), 13 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:36:03,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 202.0) internal successors, (2828), 14 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:36:03,520 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 202.0) internal successors, (2828), 14 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:36:03,520 INFO L175 Difference]: Start difference. First operand has 165 places, 1005 transitions, 21197 flow. Second operand 13 states and 1265 transitions. [2023-01-27 21:36:03,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 1997 transitions, 42747 flow [2023-01-27 21:36:54,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 1997 transitions, 40401 flow, removed 1173 selfloop flow, removed 0 redundant places. [2023-01-27 21:36:54,946 INFO L231 Difference]: Finished difference. Result has 187 places, 1278 transitions, 27482 flow [2023-01-27 21:36:54,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=20057, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1005, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=27482, PETRI_PLACES=187, PETRI_TRANSITIONS=1278} [2023-01-27 21:36:54,946 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 149 predicate places. [2023-01-27 21:36:54,947 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 1278 transitions, 27482 flow [2023-01-27 21:36:54,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.5) internal successors, (1050), 12 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:36:54,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:36:54,947 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:36:54,952 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-01-27 21:36:55,151 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,SelfDestructingSolverStorable39 [2023-01-27 21:36:55,151 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 21:36:55,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:36:55,151 INFO L85 PathProgramCache]: Analyzing trace with hash -926111482, now seen corresponding path program 3 times [2023-01-27 21:36:55,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:36:55,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015507872] [2023-01-27 21:36:55,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:36:55,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:36:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:36:55,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:36:55,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:36:55,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015507872] [2023-01-27 21:36:55,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015507872] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:36:55,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000835930] [2023-01-27 21:36:55,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 21:36:55,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:36:55,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:36:55,205 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-01-27 21:36:55,207 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-01-27 21:36:55,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-27 21:36:55,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:36:55,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-27 21:36:55,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:36:55,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:36:55,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:36:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:36:55,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000835930] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:36:55,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:36:55,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-01-27 21:36:55,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823590573] [2023-01-27 21:36:55,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:36:55,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-27 21:36:55,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:36:55,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-27 21:36:55,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-01-27 21:36:55,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 202 [2023-01-27 21:36:55,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 1278 transitions, 27482 flow. Second operand has 14 states, 14 states have (on average 86.5) internal successors, (1211), 14 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:36:55,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:36:55,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 202 [2023-01-27 21:36:55,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand