./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65bf47faf943da19c0d2d15e35f35ceed9dd68ed50ac4355a0589bd57bf3d155 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 02:28:07,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 02:28:07,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 02:28:07,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 02:28:07,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 02:28:07,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 02:28:07,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 02:28:07,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 02:28:07,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 02:28:07,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 02:28:07,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 02:28:07,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 02:28:07,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 02:28:07,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 02:28:07,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 02:28:07,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 02:28:07,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 02:28:07,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 02:28:07,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 02:28:07,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 02:28:07,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 02:28:07,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 02:28:07,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 02:28:07,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 02:28:07,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 02:28:07,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 02:28:07,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 02:28:07,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 02:28:07,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 02:28:07,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 02:28:07,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 02:28:07,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 02:28:07,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 02:28:07,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 02:28:07,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 02:28:07,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 02:28:07,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 02:28:07,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 02:28:07,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 02:28:07,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 02:28:07,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 02:28:07,433 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-31 02:28:07,465 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 02:28:07,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 02:28:07,466 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 02:28:07,466 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 02:28:07,467 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 02:28:07,467 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 02:28:07,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 02:28:07,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 02:28:07,468 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 02:28:07,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 02:28:07,469 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 02:28:07,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 02:28:07,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 02:28:07,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 02:28:07,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 02:28:07,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 02:28:07,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 02:28:07,470 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 02:28:07,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 02:28:07,470 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 02:28:07,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 02:28:07,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 02:28:07,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 02:28:07,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 02:28:07,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 02:28:07,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 02:28:07,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 02:28:07,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 02:28:07,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 02:28:07,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 02:28:07,472 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 02:28:07,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 02:28:07,473 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 02:28:07,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 02:28:07,473 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 02:28:07,473 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65bf47faf943da19c0d2d15e35f35ceed9dd68ed50ac4355a0589bd57bf3d155 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-31 02:28:07,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 02:28:07,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 02:28:07,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 02:28:07,779 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 02:28:07,779 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 02:28:07,781 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-08-31 02:28:09,012 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 02:28:09,227 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 02:28:09,228 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-08-31 02:28:09,235 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99697fd78/ed3ed4f78182478491d6f3cc025690a2/FLAGcea6a415e [2023-08-31 02:28:09,246 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99697fd78/ed3ed4f78182478491d6f3cc025690a2 [2023-08-31 02:28:09,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 02:28:09,249 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 02:28:09,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 02:28:09,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 02:28:09,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 02:28:09,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:28:09" (1/1) ... [2023-08-31 02:28:09,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aeb78c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:28:09, skipping insertion in model container [2023-08-31 02:28:09,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:28:09" (1/1) ... [2023-08-31 02:28:09,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 02:28:09,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 02:28:09,442 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-08-31 02:28:09,451 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 02:28:09,462 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 02:28:09,499 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-08-31 02:28:09,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 02:28:09,511 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 02:28:09,511 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 02:28:09,516 INFO L208 MainTranslator]: Completed translation [2023-08-31 02:28:09,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:28:09 WrapperNode [2023-08-31 02:28:09,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 02:28:09,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 02:28:09,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 02:28:09,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 02:28:09,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:28:09" (1/1) ... [2023-08-31 02:28:09,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:28:09" (1/1) ... [2023-08-31 02:28:09,569 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2023-08-31 02:28:09,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 02:28:09,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 02:28:09,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 02:28:09,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 02:28:09,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:28:09" (1/1) ... [2023-08-31 02:28:09,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:28:09" (1/1) ... [2023-08-31 02:28:09,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:28:09" (1/1) ... [2023-08-31 02:28:09,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:28:09" (1/1) ... [2023-08-31 02:28:09,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:28:09" (1/1) ... [2023-08-31 02:28:09,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:28:09" (1/1) ... [2023-08-31 02:28:09,603 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:28:09" (1/1) ... [2023-08-31 02:28:09,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:28:09" (1/1) ... [2023-08-31 02:28:09,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 02:28:09,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 02:28:09,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 02:28:09,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 02:28:09,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:28:09" (1/1) ... [2023-08-31 02:28:09,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 02:28:09,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:28:09,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 02:28:09,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 02:28:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 02:28:09,699 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 02:28:09,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 02:28:09,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 02:28:09,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 02:28:09,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-31 02:28:09,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-31 02:28:09,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-31 02:28:09,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-31 02:28:09,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 02:28:09,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 02:28:09,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 02:28:09,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 02:28:09,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 02:28:09,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 02:28:09,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 02:28:09,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 02:28:09,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 02:28:09,704 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 02:28:09,843 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 02:28:09,858 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 02:28:10,058 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 02:28:10,103 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 02:28:10,103 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-31 02:28:10,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:28:10 BoogieIcfgContainer [2023-08-31 02:28:10,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 02:28:10,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 02:28:10,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 02:28:10,115 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 02:28:10,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 02:28:09" (1/3) ... [2023-08-31 02:28:10,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70047d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 02:28:10, skipping insertion in model container [2023-08-31 02:28:10,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:28:09" (2/3) ... [2023-08-31 02:28:10,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70047d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 02:28:10, skipping insertion in model container [2023-08-31 02:28:10,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:28:10" (3/3) ... [2023-08-31 02:28:10,118 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2023-08-31 02:28:10,125 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 02:28:10,133 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 02:28:10,133 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-31 02:28:10,133 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 02:28:10,216 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-31 02:28:10,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 120 transitions, 272 flow [2023-08-31 02:28:10,335 INFO L130 PetriNetUnfolder]: 9/116 cut-off events. [2023-08-31 02:28:10,335 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-31 02:28:10,341 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-08-31 02:28:10,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 120 transitions, 272 flow [2023-08-31 02:28:10,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 104 transitions, 232 flow [2023-08-31 02:28:10,350 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 02:28:10,370 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 104 transitions, 232 flow [2023-08-31 02:28:10,372 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 104 transitions, 232 flow [2023-08-31 02:28:10,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 104 transitions, 232 flow [2023-08-31 02:28:10,399 INFO L130 PetriNetUnfolder]: 9/104 cut-off events. [2023-08-31 02:28:10,399 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-31 02:28:10,401 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-08-31 02:28:10,402 INFO L119 LiptonReduction]: Number of co-enabled transitions 2520 [2023-08-31 02:28:13,126 INFO L134 LiptonReduction]: Checked pairs total: 2606 [2023-08-31 02:28:13,126 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-08-31 02:28:13,138 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 02:28:13,143 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@69bccabb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 02:28:13,144 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-31 02:28:13,152 INFO L130 PetriNetUnfolder]: 4/28 cut-off events. [2023-08-31 02:28:13,153 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-31 02:28:13,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:28:13,154 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-08-31 02:28:13,154 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-08-31 02:28:13,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:28:13,158 INFO L85 PathProgramCache]: Analyzing trace with hash -475984634, now seen corresponding path program 1 times [2023-08-31 02:28:13,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:28:13,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000016795] [2023-08-31 02:28:13,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:13,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:28:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:13,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:13,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:28:13,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000016795] [2023-08-31 02:28:13,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000016795] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:28:13,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:28:13,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 02:28:13,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017736261] [2023-08-31 02:28:13,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:28:13,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 02:28:13,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:28:13,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 02:28:13,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 02:28:13,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 202 [2023-08-31 02:28:13,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:13,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:28:13,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 202 [2023-08-31 02:28:13,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:28:14,022 INFO L130 PetriNetUnfolder]: 1537/1954 cut-off events. [2023-08-31 02:28:14,022 INFO L131 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2023-08-31 02:28:14,028 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-08-31 02:28:14,039 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 41 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2023-08-31 02:28:14,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 241 flow [2023-08-31 02:28:14,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 02:28:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 02:28:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-31 02:28:14,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5742574257425742 [2023-08-31 02:28:14,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-31 02:28:14,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-31 02:28:14,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:28:14,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-31 02:28:14,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:14,069 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-08-31 02:28:14,069 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-08-31 02:28:14,071 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 82 flow. Second operand 3 states and 348 transitions. [2023-08-31 02:28:14,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 241 flow [2023-08-31 02:28:14,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 51 transitions, 211 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-31 02:28:14,079 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 99 flow [2023-08-31 02:28:14,081 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-08-31 02:28:14,086 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2023-08-31 02:28:14,087 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 99 flow [2023-08-31 02:28:14,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:14,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:28:14,090 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-08-31 02:28:14,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 02:28:14,091 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-08-31 02:28:14,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:28:14,093 INFO L85 PathProgramCache]: Analyzing trace with hash 2131273016, now seen corresponding path program 1 times [2023-08-31 02:28:14,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:28:14,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536526682] [2023-08-31 02:28:14,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:14,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:28:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:14,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:28:14,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536526682] [2023-08-31 02:28:14,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536526682] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:28:14,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:28:14,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:28:14,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43536122] [2023-08-31 02:28:14,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:28:14,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:28:14,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:28:14,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:28:14,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:28:14,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 202 [2023-08-31 02:28:14,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:14,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:28:14,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 202 [2023-08-31 02:28:14,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:28:14,659 INFO L130 PetriNetUnfolder]: 2645/3467 cut-off events. [2023-08-31 02:28:14,660 INFO L131 PetriNetUnfolder]: For 1092/1092 co-relation queries the response was YES. [2023-08-31 02:28:14,662 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-08-31 02:28:14,679 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 86 selfloop transitions, 5 changer transitions 0/93 dead transitions. [2023-08-31 02:28:14,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 93 transitions, 461 flow [2023-08-31 02:28:14,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:28:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:28:14,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 550 transitions. [2023-08-31 02:28:14,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5445544554455446 [2023-08-31 02:28:14,683 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 550 transitions. [2023-08-31 02:28:14,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 550 transitions. [2023-08-31 02:28:14,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:28:14,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 550 transitions. [2023-08-31 02:28:14,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:14,690 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-08-31 02:28:14,690 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-08-31 02:28:14,690 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 99 flow. Second operand 5 states and 550 transitions. [2023-08-31 02:28:14,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 93 transitions, 461 flow [2023-08-31 02:28:14,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 93 transitions, 448 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 02:28:14,694 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 129 flow [2023-08-31 02:28:14,694 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-08-31 02:28:14,695 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2023-08-31 02:28:14,695 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 129 flow [2023-08-31 02:28:14,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:14,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:28:14,696 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-08-31 02:28:14,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 02:28:14,696 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-08-31 02:28:14,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:28:14,698 INFO L85 PathProgramCache]: Analyzing trace with hash 134921043, now seen corresponding path program 1 times [2023-08-31 02:28:14,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:28:14,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035576043] [2023-08-31 02:28:14,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:14,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:28:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:14,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:28:14,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035576043] [2023-08-31 02:28:14,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035576043] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:28:14,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839326590] [2023-08-31 02:28:14,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:14,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:28:14,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:28:14,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:28:14,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-31 02:28:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:14,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 02:28:14,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:28:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:15,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:28:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:15,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839326590] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:28:15,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:28:15,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-31 02:28:15,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895349917] [2023-08-31 02:28:15,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:28:15,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 02:28:15,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:28:15,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 02:28:15,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-31 02:28:15,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-31 02:28:15,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 129 flow. Second operand has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:15,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:28:15,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-31 02:28:15,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:28:15,676 INFO L130 PetriNetUnfolder]: 3569/4785 cut-off events. [2023-08-31 02:28:15,676 INFO L131 PetriNetUnfolder]: For 3429/3842 co-relation queries the response was YES. [2023-08-31 02:28:15,681 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-08-31 02:28:15,705 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 87 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2023-08-31 02:28:15,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 95 transitions, 523 flow [2023-08-31 02:28:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:28:15,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:28:15,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2023-08-31 02:28:15,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5326732673267327 [2023-08-31 02:28:15,708 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2023-08-31 02:28:15,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2023-08-31 02:28:15,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:28:15,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2023-08-31 02:28:15,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:15,712 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-08-31 02:28:15,713 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-08-31 02:28:15,713 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 129 flow. Second operand 5 states and 538 transitions. [2023-08-31 02:28:15,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 95 transitions, 523 flow [2023-08-31 02:28:15,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 95 transitions, 504 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-31 02:28:15,721 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 159 flow [2023-08-31 02:28:15,722 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-08-31 02:28:15,723 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2023-08-31 02:28:15,723 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 159 flow [2023-08-31 02:28:15,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:15,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:28:15,724 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-08-31 02:28:15,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-31 02:28:15,930 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-08-31 02:28:15,931 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-08-31 02:28:15,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:28:15,931 INFO L85 PathProgramCache]: Analyzing trace with hash -950453983, now seen corresponding path program 1 times [2023-08-31 02:28:15,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:28:15,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842596901] [2023-08-31 02:28:15,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:15,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:28:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:16,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:28:16,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842596901] [2023-08-31 02:28:16,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842596901] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:28:16,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696223] [2023-08-31 02:28:16,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:16,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:28:16,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:28:16,028 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:28:16,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-31 02:28:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:16,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 02:28:16,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:28:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:16,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:28:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:16,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696223] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:28:16,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:28:16,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-31 02:28:16,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467346286] [2023-08-31 02:28:16,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:28:16,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 02:28:16,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:28:16,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 02:28:16,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-31 02:28:16,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-31 02:28:16,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 159 flow. Second operand has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:16,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:28:16,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-31 02:28:16,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:28:16,805 INFO L130 PetriNetUnfolder]: 3913/5227 cut-off events. [2023-08-31 02:28:16,806 INFO L131 PetriNetUnfolder]: For 6362/6627 co-relation queries the response was YES. [2023-08-31 02:28:16,812 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-08-31 02:28:16,835 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 90 selfloop transitions, 7 changer transitions 0/100 dead transitions. [2023-08-31 02:28:16,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 100 transitions, 596 flow [2023-08-31 02:28:16,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:28:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:28:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2023-08-31 02:28:16,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5346534653465347 [2023-08-31 02:28:16,838 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 540 transitions. [2023-08-31 02:28:16,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 540 transitions. [2023-08-31 02:28:16,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:28:16,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 540 transitions. [2023-08-31 02:28:16,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:16,842 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-08-31 02:28:16,843 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-08-31 02:28:16,843 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 159 flow. Second operand 5 states and 540 transitions. [2023-08-31 02:28:16,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 100 transitions, 596 flow [2023-08-31 02:28:16,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 100 transitions, 587 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-31 02:28:16,856 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 212 flow [2023-08-31 02:28:16,856 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-08-31 02:28:16,857 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2023-08-31 02:28:16,857 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 212 flow [2023-08-31 02:28:16,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:16,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:28:16,858 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-08-31 02:28:16,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-31 02:28:17,065 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-08-31 02:28:17,065 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-08-31 02:28:17,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:28:17,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1864400695, now seen corresponding path program 2 times [2023-08-31 02:28:17,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:28:17,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189533741] [2023-08-31 02:28:17,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:17,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:28:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:17,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:17,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:28:17,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189533741] [2023-08-31 02:28:17,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189533741] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:28:17,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:28:17,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:28:17,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328297119] [2023-08-31 02:28:17,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:28:17,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:28:17,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:28:17,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:28:17,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:28:17,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 202 [2023-08-31 02:28:17,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:17,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:28:17,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 202 [2023-08-31 02:28:17,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:28:17,887 INFO L130 PetriNetUnfolder]: 5551/7498 cut-off events. [2023-08-31 02:28:17,887 INFO L131 PetriNetUnfolder]: For 14127/14505 co-relation queries the response was YES. [2023-08-31 02:28:17,897 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-08-31 02:28:17,929 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 94 selfloop transitions, 11 changer transitions 0/108 dead transitions. [2023-08-31 02:28:17,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 108 transitions, 703 flow [2023-08-31 02:28:17,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:28:17,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:28:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 548 transitions. [2023-08-31 02:28:17,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5425742574257426 [2023-08-31 02:28:17,932 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 548 transitions. [2023-08-31 02:28:17,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 548 transitions. [2023-08-31 02:28:17,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:28:17,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 548 transitions. [2023-08-31 02:28:17,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:17,936 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-08-31 02:28:17,936 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-08-31 02:28:17,936 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 212 flow. Second operand 5 states and 548 transitions. [2023-08-31 02:28:17,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 108 transitions, 703 flow [2023-08-31 02:28:17,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 108 transitions, 689 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 02:28:17,953 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 269 flow [2023-08-31 02:28:17,954 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-08-31 02:28:17,954 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2023-08-31 02:28:17,954 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 269 flow [2023-08-31 02:28:17,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:17,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:28:17,955 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-08-31 02:28:17,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 02:28:17,956 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-08-31 02:28:17,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:28:17,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1282882796, now seen corresponding path program 2 times [2023-08-31 02:28:17,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:28:17,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623298409] [2023-08-31 02:28:17,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:17,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:28:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:18,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:18,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:28:18,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623298409] [2023-08-31 02:28:18,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623298409] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:28:18,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:28:18,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:28:18,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912101026] [2023-08-31 02:28:18,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:28:18,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:28:18,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:28:18,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:28:18,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:28:18,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 202 [2023-08-31 02:28:18,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 269 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:18,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:28:18,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 202 [2023-08-31 02:28:18,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:28:18,795 INFO L130 PetriNetUnfolder]: 5671/7868 cut-off events. [2023-08-31 02:28:18,796 INFO L131 PetriNetUnfolder]: For 25451/26949 co-relation queries the response was YES. [2023-08-31 02:28:18,810 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-08-31 02:28:18,849 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 108 selfloop transitions, 6 changer transitions 0/120 dead transitions. [2023-08-31 02:28:18,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 120 transitions, 891 flow [2023-08-31 02:28:18,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:28:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:28:18,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 548 transitions. [2023-08-31 02:28:18,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5425742574257426 [2023-08-31 02:28:18,852 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 548 transitions. [2023-08-31 02:28:18,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 548 transitions. [2023-08-31 02:28:18,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:28:18,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 548 transitions. [2023-08-31 02:28:18,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:18,856 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-08-31 02:28:18,856 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-08-31 02:28:18,856 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 269 flow. Second operand 5 states and 548 transitions. [2023-08-31 02:28:18,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 120 transitions, 891 flow [2023-08-31 02:28:18,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 120 transitions, 825 flow, removed 24 selfloop flow, removed 1 redundant places. [2023-08-31 02:28:18,877 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 291 flow [2023-08-31 02:28:18,877 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-08-31 02:28:18,878 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2023-08-31 02:28:18,878 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 291 flow [2023-08-31 02:28:18,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:18,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:28:18,878 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-08-31 02:28:18,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 02:28:18,879 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-08-31 02:28:18,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:28:18,879 INFO L85 PathProgramCache]: Analyzing trace with hash -786111875, now seen corresponding path program 3 times [2023-08-31 02:28:18,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:28:18,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705291491] [2023-08-31 02:28:18,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:18,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:28:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:18,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:18,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:28:18,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705291491] [2023-08-31 02:28:18,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705291491] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:28:18,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787416762] [2023-08-31 02:28:18,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 02:28:18,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:28:18,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:28:18,956 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:28:18,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-31 02:28:19,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-31 02:28:19,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:28:19,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 02:28:19,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:28:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:19,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:28:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:19,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787416762] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:28:19,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:28:19,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-31 02:28:19,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431125246] [2023-08-31 02:28:19,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:28:19,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 02:28:19,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:28:19,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 02:28:19,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-31 02:28:19,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-31 02:28:19,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 291 flow. Second operand has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:19,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:28:19,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-31 02:28:19,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:28:20,373 INFO L130 PetriNetUnfolder]: 8386/11509 cut-off events. [2023-08-31 02:28:20,373 INFO L131 PetriNetUnfolder]: For 32012/33129 co-relation queries the response was YES. [2023-08-31 02:28:20,406 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-08-31 02:28:20,458 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 152 selfloop transitions, 20 changer transitions 0/177 dead transitions. [2023-08-31 02:28:20,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 177 transitions, 1265 flow [2023-08-31 02:28:20,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 02:28:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 02:28:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 867 transitions. [2023-08-31 02:28:20,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.536509900990099 [2023-08-31 02:28:20,462 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 867 transitions. [2023-08-31 02:28:20,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 867 transitions. [2023-08-31 02:28:20,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:28:20,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 867 transitions. [2023-08-31 02:28:20,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.375) internal successors, (867), 8 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:20,467 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-08-31 02:28:20,468 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-08-31 02:28:20,468 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 291 flow. Second operand 8 states and 867 transitions. [2023-08-31 02:28:20,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 177 transitions, 1265 flow [2023-08-31 02:28:20,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 177 transitions, 1223 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-31 02:28:20,509 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 466 flow [2023-08-31 02:28:20,509 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-08-31 02:28:20,510 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 32 predicate places. [2023-08-31 02:28:20,510 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 466 flow [2023-08-31 02:28:20,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:20,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:28:20,511 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-08-31 02:28:20,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-31 02:28:20,717 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-08-31 02:28:20,717 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-08-31 02:28:20,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:28:20,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1812859993, now seen corresponding path program 4 times [2023-08-31 02:28:20,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:28:20,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498873491] [2023-08-31 02:28:20,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:20,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:28:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:20,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:28:20,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498873491] [2023-08-31 02:28:20,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498873491] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:28:20,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:28:20,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:28:20,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216877067] [2023-08-31 02:28:20,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:28:20,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:28:20,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:28:20,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:28:20,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:28:20,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-31 02:28:20,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 466 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:20,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:28:20,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-31 02:28:20,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:28:21,922 INFO L130 PetriNetUnfolder]: 10374/14611 cut-off events. [2023-08-31 02:28:21,922 INFO L131 PetriNetUnfolder]: For 59618/61272 co-relation queries the response was YES. [2023-08-31 02:28:21,957 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-08-31 02:28:22,024 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 137 selfloop transitions, 17 changer transitions 0/164 dead transitions. [2023-08-31 02:28:22,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 164 transitions, 1364 flow [2023-08-31 02:28:22,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 02:28:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 02:28:22,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 657 transitions. [2023-08-31 02:28:22,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5420792079207921 [2023-08-31 02:28:22,027 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 657 transitions. [2023-08-31 02:28:22,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 657 transitions. [2023-08-31 02:28:22,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:28:22,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 657 transitions. [2023-08-31 02:28:22,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:22,031 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-08-31 02:28:22,032 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-08-31 02:28:22,032 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 466 flow. Second operand 6 states and 657 transitions. [2023-08-31 02:28:22,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 164 transitions, 1364 flow [2023-08-31 02:28:22,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 164 transitions, 1326 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-31 02:28:22,127 INFO L231 Difference]: Finished difference. Result has 74 places, 72 transitions, 576 flow [2023-08-31 02:28:22,127 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-08-31 02:28:22,130 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2023-08-31 02:28:22,130 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 72 transitions, 576 flow [2023-08-31 02:28:22,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:22,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:28:22,131 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-08-31 02:28:22,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 02:28:22,131 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-08-31 02:28:22,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:28:22,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2097457269, now seen corresponding path program 5 times [2023-08-31 02:28:22,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:28:22,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758889935] [2023-08-31 02:28:22,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:22,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:28:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:22,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:28:22,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758889935] [2023-08-31 02:28:22,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758889935] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:28:22,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:28:22,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:28:22,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429798860] [2023-08-31 02:28:22,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:28:22,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:28:22,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:28:22,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:28:22,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:28:22,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 202 [2023-08-31 02:28:22,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 72 transitions, 576 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:22,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:28:22,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 202 [2023-08-31 02:28:22,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:28:23,412 INFO L130 PetriNetUnfolder]: 11079/15861 cut-off events. [2023-08-31 02:28:23,412 INFO L131 PetriNetUnfolder]: For 70431/72335 co-relation queries the response was YES. [2023-08-31 02:28:23,442 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-08-31 02:28:23,506 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 141 selfloop transitions, 11 changer transitions 0/162 dead transitions. [2023-08-31 02:28:23,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 162 transitions, 1461 flow [2023-08-31 02:28:23,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:28:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:28:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2023-08-31 02:28:23,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5465346534653466 [2023-08-31 02:28:23,509 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 552 transitions. [2023-08-31 02:28:23,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 552 transitions. [2023-08-31 02:28:23,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:28:23,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 552 transitions. [2023-08-31 02:28:23,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:23,512 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-08-31 02:28:23,513 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-08-31 02:28:23,513 INFO L175 Difference]: Start difference. First operand has 74 places, 72 transitions, 576 flow. Second operand 5 states and 552 transitions. [2023-08-31 02:28:23,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 162 transitions, 1461 flow [2023-08-31 02:28:23,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 162 transitions, 1461 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 02:28:23,643 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 638 flow [2023-08-31 02:28:23,643 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-08-31 02:28:23,644 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2023-08-31 02:28:23,644 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 638 flow [2023-08-31 02:28:23,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:23,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:28:23,645 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-08-31 02:28:23,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 02:28:23,645 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-08-31 02:28:23,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:28:23,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1571815567, now seen corresponding path program 6 times [2023-08-31 02:28:23,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:28:23,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552692687] [2023-08-31 02:28:23,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:23,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:28:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:23,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:23,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:28:23,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552692687] [2023-08-31 02:28:23,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552692687] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:28:23,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193753223] [2023-08-31 02:28:23,763 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 02:28:23,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:28:23,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:28:23,765 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:28:23,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-31 02:28:23,866 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-31 02:28:23,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:28:23,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 02:28:23,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:28:23,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:23,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:28:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:23,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193753223] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:28:23,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:28:23,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-31 02:28:23,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107026297] [2023-08-31 02:28:23,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:28:23,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 02:28:23,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:28:23,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 02:28:23,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-31 02:28:23,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-31 02:28:23,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 638 flow. Second operand has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:23,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:28:23,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-31 02:28:23,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:28:24,418 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-08-31 02:28:24,418 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-31 02:28:24,418 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-31 02:28:24,418 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-31 02:28:24,418 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-31 02:28:24,421 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-08-31 02:28:24,421 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-31 02:28:24,421 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-31 02:28:24,421 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-31 02:28:24,421 INFO L386 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-31 02:28:24,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][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-08-31 02:28:24,516 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,516 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,516 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-31 02:28:24,516 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-31 02:28:24,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, 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-08-31 02:28:24,519 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,519 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-31 02:28:24,519 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-31 02:28:24,519 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,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][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-08-31 02:28:24,530 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,531 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-31 02:28:24,531 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,531 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-31 02:28:24,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][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-08-31 02:28:24,532 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,532 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-31 02:28:24,533 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,533 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-31 02:28:24,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][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-08-31 02:28:24,534 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,534 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,534 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-31 02:28:24,534 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-31 02:28:24,675 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-08-31 02:28:24,676 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,676 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,676 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,676 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,677 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-08-31 02:28:24,677 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,677 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,677 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,677 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,679 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-08-31 02:28:24,679 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,679 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,679 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,679 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,687 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-08-31 02:28:24,687 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,687 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,687 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,687 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,688 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-08-31 02:28:24,688 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,688 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,688 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,688 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,689 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-08-31 02:28:24,689 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,689 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,689 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,689 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,691 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-08-31 02:28:24,691 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,691 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,691 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,691 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:24,839 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-08-31 02:28:24,839 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,840 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,840 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,840 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,841 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-08-31 02:28:24,841 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,841 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,842 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,842 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,843 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-08-31 02:28:24,844 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,844 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,844 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,844 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,846 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-08-31 02:28:24,846 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,846 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,846 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,847 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,855 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-08-31 02:28:24,856 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,856 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,856 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,856 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,856 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-08-31 02:28:24,857 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,857 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,857 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,857 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:24,955 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-08-31 02:28:24,956 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 02:28:24,956 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 02:28:24,956 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,956 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,957 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-08-31 02:28:24,957 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 02:28:24,957 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,957 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 02:28:24,957 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,959 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-08-31 02:28:24,959 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 02:28:24,959 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,959 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 02:28:24,959 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,965 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-08-31 02:28:24,965 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 02:28:24,965 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 02:28:24,965 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:24,965 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:25,037 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-08-31 02:28:25,038 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 02:28:25,038 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 02:28:25,038 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 02:28:25,038 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 02:28:25,039 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-08-31 02:28:25,039 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 02:28:25,040 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 02:28:25,040 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 02:28:25,040 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 02:28:25,048 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-08-31 02:28:25,048 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 02:28:25,048 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 02:28:25,048 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 02:28:25,048 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 02:28:25,118 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-08-31 02:28:25,118 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 02:28:25,118 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 02:28:25,118 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 02:28:25,118 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 02:28:25,289 INFO L130 PetriNetUnfolder]: 12225/17299 cut-off events. [2023-08-31 02:28:25,289 INFO L131 PetriNetUnfolder]: For 90018/91284 co-relation queries the response was YES. [2023-08-31 02:28:25,394 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-08-31 02:28:25,643 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 119 selfloop transitions, 31 changer transitions 0/157 dead transitions. [2023-08-31 02:28:25,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 157 transitions, 1499 flow [2023-08-31 02:28:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:28:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:28:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 545 transitions. [2023-08-31 02:28:25,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396039603960396 [2023-08-31 02:28:25,659 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 545 transitions. [2023-08-31 02:28:25,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 545 transitions. [2023-08-31 02:28:25,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:28:25,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 545 transitions. [2023-08-31 02:28:25,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:25,663 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-08-31 02:28:25,663 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-08-31 02:28:25,663 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 638 flow. Second operand 5 states and 545 transitions. [2023-08-31 02:28:25,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 157 transitions, 1499 flow [2023-08-31 02:28:25,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 157 transitions, 1460 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 02:28:25,800 INFO L231 Difference]: Finished difference. Result has 85 places, 85 transitions, 875 flow [2023-08-31 02:28:25,801 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-08-31 02:28:25,801 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 47 predicate places. [2023-08-31 02:28:25,801 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 85 transitions, 875 flow [2023-08-31 02:28:25,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:25,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:28:25,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-08-31 02:28:25,808 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-08-31 02:28:26,008 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-08-31 02:28:26,008 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-08-31 02:28:26,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:28:26,009 INFO L85 PathProgramCache]: Analyzing trace with hash -212221697, now seen corresponding path program 1 times [2023-08-31 02:28:26,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:28:26,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923038760] [2023-08-31 02:28:26,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:26,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:28:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:26,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:28:26,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923038760] [2023-08-31 02:28:26,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923038760] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:28:26,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:28:26,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:28:26,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211684284] [2023-08-31 02:28:26,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:28:26,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:28:26,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:28:26,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:28:26,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:28:26,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-31 02:28:26,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 85 transitions, 875 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:26,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:28:26,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-31 02:28:26,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:28:28,074 INFO L130 PetriNetUnfolder]: 15528/22702 cut-off events. [2023-08-31 02:28:28,074 INFO L131 PetriNetUnfolder]: For 139262/141033 co-relation queries the response was YES. [2023-08-31 02:28:28,149 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-08-31 02:28:28,309 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 161 selfloop transitions, 52 changer transitions 4/226 dead transitions. [2023-08-31 02:28:28,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 226 transitions, 2528 flow [2023-08-31 02:28:28,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 02:28:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 02:28:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 649 transitions. [2023-08-31 02:28:28,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5354785478547854 [2023-08-31 02:28:28,311 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 649 transitions. [2023-08-31 02:28:28,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 649 transitions. [2023-08-31 02:28:28,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:28:28,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 649 transitions. [2023-08-31 02:28:28,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:28,315 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-08-31 02:28:28,315 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-08-31 02:28:28,316 INFO L175 Difference]: Start difference. First operand has 85 places, 85 transitions, 875 flow. Second operand 6 states and 649 transitions. [2023-08-31 02:28:28,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 226 transitions, 2528 flow [2023-08-31 02:28:28,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 226 transitions, 2444 flow, removed 22 selfloop flow, removed 1 redundant places. [2023-08-31 02:28:28,601 INFO L231 Difference]: Finished difference. Result has 93 places, 114 transitions, 1322 flow [2023-08-31 02:28:28,601 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-08-31 02:28:28,602 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 55 predicate places. [2023-08-31 02:28:28,602 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 114 transitions, 1322 flow [2023-08-31 02:28:28,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:28,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:28:28,602 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-08-31 02:28:28,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 02:28:28,602 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-08-31 02:28:28,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:28:28,603 INFO L85 PathProgramCache]: Analyzing trace with hash 550303848, now seen corresponding path program 3 times [2023-08-31 02:28:28,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:28:28,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389217536] [2023-08-31 02:28:28,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:28,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:28:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:28,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:28:28,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389217536] [2023-08-31 02:28:28,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389217536] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:28:28,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:28:28,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:28:28,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754788399] [2023-08-31 02:28:28,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:28:28,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:28:28,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:28:28,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:28:28,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:28:28,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-31 02:28:28,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 114 transitions, 1322 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:28,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:28:28,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-31 02:28:28,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:28:29,416 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-08-31 02:28:29,417 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2023-08-31 02:28:29,417 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-08-31 02:28:29,417 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-08-31 02:28:29,417 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2023-08-31 02:28:29,432 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-08-31 02:28:29,432 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-31 02:28:29,432 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:29,432 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:29,432 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-31 02:28:29,789 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-08-31 02:28:29,789 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2023-08-31 02:28:29,789 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-08-31 02:28:29,790 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-08-31 02:28:29,790 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-08-31 02:28:29,800 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-08-31 02:28:29,800 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-31 02:28:29,800 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:29,800 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:29,800 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:29,812 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-08-31 02:28:29,812 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2023-08-31 02:28:29,812 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-08-31 02:28:29,812 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-08-31 02:28:29,812 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-08-31 02:28:29,824 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-08-31 02:28:29,824 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-31 02:28:29,824 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:29,824 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:29,824 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-31 02:28:30,097 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-08-31 02:28:30,098 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is not cut-off event [2023-08-31 02:28:30,098 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-08-31 02:28:30,098 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-08-31 02:28:30,098 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-08-31 02:28:30,112 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-08-31 02:28:30,112 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-31 02:28:30,112 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:30,112 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:30,112 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:30,113 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-08-31 02:28:30,113 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-31 02:28:30,113 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:30,113 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:30,113 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-31 02:28:30,530 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-08-31 02:28:30,531 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 02:28:30,531 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 02:28:30,531 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 02:28:30,531 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 02:28:30,531 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-08-31 02:28:30,532 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 02:28:30,532 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 02:28:30,532 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 02:28:30,532 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 02:28:30,732 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-08-31 02:28:30,732 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 02:28:30,732 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 02:28:30,732 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 02:28:30,732 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 02:28:31,244 INFO L130 PetriNetUnfolder]: 20473/29469 cut-off events. [2023-08-31 02:28:31,244 INFO L131 PetriNetUnfolder]: For 236429/240162 co-relation queries the response was YES. [2023-08-31 02:28:31,329 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-08-31 02:28:31,405 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 246 selfloop transitions, 47 changer transitions 1/303 dead transitions. [2023-08-31 02:28:31,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 303 transitions, 4000 flow [2023-08-31 02:28:31,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 02:28:31,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 02:28:31,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2023-08-31 02:28:31,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5305280528052805 [2023-08-31 02:28:31,408 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 643 transitions. [2023-08-31 02:28:31,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions. [2023-08-31 02:28:31,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:28:31,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions. [2023-08-31 02:28:31,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:31,411 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-08-31 02:28:31,412 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-08-31 02:28:31,412 INFO L175 Difference]: Start difference. First operand has 93 places, 114 transitions, 1322 flow. Second operand 6 states and 643 transitions. [2023-08-31 02:28:31,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 303 transitions, 4000 flow [2023-08-31 02:28:32,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 303 transitions, 3992 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-31 02:28:32,005 INFO L231 Difference]: Finished difference. Result has 102 places, 147 transitions, 1986 flow [2023-08-31 02:28:32,005 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-08-31 02:28:32,005 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 64 predicate places. [2023-08-31 02:28:32,006 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 147 transitions, 1986 flow [2023-08-31 02:28:32,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:32,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:28:32,006 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-08-31 02:28:32,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 02:28:32,006 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-08-31 02:28:32,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:28:32,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1556227291, now seen corresponding path program 2 times [2023-08-31 02:28:32,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:28:32,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347378294] [2023-08-31 02:28:32,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:32,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:28:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:32,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:32,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:28:32,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347378294] [2023-08-31 02:28:32,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347378294] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:28:32,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:28:32,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:28:32,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715683310] [2023-08-31 02:28:32,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:28:32,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:28:32,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:28:32,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:28:32,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:28:32,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-31 02:28:32,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 147 transitions, 1986 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:32,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:28:32,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-31 02:28:32,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:28:34,931 INFO L130 PetriNetUnfolder]: 19448/28253 cut-off events. [2023-08-31 02:28:34,932 INFO L131 PetriNetUnfolder]: For 276671/281367 co-relation queries the response was YES. [2023-08-31 02:28:35,028 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-08-31 02:28:35,105 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 268 selfloop transitions, 41 changer transitions 11/337 dead transitions. [2023-08-31 02:28:35,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 337 transitions, 4694 flow [2023-08-31 02:28:35,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 02:28:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 02:28:35,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 655 transitions. [2023-08-31 02:28:35,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5404290429042904 [2023-08-31 02:28:35,109 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 655 transitions. [2023-08-31 02:28:35,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 655 transitions. [2023-08-31 02:28:35,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:28:35,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 655 transitions. [2023-08-31 02:28:35,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:35,113 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-08-31 02:28:35,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-08-31 02:28:35,114 INFO L175 Difference]: Start difference. First operand has 102 places, 147 transitions, 1986 flow. Second operand 6 states and 655 transitions. [2023-08-31 02:28:35,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 337 transitions, 4694 flow [2023-08-31 02:28:36,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 337 transitions, 4592 flow, removed 51 selfloop flow, removed 0 redundant places. [2023-08-31 02:28:36,034 INFO L231 Difference]: Finished difference. Result has 110 places, 172 transitions, 2600 flow [2023-08-31 02:28:36,034 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-08-31 02:28:36,035 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 72 predicate places. [2023-08-31 02:28:36,035 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 172 transitions, 2600 flow [2023-08-31 02:28:36,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:36,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:28:36,036 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-08-31 02:28:36,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 02:28:36,036 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-08-31 02:28:36,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:28:36,036 INFO L85 PathProgramCache]: Analyzing trace with hash 371724395, now seen corresponding path program 3 times [2023-08-31 02:28:36,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:28:36,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777065563] [2023-08-31 02:28:36,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:36,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:28:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:36,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:28:36,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777065563] [2023-08-31 02:28:36,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777065563] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:28:36,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:28:36,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:28:36,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192343906] [2023-08-31 02:28:36,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:28:36,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:28:36,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:28:36,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:28:36,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:28:36,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-31 02:28:36,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 172 transitions, 2600 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:36,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:28:36,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-31 02:28:36,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:28:39,547 INFO L130 PetriNetUnfolder]: 23525/35070 cut-off events. [2023-08-31 02:28:39,548 INFO L131 PetriNetUnfolder]: For 340488/342579 co-relation queries the response was YES. [2023-08-31 02:28:39,685 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-08-31 02:28:39,775 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 283 selfloop transitions, 48 changer transitions 22/390 dead transitions. [2023-08-31 02:28:39,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 390 transitions, 5724 flow [2023-08-31 02:28:39,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 02:28:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 02:28:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 653 transitions. [2023-08-31 02:28:39,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5387788778877888 [2023-08-31 02:28:39,777 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 653 transitions. [2023-08-31 02:28:39,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 653 transitions. [2023-08-31 02:28:39,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:28:39,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 653 transitions. [2023-08-31 02:28:39,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:39,780 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-08-31 02:28:39,780 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-08-31 02:28:39,780 INFO L175 Difference]: Start difference. First operand has 110 places, 172 transitions, 2600 flow. Second operand 6 states and 653 transitions. [2023-08-31 02:28:39,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 390 transitions, 5724 flow [2023-08-31 02:28:41,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 390 transitions, 5605 flow, removed 42 selfloop flow, removed 2 redundant places. [2023-08-31 02:28:41,397 INFO L231 Difference]: Finished difference. Result has 117 places, 211 transitions, 3311 flow [2023-08-31 02:28:41,397 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-08-31 02:28:41,397 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 79 predicate places. [2023-08-31 02:28:41,398 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 211 transitions, 3311 flow [2023-08-31 02:28:41,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:41,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:28:41,398 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-08-31 02:28:41,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 02:28:41,398 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-08-31 02:28:41,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:28:41,399 INFO L85 PathProgramCache]: Analyzing trace with hash 153042763, now seen corresponding path program 4 times [2023-08-31 02:28:41,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:28:41,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178190552] [2023-08-31 02:28:41,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:41,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:28:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:41,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:28:41,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178190552] [2023-08-31 02:28:41,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178190552] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:28:41,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:28:41,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:28:41,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631711481] [2023-08-31 02:28:41,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:28:41,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:28:41,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:28:41,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:28:41,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:28:41,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-31 02:28:41,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 211 transitions, 3311 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:41,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:28:41,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-31 02:28:41,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:28:46,028 INFO L130 PetriNetUnfolder]: 26685/40089 cut-off events. [2023-08-31 02:28:46,028 INFO L131 PetriNetUnfolder]: For 493723/496874 co-relation queries the response was YES. [2023-08-31 02:28:46,221 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-08-31 02:28:46,341 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 337 selfloop transitions, 48 changer transitions 20/442 dead transitions. [2023-08-31 02:28:46,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 442 transitions, 7325 flow [2023-08-31 02:28:46,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:28:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:28:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2023-08-31 02:28:46,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5326732673267327 [2023-08-31 02:28:46,343 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2023-08-31 02:28:46,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2023-08-31 02:28:46,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:28:46,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2023-08-31 02:28:46,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:46,345 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-08-31 02:28:46,346 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-08-31 02:28:46,346 INFO L175 Difference]: Start difference. First operand has 117 places, 211 transitions, 3311 flow. Second operand 5 states and 538 transitions. [2023-08-31 02:28:46,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 442 transitions, 7325 flow [2023-08-31 02:28:49,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 442 transitions, 7257 flow, removed 34 selfloop flow, removed 0 redundant places. [2023-08-31 02:28:49,652 INFO L231 Difference]: Finished difference. Result has 124 places, 240 transitions, 3899 flow [2023-08-31 02:28:49,652 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-08-31 02:28:49,653 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 86 predicate places. [2023-08-31 02:28:49,653 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 240 transitions, 3899 flow [2023-08-31 02:28:49,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:49,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:28:49,653 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-08-31 02:28:49,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 02:28:49,653 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-08-31 02:28:49,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:28:49,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1733936133, now seen corresponding path program 5 times [2023-08-31 02:28:49,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:28:49,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100112091] [2023-08-31 02:28:49,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:49,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:28:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:49,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:28:49,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100112091] [2023-08-31 02:28:49,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100112091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:28:49,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:28:49,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:28:49,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071873719] [2023-08-31 02:28:49,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:28:49,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:28:49,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:28:49,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:28:49,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:28:49,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-31 02:28:49,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 240 transitions, 3899 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:49,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:28:49,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-31 02:28:49,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:28:54,511 INFO L130 PetriNetUnfolder]: 26719/40118 cut-off events. [2023-08-31 02:28:54,512 INFO L131 PetriNetUnfolder]: For 567927/573002 co-relation queries the response was YES. [2023-08-31 02:28:54,723 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-08-31 02:28:54,841 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 257 selfloop transitions, 75 changer transitions 8/362 dead transitions. [2023-08-31 02:28:54,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 362 transitions, 5973 flow [2023-08-31 02:28:54,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:28:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:28:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 550 transitions. [2023-08-31 02:28:54,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5445544554455446 [2023-08-31 02:28:54,843 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 550 transitions. [2023-08-31 02:28:54,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 550 transitions. [2023-08-31 02:28:54,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:28:54,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 550 transitions. [2023-08-31 02:28:54,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:54,845 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-08-31 02:28:54,845 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-08-31 02:28:54,846 INFO L175 Difference]: Start difference. First operand has 124 places, 240 transitions, 3899 flow. Second operand 5 states and 550 transitions. [2023-08-31 02:28:54,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 362 transitions, 5973 flow [2023-08-31 02:28:57,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 362 transitions, 5904 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-08-31 02:28:57,724 INFO L231 Difference]: Finished difference. Result has 128 places, 246 transitions, 4156 flow [2023-08-31 02:28:57,724 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-08-31 02:28:57,725 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 90 predicate places. [2023-08-31 02:28:57,725 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 246 transitions, 4156 flow [2023-08-31 02:28:57,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:57,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:28:57,725 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-08-31 02:28:57,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 02:28:57,726 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-08-31 02:28:57,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:28:57,726 INFO L85 PathProgramCache]: Analyzing trace with hash 724866881, now seen corresponding path program 2 times [2023-08-31 02:28:57,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:28:57,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113951974] [2023-08-31 02:28:57,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:28:57,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:28:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:28:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:57,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:28:57,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113951974] [2023-08-31 02:28:57,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113951974] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:28:57,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450021141] [2023-08-31 02:28:57,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 02:28:57,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:28:57,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:28:57,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:28:57,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-31 02:28:57,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 02:28:57,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:28:57,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 02:28:57,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:28:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:57,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:28:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:28:57,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450021141] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:28:57,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:28:57,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-31 02:28:57,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519040398] [2023-08-31 02:28:57,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:28:57,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 02:28:57,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:28:57,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 02:28:57,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-31 02:28:57,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-31 02:28:57,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 246 transitions, 4156 flow. Second operand has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:28:57,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:28:57,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-31 02:28:57,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:29:03,184 INFO L130 PetriNetUnfolder]: 28102/42070 cut-off events. [2023-08-31 02:29:03,184 INFO L131 PetriNetUnfolder]: For 584259/587926 co-relation queries the response was YES. [2023-08-31 02:29:03,414 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-08-31 02:29:03,536 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 282 selfloop transitions, 74 changer transitions 17/390 dead transitions. [2023-08-31 02:29:03,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 390 transitions, 6870 flow [2023-08-31 02:29:03,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:29:03,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:29:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2023-08-31 02:29:03,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5267326732673268 [2023-08-31 02:29:03,537 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 532 transitions. [2023-08-31 02:29:03,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 532 transitions. [2023-08-31 02:29:03,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:29:03,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 532 transitions. [2023-08-31 02:29:03,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:29:03,539 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-08-31 02:29:03,540 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-08-31 02:29:03,540 INFO L175 Difference]: Start difference. First operand has 128 places, 246 transitions, 4156 flow. Second operand 5 states and 532 transitions. [2023-08-31 02:29:03,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 390 transitions, 6870 flow [2023-08-31 02:29:07,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 390 transitions, 6701 flow, removed 26 selfloop flow, removed 2 redundant places. [2023-08-31 02:29:07,621 INFO L231 Difference]: Finished difference. Result has 132 places, 257 transitions, 4529 flow [2023-08-31 02:29:07,622 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-08-31 02:29:07,622 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 94 predicate places. [2023-08-31 02:29:07,623 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 257 transitions, 4529 flow [2023-08-31 02:29:07,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:29:07,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:29:07,623 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-08-31 02:29:07,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-31 02:29:07,830 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-08-31 02:29:07,830 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-08-31 02:29:07,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:29:07,831 INFO L85 PathProgramCache]: Analyzing trace with hash 661454854, now seen corresponding path program 4 times [2023-08-31 02:29:07,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:29:07,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153130186] [2023-08-31 02:29:07,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:29:07,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:29:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:29:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:29:07,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:29:07,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153130186] [2023-08-31 02:29:07,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153130186] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:29:07,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:29:07,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:29:07,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271016392] [2023-08-31 02:29:07,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:29:07,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:29:07,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:29:07,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:29:07,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:29:07,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-31 02:29:07,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 257 transitions, 4529 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:29:07,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:29:07,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-31 02:29:07,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:29:13,238 INFO L130 PetriNetUnfolder]: 27022/40814 cut-off events. [2023-08-31 02:29:13,239 INFO L131 PetriNetUnfolder]: For 648539/653209 co-relation queries the response was YES. [2023-08-31 02:29:13,493 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-08-31 02:29:13,614 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 273 selfloop transitions, 120 changer transitions 31/441 dead transitions. [2023-08-31 02:29:13,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 441 transitions, 8068 flow [2023-08-31 02:29:13,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:29:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:29:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 548 transitions. [2023-08-31 02:29:13,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5425742574257426 [2023-08-31 02:29:13,615 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 548 transitions. [2023-08-31 02:29:13,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 548 transitions. [2023-08-31 02:29:13,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:29:13,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 548 transitions. [2023-08-31 02:29:13,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:29:13,618 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-08-31 02:29:13,618 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-08-31 02:29:13,618 INFO L175 Difference]: Start difference. First operand has 132 places, 257 transitions, 4529 flow. Second operand 5 states and 548 transitions. [2023-08-31 02:29:13,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 441 transitions, 8068 flow [2023-08-31 02:29:17,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 441 transitions, 7929 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-08-31 02:29:17,622 INFO L231 Difference]: Finished difference. Result has 137 places, 295 transitions, 5544 flow [2023-08-31 02:29:17,622 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-08-31 02:29:17,623 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 99 predicate places. [2023-08-31 02:29:17,623 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 295 transitions, 5544 flow [2023-08-31 02:29:17,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:29:17,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:29:17,623 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-08-31 02:29:17,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-31 02:29:17,623 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-08-31 02:29:17,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:29:17,623 INFO L85 PathProgramCache]: Analyzing trace with hash -593576133, now seen corresponding path program 3 times [2023-08-31 02:29:17,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:29:17,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814290192] [2023-08-31 02:29:17,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:29:17,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:29:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:29:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:29:17,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:29:17,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814290192] [2023-08-31 02:29:17,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814290192] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:29:17,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:29:17,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:29:17,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423394243] [2023-08-31 02:29:17,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:29:17,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:29:17,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:29:17,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:29:17,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:29:17,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-31 02:29:17,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 295 transitions, 5544 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:29:17,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:29:17,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-31 02:29:17,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:29:23,698 INFO L130 PetriNetUnfolder]: 29877/44914 cut-off events. [2023-08-31 02:29:23,698 INFO L131 PetriNetUnfolder]: For 718125/722944 co-relation queries the response was YES. [2023-08-31 02:29:24,211 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-08-31 02:29:24,336 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 294 selfloop transitions, 121 changer transitions 8/445 dead transitions. [2023-08-31 02:29:24,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 445 transitions, 8306 flow [2023-08-31 02:29:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:29:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:29:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 554 transitions. [2023-08-31 02:29:24,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5485148514851486 [2023-08-31 02:29:24,338 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 554 transitions. [2023-08-31 02:29:24,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 554 transitions. [2023-08-31 02:29:24,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:29:24,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 554 transitions. [2023-08-31 02:29:24,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:29:24,341 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-08-31 02:29:24,341 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-08-31 02:29:24,341 INFO L175 Difference]: Start difference. First operand has 137 places, 295 transitions, 5544 flow. Second operand 5 states and 554 transitions. [2023-08-31 02:29:24,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 445 transitions, 8306 flow [2023-08-31 02:29:29,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 445 transitions, 8082 flow, removed 58 selfloop flow, removed 1 redundant places. [2023-08-31 02:29:29,109 INFO L231 Difference]: Finished difference. Result has 141 places, 307 transitions, 5912 flow [2023-08-31 02:29:29,109 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-08-31 02:29:29,110 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 103 predicate places. [2023-08-31 02:29:29,110 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 307 transitions, 5912 flow [2023-08-31 02:29:29,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:29:29,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:29:29,110 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-08-31 02:29:29,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-31 02:29:29,111 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-08-31 02:29:29,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:29:29,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1280457636, now seen corresponding path program 5 times [2023-08-31 02:29:29,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:29:29,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079257457] [2023-08-31 02:29:29,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:29:29,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:29:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:29:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:29:29,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:29:29,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079257457] [2023-08-31 02:29:29,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079257457] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:29:29,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911355845] [2023-08-31 02:29:29,161 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 02:29:29,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:29:29,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:29:29,165 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:29:29,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-31 02:29:29,269 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 02:29:29,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:29:29,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 02:29:29,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:29:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:29:29,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:29:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:29:29,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911355845] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:29:29,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:29:29,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-31 02:29:29,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784804099] [2023-08-31 02:29:29,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:29:29,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 02:29:29,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:29:29,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 02:29:29,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-31 02:29:29,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-31 02:29:29,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 307 transitions, 5912 flow. Second operand has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:29:29,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:29:29,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-31 02:29:29,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:29:35,645 INFO L130 PetriNetUnfolder]: 30927/46403 cut-off events. [2023-08-31 02:29:35,645 INFO L131 PetriNetUnfolder]: For 782816/787508 co-relation queries the response was YES. [2023-08-31 02:29:35,959 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-08-31 02:29:36,342 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 399 selfloop transitions, 64 changer transitions 22/502 dead transitions. [2023-08-31 02:29:36,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 502 transitions, 10330 flow [2023-08-31 02:29:36,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:29:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:29:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2023-08-31 02:29:36,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227722772277228 [2023-08-31 02:29:36,344 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions. [2023-08-31 02:29:36,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions. [2023-08-31 02:29:36,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:29:36,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions. [2023-08-31 02:29:36,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:29:36,348 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-08-31 02:29:36,349 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-08-31 02:29:36,349 INFO L175 Difference]: Start difference. First operand has 141 places, 307 transitions, 5912 flow. Second operand 5 states and 528 transitions. [2023-08-31 02:29:36,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 502 transitions, 10330 flow [2023-08-31 02:29:42,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 502 transitions, 9931 flow, removed 45 selfloop flow, removed 2 redundant places. [2023-08-31 02:29:42,359 INFO L231 Difference]: Finished difference. Result has 145 places, 331 transitions, 6445 flow [2023-08-31 02:29:42,360 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-08-31 02:29:42,360 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 107 predicate places. [2023-08-31 02:29:42,360 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 331 transitions, 6445 flow [2023-08-31 02:29:42,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:29:42,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:29:42,361 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-08-31 02:29:42,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-31 02:29:42,562 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-08-31 02:29:42,562 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-08-31 02:29:42,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:29:42,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1098078909, now seen corresponding path program 4 times [2023-08-31 02:29:42,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:29:42,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836781544] [2023-08-31 02:29:42,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:29:42,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:29:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:29:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:29:42,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:29:42,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836781544] [2023-08-31 02:29:42,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836781544] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:29:42,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:29:42,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:29:42,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219645924] [2023-08-31 02:29:42,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:29:42,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:29:42,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:29:42,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:29:42,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:29:42,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 202 [2023-08-31 02:29:42,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 331 transitions, 6445 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:29:42,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:29:42,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 202 [2023-08-31 02:29:42,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:29:49,435 INFO L130 PetriNetUnfolder]: 32086/48461 cut-off events. [2023-08-31 02:29:49,436 INFO L131 PetriNetUnfolder]: For 856277/861744 co-relation queries the response was YES. [2023-08-31 02:29:49,734 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-08-31 02:29:49,872 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 249 selfloop transitions, 147 changer transitions 23/441 dead transitions. [2023-08-31 02:29:49,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 441 transitions, 8570 flow [2023-08-31 02:29:49,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:29:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:29:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2023-08-31 02:29:49,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5465346534653466 [2023-08-31 02:29:49,874 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 552 transitions. [2023-08-31 02:29:49,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 552 transitions. [2023-08-31 02:29:49,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:29:49,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 552 transitions. [2023-08-31 02:29:49,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:29:49,876 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-08-31 02:29:49,876 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-08-31 02:29:49,876 INFO L175 Difference]: Start difference. First operand has 145 places, 331 transitions, 6445 flow. Second operand 5 states and 552 transitions. [2023-08-31 02:29:49,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 441 transitions, 8570 flow [2023-08-31 02:29:54,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 441 transitions, 8442 flow, removed 25 selfloop flow, removed 3 redundant places. [2023-08-31 02:29:54,453 INFO L231 Difference]: Finished difference. Result has 148 places, 334 transitions, 6718 flow [2023-08-31 02:29:54,453 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-08-31 02:29:54,453 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 110 predicate places. [2023-08-31 02:29:54,454 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 334 transitions, 6718 flow [2023-08-31 02:29:54,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:29:54,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:29:54,454 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-08-31 02:29:54,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-31 02:29:54,454 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-08-31 02:29:54,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:29:54,455 INFO L85 PathProgramCache]: Analyzing trace with hash -75263484, now seen corresponding path program 6 times [2023-08-31 02:29:54,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:29:54,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289042137] [2023-08-31 02:29:54,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:29:54,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:29:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:29:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:29:54,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:29:54,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289042137] [2023-08-31 02:29:54,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289042137] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:29:54,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:29:54,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:29:54,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084311796] [2023-08-31 02:29:54,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:29:54,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:29:54,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:29:54,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:29:54,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:29:54,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-31 02:29:54,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 334 transitions, 6718 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:29:54,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:29:54,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-31 02:29:54,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:30:01,395 INFO L130 PetriNetUnfolder]: 31442/47939 cut-off events. [2023-08-31 02:30:01,396 INFO L131 PetriNetUnfolder]: For 864160/866898 co-relation queries the response was YES. [2023-08-31 02:30:01,684 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-08-31 02:30:01,811 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 403 selfloop transitions, 104 changer transitions 73/617 dead transitions. [2023-08-31 02:30:01,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 617 transitions, 12476 flow [2023-08-31 02:30:01,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 02:30:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 02:30:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 647 transitions. [2023-08-31 02:30:01,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5338283828382838 [2023-08-31 02:30:01,813 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 647 transitions. [2023-08-31 02:30:01,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 647 transitions. [2023-08-31 02:30:01,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:30:01,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 647 transitions. [2023-08-31 02:30:01,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:30:01,816 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-08-31 02:30:01,816 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-08-31 02:30:01,816 INFO L175 Difference]: Start difference. First operand has 148 places, 334 transitions, 6718 flow. Second operand 6 states and 647 transitions. [2023-08-31 02:30:01,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 617 transitions, 12476 flow [2023-08-31 02:30:06,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 617 transitions, 12120 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-31 02:30:06,955 INFO L231 Difference]: Finished difference. Result has 155 places, 390 transitions, 7945 flow [2023-08-31 02:30:06,955 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-08-31 02:30:06,956 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 117 predicate places. [2023-08-31 02:30:06,956 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 390 transitions, 7945 flow [2023-08-31 02:30:06,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:30:06,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:30:06,956 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-08-31 02:30:06,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-31 02:30:06,957 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-08-31 02:30:06,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:30:06,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1821063516, now seen corresponding path program 7 times [2023-08-31 02:30:06,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:30:06,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609451210] [2023-08-31 02:30:06,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:30:06,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:30:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:30:07,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:30:07,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:30:07,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609451210] [2023-08-31 02:30:07,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609451210] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:30:07,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:30:07,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:30:07,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431054871] [2023-08-31 02:30:07,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:30:07,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:30:07,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:30:07,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:30:07,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:30:07,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-31 02:30:07,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 390 transitions, 7945 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:30:07,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:30:07,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-31 02:30:07,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:30:14,196 INFO L130 PetriNetUnfolder]: 30968/46642 cut-off events. [2023-08-31 02:30:14,196 INFO L131 PetriNetUnfolder]: For 926450/929539 co-relation queries the response was YES. [2023-08-31 02:30:14,535 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-08-31 02:30:14,675 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 306 selfloop transitions, 169 changer transitions 22/530 dead transitions. [2023-08-31 02:30:14,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 530 transitions, 11154 flow [2023-08-31 02:30:14,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:30:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:30:14,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2023-08-31 02:30:14,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5366336633663367 [2023-08-31 02:30:14,677 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 542 transitions. [2023-08-31 02:30:14,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 542 transitions. [2023-08-31 02:30:14,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:30:14,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 542 transitions. [2023-08-31 02:30:14,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:30:14,679 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-08-31 02:30:14,679 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-08-31 02:30:14,679 INFO L175 Difference]: Start difference. First operand has 155 places, 390 transitions, 7945 flow. Second operand 5 states and 542 transitions. [2023-08-31 02:30:14,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 530 transitions, 11154 flow [2023-08-31 02:30:20,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 530 transitions, 11078 flow, removed 38 selfloop flow, removed 0 redundant places. [2023-08-31 02:30:20,515 INFO L231 Difference]: Finished difference. Result has 160 places, 409 transitions, 8720 flow [2023-08-31 02:30:20,515 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-08-31 02:30:20,516 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 122 predicate places. [2023-08-31 02:30:20,516 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 409 transitions, 8720 flow [2023-08-31 02:30:20,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:30:20,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:30:20,516 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-08-31 02:30:20,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-31 02:30:20,517 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-08-31 02:30:20,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:30:20,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2013740015, now seen corresponding path program 5 times [2023-08-31 02:30:20,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:30:20,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234808511] [2023-08-31 02:30:20,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:30:20,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:30:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:30:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:30:20,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:30:20,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234808511] [2023-08-31 02:30:20,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234808511] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:30:20,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:30:20,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:30:20,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714994277] [2023-08-31 02:30:20,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:30:20,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:30:20,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:30:20,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:30:20,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:30:20,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-31 02:30:20,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 409 transitions, 8720 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:30:20,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:30:20,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-31 02:30:20,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:30:27,253 INFO L130 PetriNetUnfolder]: 27955/41862 cut-off events. [2023-08-31 02:30:27,253 INFO L131 PetriNetUnfolder]: For 940457/946048 co-relation queries the response was YES. [2023-08-31 02:30:27,521 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-08-31 02:30:27,633 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 314 selfloop transitions, 185 changer transitions 30/551 dead transitions. [2023-08-31 02:30:27,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 551 transitions, 11826 flow [2023-08-31 02:30:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:30:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:30:27,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 550 transitions. [2023-08-31 02:30:27,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5445544554455446 [2023-08-31 02:30:27,635 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 550 transitions. [2023-08-31 02:30:27,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 550 transitions. [2023-08-31 02:30:27,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:30:27,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 550 transitions. [2023-08-31 02:30:27,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:30:27,637 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-08-31 02:30:27,637 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-08-31 02:30:27,638 INFO L175 Difference]: Start difference. First operand has 160 places, 409 transitions, 8720 flow. Second operand 5 states and 550 transitions. [2023-08-31 02:30:27,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 551 transitions, 11826 flow [2023-08-31 02:30:31,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 551 transitions, 11392 flow, removed 45 selfloop flow, removed 3 redundant places. [2023-08-31 02:30:31,987 INFO L231 Difference]: Finished difference. Result has 162 places, 420 transitions, 9009 flow [2023-08-31 02:30:31,987 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-08-31 02:30:31,987 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 124 predicate places. [2023-08-31 02:30:31,987 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 420 transitions, 9009 flow [2023-08-31 02:30:31,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:30:31,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:30:31,988 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-08-31 02:30:31,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-31 02:30:31,988 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-08-31 02:30:31,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:30:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash 328926055, now seen corresponding path program 6 times [2023-08-31 02:30:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:30:31,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532965334] [2023-08-31 02:30:31,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:30:31,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:30:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:30:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:30:32,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:30:32,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532965334] [2023-08-31 02:30:32,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532965334] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:30:32,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190350563] [2023-08-31 02:30:32,040 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 02:30:32,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:30:32,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:30:32,045 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:30:32,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-31 02:30:32,210 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-31 02:30:32,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:30:32,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 02:30:32,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:30:32,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-08-31 02:30:32,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:30:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:30:32,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190350563] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:30:32,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:30:32,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-31 02:30:32,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806518194] [2023-08-31 02:30:32,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:30:32,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 02:30:32,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:30:32,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 02:30:32,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-31 02:30:32,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-31 02:30:32,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 420 transitions, 9009 flow. Second operand has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:30:32,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:30:32,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-31 02:30:32,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:30:39,823 INFO L130 PetriNetUnfolder]: 30804/45994 cut-off events. [2023-08-31 02:30:39,823 INFO L131 PetriNetUnfolder]: For 1028273/1032695 co-relation queries the response was YES. [2023-08-31 02:30:40,111 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-08-31 02:30:40,239 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 416 selfloop transitions, 163 changer transitions 26/651 dead transitions. [2023-08-31 02:30:40,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 651 transitions, 14204 flow [2023-08-31 02:30:40,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:30:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:30:40,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 545 transitions. [2023-08-31 02:30:40,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396039603960396 [2023-08-31 02:30:40,240 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 545 transitions. [2023-08-31 02:30:40,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 545 transitions. [2023-08-31 02:30:40,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:30:40,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 545 transitions. [2023-08-31 02:30:40,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:30:40,242 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-08-31 02:30:40,242 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-08-31 02:30:40,243 INFO L175 Difference]: Start difference. First operand has 162 places, 420 transitions, 9009 flow. Second operand 5 states and 545 transitions. [2023-08-31 02:30:40,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 651 transitions, 14204 flow [2023-08-31 02:30:46,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 651 transitions, 13622 flow, removed 54 selfloop flow, removed 4 redundant places. [2023-08-31 02:30:46,271 INFO L231 Difference]: Finished difference. Result has 165 places, 481 transitions, 10412 flow [2023-08-31 02:30:46,272 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-08-31 02:30:46,272 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 127 predicate places. [2023-08-31 02:30:46,273 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 481 transitions, 10412 flow [2023-08-31 02:30:46,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:30:46,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:30:46,274 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-08-31 02:30:46,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-31 02:30:46,479 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-08-31 02:30:46,479 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-08-31 02:30:46,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:30:46,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1550796492, now seen corresponding path program 8 times [2023-08-31 02:30:46,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:30:46,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917460393] [2023-08-31 02:30:46,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:30:46,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:30:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:30:46,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:30:46,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:30:46,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917460393] [2023-08-31 02:30:46,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917460393] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:30:46,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:30:46,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:30:46,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882373376] [2023-08-31 02:30:46,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:30:46,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:30:46,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:30:46,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:30:46,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:30:46,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-31 02:30:46,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 481 transitions, 10412 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:30:46,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:30:46,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-31 02:30:46,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:30:54,308 INFO L130 PetriNetUnfolder]: 30448/45750 cut-off events. [2023-08-31 02:30:54,308 INFO L131 PetriNetUnfolder]: For 988654/990532 co-relation queries the response was YES. [2023-08-31 02:30:54,648 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-08-31 02:30:54,780 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 487 selfloop transitions, 97 changer transitions 77/715 dead transitions. [2023-08-31 02:30:54,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 715 transitions, 15601 flow [2023-08-31 02:30:54,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:30:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:30:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 546 transitions. [2023-08-31 02:30:54,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5405940594059406 [2023-08-31 02:30:54,781 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 546 transitions. [2023-08-31 02:30:54,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 546 transitions. [2023-08-31 02:30:54,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:30:54,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 546 transitions. [2023-08-31 02:30:54,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:30:54,783 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-08-31 02:30:54,783 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-08-31 02:30:54,783 INFO L175 Difference]: Start difference. First operand has 165 places, 481 transitions, 10412 flow. Second operand 5 states and 546 transitions. [2023-08-31 02:30:54,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 715 transitions, 15601 flow [2023-08-31 02:31:01,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 715 transitions, 15241 flow, removed 96 selfloop flow, removed 1 redundant places. [2023-08-31 02:31:01,016 INFO L231 Difference]: Finished difference. Result has 171 places, 524 transitions, 11402 flow [2023-08-31 02:31:01,017 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-08-31 02:31:01,017 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 133 predicate places. [2023-08-31 02:31:01,017 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 524 transitions, 11402 flow [2023-08-31 02:31:01,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:31:01,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:31:01,017 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-08-31 02:31:01,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-31 02:31:01,018 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-08-31 02:31:01,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:31:01,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1955010241, now seen corresponding path program 7 times [2023-08-31 02:31:01,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:31:01,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929741679] [2023-08-31 02:31:01,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:31:01,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:31:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:31:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:31:01,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:31:01,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929741679] [2023-08-31 02:31:01,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929741679] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:31:01,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443523257] [2023-08-31 02:31:01,069 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-31 02:31:01,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:31:01,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:31:01,073 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:31:01,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-31 02:31:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:31:01,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 02:31:01,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:31:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:31:01,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:31:01,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:31:01,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443523257] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:31:01,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:31:01,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-31 02:31:01,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860847572] [2023-08-31 02:31:01,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:31:01,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 02:31:01,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:31:01,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 02:31:01,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-31 02:31:01,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-31 02:31:01,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 524 transitions, 11402 flow. Second operand has 10 states, 10 states have (on average 95.7) internal successors, (957), 10 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:31:01,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:31:01,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-31 02:31:01,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:31:08,896 INFO L130 PetriNetUnfolder]: 28497/42251 cut-off events. [2023-08-31 02:31:08,897 INFO L131 PetriNetUnfolder]: For 1036949/1041043 co-relation queries the response was YES. [2023-08-31 02:31:09,155 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-08-31 02:31:09,282 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 574 selfloop transitions, 161 changer transitions 81/868 dead transitions. [2023-08-31 02:31:09,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 868 transitions, 18971 flow [2023-08-31 02:31:09,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 02:31:09,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 02:31:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 861 transitions. [2023-08-31 02:31:09,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5327970297029703 [2023-08-31 02:31:09,284 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 861 transitions. [2023-08-31 02:31:09,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 861 transitions. [2023-08-31 02:31:09,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:31:09,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 861 transitions. [2023-08-31 02:31:09,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.625) internal successors, (861), 8 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:31:09,287 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-08-31 02:31:09,287 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-08-31 02:31:09,287 INFO L175 Difference]: Start difference. First operand has 171 places, 524 transitions, 11402 flow. Second operand 8 states and 861 transitions. [2023-08-31 02:31:09,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 868 transitions, 18971 flow [2023-08-31 02:31:15,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 868 transitions, 18711 flow, removed 101 selfloop flow, removed 1 redundant places. [2023-08-31 02:31:15,041 INFO L231 Difference]: Finished difference. Result has 179 places, 546 transitions, 12220 flow [2023-08-31 02:31:15,041 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-08-31 02:31:15,041 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 141 predicate places. [2023-08-31 02:31:15,041 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 546 transitions, 12220 flow [2023-08-31 02:31:15,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.7) internal successors, (957), 10 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:31:15,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:31:15,042 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-08-31 02:31:15,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-31 02:31:15,242 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-08-31 02:31:15,242 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-08-31 02:31:15,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:31:15,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1547411515, now seen corresponding path program 6 times [2023-08-31 02:31:15,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:31:15,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573548614] [2023-08-31 02:31:15,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:31:15,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:31:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:31:15,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:31:15,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:31:15,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573548614] [2023-08-31 02:31:15,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573548614] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:31:15,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:31:15,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:31:15,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407050114] [2023-08-31 02:31:15,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:31:15,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:31:15,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:31:15,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:31:15,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:31:15,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-31 02:31:15,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 546 transitions, 12220 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:31:15,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:31:15,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-31 02:31:15,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:31:21,789 INFO L130 PetriNetUnfolder]: 25160/36932 cut-off events. [2023-08-31 02:31:21,789 INFO L131 PetriNetUnfolder]: For 986589/994236 co-relation queries the response was YES. [2023-08-31 02:31:22,102 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-08-31 02:31:22,218 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 388 selfloop transitions, 235 changer transitions 75/729 dead transitions. [2023-08-31 02:31:22,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 729 transitions, 16766 flow [2023-08-31 02:31:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 02:31:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 02:31:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 648 transitions. [2023-08-31 02:31:22,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5346534653465347 [2023-08-31 02:31:22,219 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 648 transitions. [2023-08-31 02:31:22,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 648 transitions. [2023-08-31 02:31:22,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:31:22,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 648 transitions. [2023-08-31 02:31:22,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:31:22,221 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-08-31 02:31:22,221 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-08-31 02:31:22,222 INFO L175 Difference]: Start difference. First operand has 179 places, 546 transitions, 12220 flow. Second operand 6 states and 648 transitions. [2023-08-31 02:31:22,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 729 transitions, 16766 flow [2023-08-31 02:31:26,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 729 transitions, 16268 flow, removed 86 selfloop flow, removed 5 redundant places. [2023-08-31 02:31:26,376 INFO L231 Difference]: Finished difference. Result has 180 places, 545 transitions, 12355 flow [2023-08-31 02:31:26,376 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-08-31 02:31:26,377 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 142 predicate places. [2023-08-31 02:31:26,377 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 545 transitions, 12355 flow [2023-08-31 02:31:26,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:31:26,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:31:26,377 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-08-31 02:31:26,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-31 02:31:26,378 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-08-31 02:31:26,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:31:26,378 INFO L85 PathProgramCache]: Analyzing trace with hash 13754851, now seen corresponding path program 7 times [2023-08-31 02:31:26,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:31:26,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498481391] [2023-08-31 02:31:26,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:31:26,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:31:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:31:26,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:31:26,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:31:26,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498481391] [2023-08-31 02:31:26,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498481391] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:31:26,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:31:26,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:31:26,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935374336] [2023-08-31 02:31:26,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:31:26,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:31:26,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:31:26,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:31:26,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:31:26,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 202 [2023-08-31 02:31:26,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 545 transitions, 12355 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:31:26,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:31:26,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 202 [2023-08-31 02:31:26,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:31:32,690 INFO L130 PetriNetUnfolder]: 24669/35922 cut-off events. [2023-08-31 02:31:32,691 INFO L131 PetriNetUnfolder]: For 841027/843152 co-relation queries the response was YES. [2023-08-31 02:31:32,924 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-08-31 02:31:33,041 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 439 selfloop transitions, 192 changer transitions 64/733 dead transitions. [2023-08-31 02:31:33,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 733 transitions, 17092 flow [2023-08-31 02:31:33,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:31:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:31:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 546 transitions. [2023-08-31 02:31:33,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5405940594059406 [2023-08-31 02:31:33,043 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 546 transitions. [2023-08-31 02:31:33,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 546 transitions. [2023-08-31 02:31:33,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:31:33,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 546 transitions. [2023-08-31 02:31:33,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:31:33,044 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-08-31 02:31:33,045 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-08-31 02:31:33,045 INFO L175 Difference]: Start difference. First operand has 180 places, 545 transitions, 12355 flow. Second operand 5 states and 546 transitions. [2023-08-31 02:31:33,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 733 transitions, 17092 flow [2023-08-31 02:31:37,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 733 transitions, 16406 flow, removed 112 selfloop flow, removed 5 redundant places. [2023-08-31 02:31:37,733 INFO L231 Difference]: Finished difference. Result has 181 places, 553 transitions, 12456 flow [2023-08-31 02:31:37,733 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-08-31 02:31:37,734 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 143 predicate places. [2023-08-31 02:31:37,734 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 553 transitions, 12456 flow [2023-08-31 02:31:37,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:31:37,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:31:37,734 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-08-31 02:31:37,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-31 02:31:37,735 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-08-31 02:31:37,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:31:37,735 INFO L85 PathProgramCache]: Analyzing trace with hash 201753452, now seen corresponding path program 9 times [2023-08-31 02:31:37,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:31:37,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941995074] [2023-08-31 02:31:37,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:31:37,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:31:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:31:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:31:37,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:31:37,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941995074] [2023-08-31 02:31:37,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941995074] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:31:37,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:31:37,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:31:37,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687787284] [2023-08-31 02:31:37,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:31:37,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:31:37,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:31:37,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:31:37,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:31:37,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-31 02:31:37,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 553 transitions, 12456 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:31:37,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:31:37,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-31 02:31:37,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:31:44,348 INFO L130 PetriNetUnfolder]: 25669/36968 cut-off events. [2023-08-31 02:31:44,349 INFO L131 PetriNetUnfolder]: For 867355/869414 co-relation queries the response was YES. [2023-08-31 02:31:44,644 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-08-31 02:31:44,770 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 553 selfloop transitions, 93 changer transitions 22/718 dead transitions. [2023-08-31 02:31:44,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 718 transitions, 16758 flow [2023-08-31 02:31:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:31:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:31:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2023-08-31 02:31:44,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5366336633663367 [2023-08-31 02:31:44,771 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 542 transitions. [2023-08-31 02:31:44,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 542 transitions. [2023-08-31 02:31:44,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:31:44,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 542 transitions. [2023-08-31 02:31:44,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:31:44,773 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-08-31 02:31:44,773 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-08-31 02:31:44,773 INFO L175 Difference]: Start difference. First operand has 181 places, 553 transitions, 12456 flow. Second operand 5 states and 542 transitions. [2023-08-31 02:31:44,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 718 transitions, 16758 flow [2023-08-31 02:31:50,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 718 transitions, 16201 flow, removed 51 selfloop flow, removed 5 redundant places. [2023-08-31 02:31:50,129 INFO L231 Difference]: Finished difference. Result has 181 places, 562 transitions, 12412 flow [2023-08-31 02:31:50,130 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-08-31 02:31:50,130 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 143 predicate places. [2023-08-31 02:31:50,131 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 562 transitions, 12412 flow [2023-08-31 02:31:50,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:31:50,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:31:50,131 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-08-31 02:31:50,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-31 02:31:50,131 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-08-31 02:31:50,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:31:50,132 INFO L85 PathProgramCache]: Analyzing trace with hash -303154112, now seen corresponding path program 10 times [2023-08-31 02:31:50,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:31:50,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513368718] [2023-08-31 02:31:50,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:31:50,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:31:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:31:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:31:50,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:31:50,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513368718] [2023-08-31 02:31:50,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513368718] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:31:50,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:31:50,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:31:50,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963416766] [2023-08-31 02:31:50,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:31:50,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:31:50,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:31:50,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:31:50,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:31:50,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-31 02:31:50,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 562 transitions, 12412 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:31:50,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:31:50,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-31 02:31:50,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:31:56,077 INFO L130 PetriNetUnfolder]: 23491/33728 cut-off events. [2023-08-31 02:31:56,078 INFO L131 PetriNetUnfolder]: For 806643/809922 co-relation queries the response was YES. [2023-08-31 02:31:56,345 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-08-31 02:31:56,453 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 495 selfloop transitions, 131 changer transitions 51/705 dead transitions. [2023-08-31 02:31:56,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 705 transitions, 16312 flow [2023-08-31 02:31:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:31:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:31:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2023-08-31 02:31:56,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306930693069307 [2023-08-31 02:31:56,454 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 536 transitions. [2023-08-31 02:31:56,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 536 transitions. [2023-08-31 02:31:56,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:31:56,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 536 transitions. [2023-08-31 02:31:56,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:31:56,456 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-08-31 02:31:56,456 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-08-31 02:31:56,456 INFO L175 Difference]: Start difference. First operand has 181 places, 562 transitions, 12412 flow. Second operand 5 states and 536 transitions. [2023-08-31 02:31:56,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 705 transitions, 16312 flow [2023-08-31 02:32:01,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 705 transitions, 16044 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-08-31 02:32:01,492 INFO L231 Difference]: Finished difference. Result has 183 places, 550 transitions, 12321 flow [2023-08-31 02:32:01,493 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-08-31 02:32:01,493 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 145 predicate places. [2023-08-31 02:32:01,493 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 550 transitions, 12321 flow [2023-08-31 02:32:01,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:01,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:32:01,494 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-08-31 02:32:01,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-31 02:32:01,494 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-08-31 02:32:01,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:32:01,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1032574491, now seen corresponding path program 8 times [2023-08-31 02:32:01,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:32:01,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545899264] [2023-08-31 02:32:01,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:32:01,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:32:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:32:01,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:32:01,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:32:01,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545899264] [2023-08-31 02:32:01,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545899264] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:32:01,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:32:01,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:32:01,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864330420] [2023-08-31 02:32:01,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:32:01,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:32:01,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:32:01,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:32:01,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:32:01,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 202 [2023-08-31 02:32:01,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 550 transitions, 12321 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:01,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:32:01,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 202 [2023-08-31 02:32:01,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:32:07,016 INFO L130 PetriNetUnfolder]: 22334/31675 cut-off events. [2023-08-31 02:32:07,016 INFO L131 PetriNetUnfolder]: For 775607/778609 co-relation queries the response was YES. [2023-08-31 02:32:07,231 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-08-31 02:32:07,332 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 370 selfloop transitions, 183 changer transitions 93/692 dead transitions. [2023-08-31 02:32:07,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 692 transitions, 16016 flow [2023-08-31 02:32:07,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:32:07,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:32:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 545 transitions. [2023-08-31 02:32:07,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396039603960396 [2023-08-31 02:32:07,335 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 545 transitions. [2023-08-31 02:32:07,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 545 transitions. [2023-08-31 02:32:07,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:32:07,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 545 transitions. [2023-08-31 02:32:07,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:07,338 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-08-31 02:32:07,338 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-08-31 02:32:07,338 INFO L175 Difference]: Start difference. First operand has 183 places, 550 transitions, 12321 flow. Second operand 5 states and 545 transitions. [2023-08-31 02:32:07,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 692 transitions, 16016 flow [2023-08-31 02:32:10,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 692 transitions, 15511 flow, removed 76 selfloop flow, removed 6 redundant places. [2023-08-31 02:32:10,818 INFO L231 Difference]: Finished difference. Result has 180 places, 550 transitions, 12272 flow [2023-08-31 02:32:10,818 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-08-31 02:32:10,819 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 142 predicate places. [2023-08-31 02:32:10,819 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 550 transitions, 12272 flow [2023-08-31 02:32:10,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:10,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:32:10,819 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-08-31 02:32:10,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-31 02:32:10,823 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-08-31 02:32:10,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:32:10,824 INFO L85 PathProgramCache]: Analyzing trace with hash -481538739, now seen corresponding path program 8 times [2023-08-31 02:32:10,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:32:10,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583685462] [2023-08-31 02:32:10,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:32:10,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:32:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:32:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:32:10,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:32:10,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583685462] [2023-08-31 02:32:10,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583685462] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:32:10,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165000901] [2023-08-31 02:32:10,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 02:32:10,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:32:10,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:32:10,881 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:32:10,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-31 02:32:11,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 02:32:11,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:32:11,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 02:32:11,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:32:11,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:32:11,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:32:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:32:11,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165000901] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:32:11,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:32:11,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-31 02:32:11,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490980257] [2023-08-31 02:32:11,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:32:11,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 02:32:11,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:32:11,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 02:32:11,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-31 02:32:11,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-31 02:32:11,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 550 transitions, 12272 flow. Second operand has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:11,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:32:11,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-31 02:32:11,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:32:16,680 INFO L130 PetriNetUnfolder]: 22923/32314 cut-off events. [2023-08-31 02:32:16,680 INFO L131 PetriNetUnfolder]: For 737438/739982 co-relation queries the response was YES. [2023-08-31 02:32:16,959 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-08-31 02:32:17,068 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 497 selfloop transitions, 230 changer transitions 119/881 dead transitions. [2023-08-31 02:32:17,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 881 transitions, 19638 flow [2023-08-31 02:32:17,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 02:32:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 02:32:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 857 transitions. [2023-08-31 02:32:17,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5303217821782178 [2023-08-31 02:32:17,069 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 857 transitions. [2023-08-31 02:32:17,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 857 transitions. [2023-08-31 02:32:17,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:32:17,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 857 transitions. [2023-08-31 02:32:17,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.125) internal successors, (857), 8 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:17,072 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-08-31 02:32:17,072 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-08-31 02:32:17,072 INFO L175 Difference]: Start difference. First operand has 180 places, 550 transitions, 12272 flow. Second operand 8 states and 857 transitions. [2023-08-31 02:32:17,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 881 transitions, 19638 flow [2023-08-31 02:32:21,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 881 transitions, 19252 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-08-31 02:32:21,318 INFO L231 Difference]: Finished difference. Result has 185 places, 560 transitions, 12698 flow [2023-08-31 02:32:21,319 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-08-31 02:32:21,320 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 147 predicate places. [2023-08-31 02:32:21,320 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 560 transitions, 12698 flow [2023-08-31 02:32:21,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:21,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:32:21,320 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-08-31 02:32:21,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-31 02:32:21,526 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-08-31 02:32:21,526 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-08-31 02:32:21,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:32:21,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2051744475, now seen corresponding path program 9 times [2023-08-31 02:32:21,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:32:21,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911814370] [2023-08-31 02:32:21,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:32:21,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:32:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:32:21,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:32:21,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:32:21,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911814370] [2023-08-31 02:32:21,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911814370] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:32:21,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329596314] [2023-08-31 02:32:21,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 02:32:21,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:32:21,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:32:21,585 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:32:21,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-31 02:32:21,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-31 02:32:21,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:32:21,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 02:32:21,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:32:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:32:21,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:32:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:32:21,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329596314] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:32:21,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:32:21,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-31 02:32:21,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220328755] [2023-08-31 02:32:21,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:32:21,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 02:32:21,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:32:21,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 02:32:21,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-31 02:32:21,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-31 02:32:21,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 560 transitions, 12698 flow. Second operand has 10 states, 10 states have (on average 95.4) internal successors, (954), 10 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:21,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:32:21,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-31 02:32:21,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:32:26,783 INFO L130 PetriNetUnfolder]: 21401/29770 cut-off events. [2023-08-31 02:32:26,783 INFO L131 PetriNetUnfolder]: For 730383/733737 co-relation queries the response was YES. [2023-08-31 02:32:26,941 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-08-31 02:32:27,038 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 441 selfloop transitions, 154 changer transitions 51/679 dead transitions. [2023-08-31 02:32:27,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 679 transitions, 15822 flow [2023-08-31 02:32:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:32:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:32:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 537 transitions. [2023-08-31 02:32:27,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5316831683168317 [2023-08-31 02:32:27,039 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 537 transitions. [2023-08-31 02:32:27,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 537 transitions. [2023-08-31 02:32:27,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:32:27,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 537 transitions. [2023-08-31 02:32:27,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:27,041 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-08-31 02:32:27,041 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-08-31 02:32:27,041 INFO L175 Difference]: Start difference. First operand has 185 places, 560 transitions, 12698 flow. Second operand 5 states and 537 transitions. [2023-08-31 02:32:27,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 679 transitions, 15822 flow [2023-08-31 02:32:31,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 679 transitions, 15218 flow, removed 82 selfloop flow, removed 6 redundant places. [2023-08-31 02:32:31,413 INFO L231 Difference]: Finished difference. Result has 183 places, 541 transitions, 12100 flow [2023-08-31 02:32:31,414 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-08-31 02:32:31,414 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 145 predicate places. [2023-08-31 02:32:31,414 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 541 transitions, 12100 flow [2023-08-31 02:32:31,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.4) internal successors, (954), 10 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:31,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:32:31,415 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-08-31 02:32:31,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-31 02:32:31,615 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-08-31 02:32:31,616 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-08-31 02:32:31,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:32:31,616 INFO L85 PathProgramCache]: Analyzing trace with hash -210520731, now seen corresponding path program 9 times [2023-08-31 02:32:31,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:32:31,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140185347] [2023-08-31 02:32:31,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:32:31,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:32:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:32:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:32:31,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:32:31,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140185347] [2023-08-31 02:32:31,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140185347] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 02:32:31,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 02:32:31,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 02:32:31,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798234008] [2023-08-31 02:32:31,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 02:32:31,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 02:32:31,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:32:31,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 02:32:31,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 02:32:31,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 202 [2023-08-31 02:32:31,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 541 transitions, 12100 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:31,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:32:31,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 202 [2023-08-31 02:32:31,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:32:35,504 INFO L130 PetriNetUnfolder]: 18175/24257 cut-off events. [2023-08-31 02:32:35,505 INFO L131 PetriNetUnfolder]: For 603230/605933 co-relation queries the response was YES. [2023-08-31 02:32:35,608 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-08-31 02:32:35,691 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 327 selfloop transitions, 195 changer transitions 61/613 dead transitions. [2023-08-31 02:32:35,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 613 transitions, 14273 flow [2023-08-31 02:32:35,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:32:35,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:32:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2023-08-31 02:32:35,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306930693069307 [2023-08-31 02:32:35,693 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 536 transitions. [2023-08-31 02:32:35,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 536 transitions. [2023-08-31 02:32:35,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:32:35,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 536 transitions. [2023-08-31 02:32:35,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:35,695 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-08-31 02:32:35,695 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-08-31 02:32:35,695 INFO L175 Difference]: Start difference. First operand has 183 places, 541 transitions, 12100 flow. Second operand 5 states and 536 transitions. [2023-08-31 02:32:35,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 613 transitions, 14273 flow [2023-08-31 02:32:38,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 613 transitions, 13631 flow, removed 142 selfloop flow, removed 8 redundant places. [2023-08-31 02:32:38,481 INFO L231 Difference]: Finished difference. Result has 175 places, 509 transitions, 11199 flow [2023-08-31 02:32:38,482 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-08-31 02:32:38,482 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 137 predicate places. [2023-08-31 02:32:38,482 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 509 transitions, 11199 flow [2023-08-31 02:32:38,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:38,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:32:38,483 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-08-31 02:32:38,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-08-31 02:32:38,483 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-08-31 02:32:38,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:32:38,484 INFO L85 PathProgramCache]: Analyzing trace with hash -667345164, now seen corresponding path program 1 times [2023-08-31 02:32:38,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:32:38,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019848713] [2023-08-31 02:32:38,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:32:38,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:32:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:32:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:32:38,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:32:38,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019848713] [2023-08-31 02:32:38,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019848713] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:32:38,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753860237] [2023-08-31 02:32:38,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:32:38,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:32:38,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:32:38,534 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:32:38,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-31 02:32:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:32:38,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 02:32:38,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:32:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:32:38,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:32:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:32:38,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753860237] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:32:38,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:32:38,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-31 02:32:38,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897337333] [2023-08-31 02:32:38,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:32:38,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 02:32:38,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:32:38,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 02:32:38,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-31 02:32:38,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-08-31 02:32:38,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 509 transitions, 11199 flow. Second operand has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:38,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:32:38,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-08-31 02:32:38,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:32:41,883 INFO L130 PetriNetUnfolder]: 17052/22257 cut-off events. [2023-08-31 02:32:41,883 INFO L131 PetriNetUnfolder]: For 507950/509893 co-relation queries the response was YES. [2023-08-31 02:32:41,985 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-08-31 02:32:42,079 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 420 selfloop transitions, 169 changer transitions 1/620 dead transitions. [2023-08-31 02:32:42,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 620 transitions, 14088 flow [2023-08-31 02:32:42,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 02:32:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 02:32:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 531 transitions. [2023-08-31 02:32:42,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257425742574258 [2023-08-31 02:32:42,080 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 531 transitions. [2023-08-31 02:32:42,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 531 transitions. [2023-08-31 02:32:42,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:32:42,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 531 transitions. [2023-08-31 02:32:42,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:42,082 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-08-31 02:32:42,082 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-08-31 02:32:42,082 INFO L175 Difference]: Start difference. First operand has 175 places, 509 transitions, 11199 flow. Second operand 5 states and 531 transitions. [2023-08-31 02:32:42,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 620 transitions, 14088 flow [2023-08-31 02:32:44,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 620 transitions, 12458 flow, removed 172 selfloop flow, removed 22 redundant places. [2023-08-31 02:32:44,512 INFO L231 Difference]: Finished difference. Result has 143 places, 525 transitions, 10573 flow [2023-08-31 02:32:44,513 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-08-31 02:32:44,513 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 105 predicate places. [2023-08-31 02:32:44,513 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 525 transitions, 10573 flow [2023-08-31 02:32:44,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:44,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:32:44,513 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-08-31 02:32:44,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-31 02:32:44,714 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-08-31 02:32:44,714 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-08-31 02:32:44,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:32:44,715 INFO L85 PathProgramCache]: Analyzing trace with hash -65837510, now seen corresponding path program 2 times [2023-08-31 02:32:44,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:32:44,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934865669] [2023-08-31 02:32:44,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:32:44,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:32:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:32:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:32:44,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:32:44,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934865669] [2023-08-31 02:32:44,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934865669] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:32:44,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684454456] [2023-08-31 02:32:44,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 02:32:44,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:32:44,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:32:44,763 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:32:44,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-31 02:32:44,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 02:32:44,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:32:44,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 02:32:44,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:32:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:32:44,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:32:44,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:32:44,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684454456] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:32:44,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:32:44,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-31 02:32:44,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888754349] [2023-08-31 02:32:44,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:32:44,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 02:32:44,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:32:44,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 02:32:44,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-31 02:32:45,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 202 [2023-08-31 02:32:45,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 525 transitions, 10573 flow. Second operand has 10 states, 10 states have (on average 93.3) internal successors, (933), 10 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:45,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:32:45,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 202 [2023-08-31 02:32:45,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:32:48,680 INFO L130 PetriNetUnfolder]: 19775/25806 cut-off events. [2023-08-31 02:32:48,680 INFO L131 PetriNetUnfolder]: For 471967/473084 co-relation queries the response was YES. [2023-08-31 02:32:48,788 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-08-31 02:32:48,895 INFO L137 encePairwiseOnDemand]: 195/202 looper letters, 443 selfloop transitions, 385 changer transitions 2/842 dead transitions. [2023-08-31 02:32:48,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 842 transitions, 16889 flow [2023-08-31 02:32:48,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-31 02:32:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-31 02:32:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1518 transitions. [2023-08-31 02:32:48,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500990099009901 [2023-08-31 02:32:48,897 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1518 transitions. [2023-08-31 02:32:48,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1518 transitions. [2023-08-31 02:32:48,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:32:48,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1518 transitions. [2023-08-31 02:32:48,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 101.2) internal successors, (1518), 15 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:48,900 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-08-31 02:32:48,901 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-08-31 02:32:48,901 INFO L175 Difference]: Start difference. First operand has 143 places, 525 transitions, 10573 flow. Second operand 15 states and 1518 transitions. [2023-08-31 02:32:48,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 842 transitions, 16889 flow [2023-08-31 02:32:51,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 842 transitions, 16574 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-31 02:32:51,105 INFO L231 Difference]: Finished difference. Result has 161 places, 620 transitions, 13397 flow [2023-08-31 02:32:51,106 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-08-31 02:32:51,106 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 123 predicate places. [2023-08-31 02:32:51,107 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 620 transitions, 13397 flow [2023-08-31 02:32:51,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.3) internal successors, (933), 10 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:51,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:32:51,107 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-08-31 02:32:51,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-31 02:32:51,307 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-08-31 02:32:51,308 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-08-31 02:32:51,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:32:51,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1053393848, now seen corresponding path program 3 times [2023-08-31 02:32:51,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:32:51,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619815987] [2023-08-31 02:32:51,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:32:51,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:32:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:32:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-31 02:32:51,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:32:51,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619815987] [2023-08-31 02:32:51,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619815987] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:32:51,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258244089] [2023-08-31 02:32:51,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 02:32:51,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:32:51,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:32:51,359 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:32:51,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-31 02:32:51,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-31 02:32:51,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:32:51,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 02:32:51,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:32:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:32:51,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:32:51,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:32:51,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258244089] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:32:51,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:32:51,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-31 02:32:51,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366686095] [2023-08-31 02:32:51,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:32:51,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 02:32:51,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:32:51,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 02:32:51,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-31 02:32:51,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 202 [2023-08-31 02:32:51,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 620 transitions, 13397 flow. Second operand has 10 states, 10 states have (on average 93.2) internal successors, (932), 10 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:51,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:32:51,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 202 [2023-08-31 02:32:51,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:32:56,722 INFO L130 PetriNetUnfolder]: 24929/32605 cut-off events. [2023-08-31 02:32:56,722 INFO L131 PetriNetUnfolder]: For 612389/612946 co-relation queries the response was YES. [2023-08-31 02:32:56,939 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-08-31 02:32:57,065 INFO L137 encePairwiseOnDemand]: 194/202 looper letters, 618 selfloop transitions, 358 changer transitions 1/1001 dead transitions. [2023-08-31 02:32:57,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 1001 transitions, 21666 flow [2023-08-31 02:32:57,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-31 02:32:57,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-31 02:32:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1425 transitions. [2023-08-31 02:32:57,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5038896746817539 [2023-08-31 02:32:57,071 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1425 transitions. [2023-08-31 02:32:57,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1425 transitions. [2023-08-31 02:32:57,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:32:57,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1425 transitions. [2023-08-31 02:32:57,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 101.78571428571429) internal successors, (1425), 14 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:32:57,075 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-08-31 02:32:57,075 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-08-31 02:32:57,075 INFO L175 Difference]: Start difference. First operand has 161 places, 620 transitions, 13397 flow. Second operand 14 states and 1425 transitions. [2023-08-31 02:32:57,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 1001 transitions, 21666 flow [2023-08-31 02:33:01,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 1001 transitions, 19189 flow, removed 283 selfloop flow, removed 10 redundant places. [2023-08-31 02:33:01,159 INFO L231 Difference]: Finished difference. Result has 166 places, 742 transitions, 15014 flow [2023-08-31 02:33:01,160 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-08-31 02:33:01,160 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 128 predicate places. [2023-08-31 02:33:01,160 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 742 transitions, 15014 flow [2023-08-31 02:33:01,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.2) internal successors, (932), 10 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:33:01,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:33:01,161 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-08-31 02:33:01,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-31 02:33:01,361 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-08-31 02:33:01,362 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-08-31 02:33:01,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:33:01,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1871381985, now seen corresponding path program 1 times [2023-08-31 02:33:01,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:33:01,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654325816] [2023-08-31 02:33:01,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:33:01,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:33:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:33:01,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:33:01,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:33:01,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654325816] [2023-08-31 02:33:01,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654325816] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:33:01,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315749379] [2023-08-31 02:33:01,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:33:01,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:33:01,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:33:01,585 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:33:01,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-31 02:33:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:33:01,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-31 02:33:01,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:33:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:33:01,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:33:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:33:02,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315749379] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:33:02,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:33:02,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 7 [2023-08-31 02:33:02,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147496370] [2023-08-31 02:33:02,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:33:02,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 02:33:02,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:33:02,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 02:33:02,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-31 02:33:02,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 202 [2023-08-31 02:33:02,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 742 transitions, 15014 flow. Second operand has 9 states, 9 states have (on average 105.66666666666667) internal successors, (951), 9 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:33:02,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:33:02,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 202 [2023-08-31 02:33:02,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:33:11,241 INFO L130 PetriNetUnfolder]: 40667/54062 cut-off events. [2023-08-31 02:33:11,241 INFO L131 PetriNetUnfolder]: For 970693/986750 co-relation queries the response was YES. [2023-08-31 02:33:11,578 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-08-31 02:33:11,804 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 482 selfloop transitions, 559 changer transitions 5/1125 dead transitions. [2023-08-31 02:33:11,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 1125 transitions, 23116 flow [2023-08-31 02:33:11,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 02:33:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 02:33:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1066 transitions. [2023-08-31 02:33:11,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5863586358635864 [2023-08-31 02:33:11,806 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1066 transitions. [2023-08-31 02:33:11,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1066 transitions. [2023-08-31 02:33:11,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:33:11,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1066 transitions. [2023-08-31 02:33:11,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.44444444444444) internal successors, (1066), 9 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:33:11,808 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-08-31 02:33:11,808 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-08-31 02:33:11,808 INFO L175 Difference]: Start difference. First operand has 166 places, 742 transitions, 15014 flow. Second operand 9 states and 1066 transitions. [2023-08-31 02:33:11,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 1125 transitions, 23116 flow [2023-08-31 02:33:16,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 1125 transitions, 21178 flow, removed 438 selfloop flow, removed 11 redundant places. [2023-08-31 02:33:16,505 INFO L231 Difference]: Finished difference. Result has 165 places, 1005 transitions, 21197 flow [2023-08-31 02:33:16,505 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-08-31 02:33:16,505 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 127 predicate places. [2023-08-31 02:33:16,505 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 1005 transitions, 21197 flow [2023-08-31 02:33:16,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.66666666666667) internal successors, (951), 9 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:33:16,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:33:16,506 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-08-31 02:33:16,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-31 02:33:16,706 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-08-31 02:33:16,707 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-08-31 02:33:16,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:33:16,707 INFO L85 PathProgramCache]: Analyzing trace with hash 787534766, now seen corresponding path program 2 times [2023-08-31 02:33:16,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:33:16,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474339545] [2023-08-31 02:33:16,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:33:16,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:33:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:33:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:33:16,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:33:16,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474339545] [2023-08-31 02:33:16,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474339545] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:33:16,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133485696] [2023-08-31 02:33:16,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 02:33:16,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:33:16,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:33:16,783 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:33:16,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-31 02:33:16,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 02:33:16,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:33:16,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 02:33:16,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:33:16,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:33:16,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:33:17,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:33:17,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133485696] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:33:17,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:33:17,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-08-31 02:33:17,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798466355] [2023-08-31 02:33:17,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:33:17,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-31 02:33:17,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:33:17,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-31 02:33:17,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-08-31 02:33:17,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 202 [2023-08-31 02:33:17,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 1005 transitions, 21197 flow. Second operand has 12 states, 12 states have (on average 92.5) internal successors, (1110), 12 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:33:17,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:33:17,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 202 [2023-08-31 02:33:17,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:33:36,189 INFO L130 PetriNetUnfolder]: 78598/104797 cut-off events. [2023-08-31 02:33:36,189 INFO L131 PetriNetUnfolder]: For 1577870/1578845 co-relation queries the response was YES. [2023-08-31 02:33:36,931 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-08-31 02:33:37,401 INFO L137 encePairwiseOnDemand]: 194/202 looper letters, 1521 selfloop transitions, 456 changer transitions 0/1997 dead transitions. [2023-08-31 02:33:37,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1997 transitions, 42747 flow [2023-08-31 02:33:37,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-31 02:33:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-31 02:33:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1330 transitions. [2023-08-31 02:33:37,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064737242955065 [2023-08-31 02:33:37,403 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1330 transitions. [2023-08-31 02:33:37,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1330 transitions. [2023-08-31 02:33:37,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:33:37,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1330 transitions. [2023-08-31 02:33:37,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.3076923076923) internal successors, (1330), 13 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:33:37,406 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-08-31 02:33:37,407 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-08-31 02:33:37,407 INFO L175 Difference]: Start difference. First operand has 165 places, 1005 transitions, 21197 flow. Second operand 13 states and 1330 transitions. [2023-08-31 02:33:37,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 1997 transitions, 42747 flow [2023-08-31 02:34:43,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 1997 transitions, 40401 flow, removed 1173 selfloop flow, removed 0 redundant places. [2023-08-31 02:34:43,560 INFO L231 Difference]: Finished difference. Result has 187 places, 1278 transitions, 27482 flow [2023-08-31 02:34:43,561 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-08-31 02:34:43,561 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 149 predicate places. [2023-08-31 02:34:43,561 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 1278 transitions, 27482 flow [2023-08-31 02:34:43,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 92.5) internal successors, (1110), 12 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:34:43,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:34:43,562 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-08-31 02:34:43,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-31 02:34:43,762 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-08-31 02:34:43,762 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-08-31 02:34:43,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:34:43,763 INFO L85 PathProgramCache]: Analyzing trace with hash -926111482, now seen corresponding path program 3 times [2023-08-31 02:34:43,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:34:43,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907006109] [2023-08-31 02:34:43,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:34:43,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:34:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:34:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 02:34:43,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:34:43,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907006109] [2023-08-31 02:34:43,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907006109] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:34:43,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098190015] [2023-08-31 02:34:43,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 02:34:43,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:34:43,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:34:43,837 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:34:43,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-31 02:34:43,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-31 02:34:43,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:34:43,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 02:34:43,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:34:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:34:44,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:34:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:34:44,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098190015] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:34:44,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:34:44,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-08-31 02:34:44,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977693618] [2023-08-31 02:34:44,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:34:44,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-31 02:34:44,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:34:44,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-31 02:34:44,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-08-31 02:34:44,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 202 [2023-08-31 02:34:44,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 1278 transitions, 27482 flow. Second operand has 14 states, 14 states have (on average 91.5) internal successors, (1281), 14 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:34:44,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:34:44,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 202 [2023-08-31 02:34:44,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:35:26,097 INFO L130 PetriNetUnfolder]: 139227/185735 cut-off events. [2023-08-31 02:35:26,097 INFO L131 PetriNetUnfolder]: For 3462857/3473540 co-relation queries the response was YES. [2023-08-31 02:35:27,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1456167 conditions, 185735 events. 139227/185735 cut-off events. For 3462857/3473540 co-relation queries the response was YES. Maximal size of possible extension queue 6969. Compared 1227144 event pairs, 5433 based on Foata normal form. 12630/197455 useless extension candidates. Maximal degree in co-relation 1441380. Up to 51509 conditions per place. [2023-08-31 02:35:28,719 INFO L137 encePairwiseOnDemand]: 193/202 looper letters, 3398 selfloop transitions, 2085 changer transitions 0/5522 dead transitions. [2023-08-31 02:35:28,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 5522 transitions, 121869 flow [2023-08-31 02:35:28,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-08-31 02:35:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-08-31 02:35:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 4697 transitions. [2023-08-31 02:35:28,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494733515904782 [2023-08-31 02:35:28,724 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 4697 transitions. [2023-08-31 02:35:28,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 4697 transitions. [2023-08-31 02:35:28,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:35:28,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 4697 transitions. [2023-08-31 02:35:28,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 99.93617021276596) internal successors, (4697), 47 states have internal predecessors, (4697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:35:28,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 202.0) internal successors, (9696), 48 states have internal predecessors, (9696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:35:28,736 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 202.0) internal successors, (9696), 48 states have internal predecessors, (9696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:35:28,736 INFO L175 Difference]: Start difference. First operand has 187 places, 1278 transitions, 27482 flow. Second operand 47 states and 4697 transitions. [2023-08-31 02:35:28,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 5522 transitions, 121869 flow Killed by 15