/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:37:24,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:37:24,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:37:24,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:37:24,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:37:24,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:37:24,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:37:24,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:37:24,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:37:24,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:37:24,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:37:24,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:37:24,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:37:24,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:37:24,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:37:24,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:37:24,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:37:24,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:37:24,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:37:24,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:37:24,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:37:24,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:37:24,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:37:24,433 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:37:24,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:37:24,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:37:24,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:37:24,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:37:24,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:37:24,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:37:24,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:37:24,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:37:24,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:37:24,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:37:24,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:37:24,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:37:24,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:37:24,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:37:24,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:37:24,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:37:24,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:37:24,448 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:37:24,470 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:37:24,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:37:24,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:37:24,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:37:24,472 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:37:24,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:37:24,473 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:37:24,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:37:24,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:37:24,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:37:24,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:37:24,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:37:24,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:37:24,474 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:37:24,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:37:24,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:37:24,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:37:24,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:37:24,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:37:24,483 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:37:24,483 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:37:24,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:37:24,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:37:24,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:37:24,483 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:37:24,483 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:37:24,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:37:24,483 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:37:24,483 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:37:24,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:37:24,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:37:24,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:37:24,744 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:37:24,744 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:37:24,745 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2022-12-06 05:37:25,793 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:37:26,031 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:37:26,032 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2022-12-06 05:37:26,040 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e5a01b69/875c70b690174909b86a07764de04886/FLAGfbd72a73b [2022-12-06 05:37:26,053 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e5a01b69/875c70b690174909b86a07764de04886 [2022-12-06 05:37:26,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:37:26,056 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:37:26,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:37:26,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:37:26,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:37:26,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:37:26" (1/1) ... [2022-12-06 05:37:26,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52a40f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:26, skipping insertion in model container [2022-12-06 05:37:26,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:37:26" (1/1) ... [2022-12-06 05:37:26,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:37:26,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:37:26,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:26,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:26,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:26,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:26,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:26,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:26,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:26,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:26,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:26,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:26,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:26,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:26,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:26,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:26,281 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c[2591,2604] [2022-12-06 05:37:26,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:37:26,300 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:37:26,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:26,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:26,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:26,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:26,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:26,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:26,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:26,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:26,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:26,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:26,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:26,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:26,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:26,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:26,339 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c[2591,2604] [2022-12-06 05:37:26,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:37:26,354 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:37:26,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:26 WrapperNode [2022-12-06 05:37:26,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:37:26,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:37:26,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:37:26,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:37:26,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:26" (1/1) ... [2022-12-06 05:37:26,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:26" (1/1) ... [2022-12-06 05:37:26,401 INFO L138 Inliner]: procedures = 22, calls = 39, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2022-12-06 05:37:26,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:37:26,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:37:26,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:37:26,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:37:26,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:26" (1/1) ... [2022-12-06 05:37:26,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:26" (1/1) ... [2022-12-06 05:37:26,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:26" (1/1) ... [2022-12-06 05:37:26,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:26" (1/1) ... [2022-12-06 05:37:26,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:26" (1/1) ... [2022-12-06 05:37:26,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:26" (1/1) ... [2022-12-06 05:37:26,434 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:26" (1/1) ... [2022-12-06 05:37:26,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:26" (1/1) ... [2022-12-06 05:37:26,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:37:26,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:37:26,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:37:26,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:37:26,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:26" (1/1) ... [2022-12-06 05:37:26,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:37:26,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:26,481 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) [2022-12-06 05:37:26,529 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 [2022-12-06 05:37:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:37:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:37:26,558 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:37:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:37:26,558 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:37:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:37:26,558 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:37:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:37:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:37:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:37:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:37:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:37:26,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:37:26,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:37:26,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:37:26,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:37:26,560 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:37:26,633 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:37:26,634 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:37:26,864 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:37:26,909 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:37:26,909 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 05:37:26,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:37:26 BoogieIcfgContainer [2022-12-06 05:37:26,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:37:26,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:37:26,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:37:26,917 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:37:26,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:37:26" (1/3) ... [2022-12-06 05:37:26,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44977fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:37:26, skipping insertion in model container [2022-12-06 05:37:26,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:26" (2/3) ... [2022-12-06 05:37:26,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44977fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:37:26, skipping insertion in model container [2022-12-06 05:37:26,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:37:26" (3/3) ... [2022-12-06 05:37:26,920 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2022-12-06 05:37:26,935 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:37:26,936 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:37:26,936 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:37:27,002 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:37:27,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 92 transitions, 208 flow [2022-12-06 05:37:27,082 INFO L130 PetriNetUnfolder]: 7/89 cut-off events. [2022-12-06 05:37:27,082 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:37:27,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 89 events. 7/89 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-12-06 05:37:27,094 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 92 transitions, 208 flow [2022-12-06 05:37:27,097 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 79 transitions, 176 flow [2022-12-06 05:37:27,098 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:27,110 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 79 transitions, 176 flow [2022-12-06 05:37:27,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 79 transitions, 176 flow [2022-12-06 05:37:27,134 INFO L130 PetriNetUnfolder]: 7/79 cut-off events. [2022-12-06 05:37:27,134 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:37:27,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 79 events. 7/79 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-12-06 05:37:27,136 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 79 transitions, 176 flow [2022-12-06 05:37:27,137 INFO L188 LiptonReduction]: Number of co-enabled transitions 860 [2022-12-06 05:37:29,136 INFO L203 LiptonReduction]: Total number of compositions: 56 [2022-12-06 05:37:29,148 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:37:29,152 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, 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;@cf39e47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:37:29,153 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:37:29,156 INFO L130 PetriNetUnfolder]: 3/22 cut-off events. [2022-12-06 05:37:29,157 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:37:29,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:29,157 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:29,158 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 1 more)] === [2022-12-06 05:37:29,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:29,161 INFO L85 PathProgramCache]: Analyzing trace with hash 550202111, now seen corresponding path program 1 times [2022-12-06 05:37:29,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:29,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564643853] [2022-12-06 05:37:29,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:29,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:29,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:29,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564643853] [2022-12-06 05:37:29,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564643853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:29,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:29,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:37:29,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535665403] [2022-12-06 05:37:29,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:29,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:37:29,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:29,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:37:29,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:37:29,861 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2022-12-06 05:37:29,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:29,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:29,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2022-12-06 05:37:29,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:29,963 INFO L130 PetriNetUnfolder]: 271/426 cut-off events. [2022-12-06 05:37:29,963 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-06 05:37:29,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 426 events. 271/426 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1527 event pairs, 37 based on Foata normal form. 1/279 useless extension candidates. Maximal degree in co-relation 671. Up to 309 conditions per place. [2022-12-06 05:37:29,970 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 30 selfloop transitions, 4 changer transitions 1/39 dead transitions. [2022-12-06 05:37:29,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 181 flow [2022-12-06 05:37:29,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:37:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:37:29,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 05:37:29,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6956521739130435 [2022-12-06 05:37:29,981 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 64 flow. Second operand 3 states and 48 transitions. [2022-12-06 05:37:29,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 181 flow [2022-12-06 05:37:29,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 39 transitions, 159 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:37:29,986 INFO L231 Difference]: Finished difference. Result has 27 places, 26 transitions, 78 flow [2022-12-06 05:37:29,987 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=27, PETRI_TRANSITIONS=26} [2022-12-06 05:37:29,990 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-06 05:37:29,991 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:29,992 INFO L89 Accepts]: Start accepts. Operand has 27 places, 26 transitions, 78 flow [2022-12-06 05:37:29,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:30,000 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:30,000 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 26 transitions, 78 flow [2022-12-06 05:37:30,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 26 transitions, 78 flow [2022-12-06 05:37:30,009 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([269] thread2EXIT-->L101-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem12#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} AuxVars[] AssignedVars[][22], [42#L83true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 16#L101-2true, 98#true]) [2022-12-06 05:37:30,009 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2022-12-06 05:37:30,009 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2022-12-06 05:37:30,009 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 05:37:30,009 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2022-12-06 05:37:30,012 INFO L130 PetriNetUnfolder]: 22/63 cut-off events. [2022-12-06 05:37:30,012 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:37:30,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 63 events. 22/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 143 event pairs, 1 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 67. Up to 26 conditions per place. [2022-12-06 05:37:30,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 26 transitions, 78 flow [2022-12-06 05:37:30,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-06 05:37:30,016 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:30,018 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 05:37:30,018 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 26 transitions, 78 flow [2022-12-06 05:37:30,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:30,018 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:30,018 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:30,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:37:30,021 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 1 more)] === [2022-12-06 05:37:30,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:30,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1335524592, now seen corresponding path program 1 times [2022-12-06 05:37:30,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:30,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870525271] [2022-12-06 05:37:30,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:30,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:30,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:30,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870525271] [2022-12-06 05:37:30,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870525271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:30,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:30,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:30,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287457561] [2022-12-06 05:37:30,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:30,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:30,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:30,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:30,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:30,238 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:37:30,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:30,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:30,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:37:30,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:30,469 INFO L130 PetriNetUnfolder]: 459/707 cut-off events. [2022-12-06 05:37:30,470 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2022-12-06 05:37:30,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1661 conditions, 707 events. 459/707 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2554 event pairs, 40 based on Foata normal form. 40/747 useless extension candidates. Maximal degree in co-relation 353. Up to 277 conditions per place. [2022-12-06 05:37:30,472 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 72 selfloop transitions, 12 changer transitions 0/84 dead transitions. [2022-12-06 05:37:30,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 84 transitions, 395 flow [2022-12-06 05:37:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-06 05:37:30,475 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2022-12-06 05:37:30,475 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 78 flow. Second operand 7 states and 84 transitions. [2022-12-06 05:37:30,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 84 transitions, 395 flow [2022-12-06 05:37:30,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 84 transitions, 387 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:37:30,477 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 154 flow [2022-12-06 05:37:30,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=154, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2022-12-06 05:37:30,477 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2022-12-06 05:37:30,477 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:30,478 INFO L89 Accepts]: Start accepts. Operand has 36 places, 35 transitions, 154 flow [2022-12-06 05:37:30,478 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:30,478 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:30,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 35 transitions, 154 flow [2022-12-06 05:37:30,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions, 154 flow [2022-12-06 05:37:30,485 INFO L130 PetriNetUnfolder]: 35/108 cut-off events. [2022-12-06 05:37:30,485 INFO L131 PetriNetUnfolder]: For 30/34 co-relation queries the response was YES. [2022-12-06 05:37:30,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 108 events. 35/108 cut-off events. For 30/34 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 397 event pairs, 2 based on Foata normal form. 2/106 useless extension candidates. Maximal degree in co-relation 175. Up to 41 conditions per place. [2022-12-06 05:37:30,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 35 transitions, 154 flow [2022-12-06 05:37:30,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 05:37:30,565 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [240] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_1 (ite (= 0 (ite (< 0 (mod v_~N~0_1 4294967296)) 1 0)) 0 1)) InVars {~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_1, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] and [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] [2022-12-06 05:37:30,644 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [240] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_1 (ite (= 0 (ite (< 0 (mod v_~N~0_1 4294967296)) 1 0)) 0 1)) InVars {~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_1, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:37:30,668 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [240] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_1 (ite (= 0 (ite (< 0 (mod v_~N~0_1 4294967296)) 1 0)) 0 1)) InVars {~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_1, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 05:37:30,742 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [240] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_1 (ite (= 0 (ite (< 0 (mod v_~N~0_1 4294967296)) 1 0)) 0 1)) InVars {~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_1, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:37:30,781 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:37:30,782 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 305 [2022-12-06 05:37:30,782 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 162 flow [2022-12-06 05:37:30,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:30,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:30,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:30,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:37:30,783 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 1 more)] === [2022-12-06 05:37:30,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:30,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1519269174, now seen corresponding path program 1 times [2022-12-06 05:37:30,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:30,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065266711] [2022-12-06 05:37:30,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:30,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:30,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:30,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:30,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065266711] [2022-12-06 05:37:30,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065266711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:30,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:30,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:30,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128015527] [2022-12-06 05:37:30,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:30,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:30,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:30,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:30,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:30,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:37:30,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:30,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:30,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:37:30,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:31,010 INFO L130 PetriNetUnfolder]: 520/784 cut-off events. [2022-12-06 05:37:31,010 INFO L131 PetriNetUnfolder]: For 724/724 co-relation queries the response was YES. [2022-12-06 05:37:31,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2295 conditions, 784 events. 520/784 cut-off events. For 724/724 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2883 event pairs, 65 based on Foata normal form. 16/800 useless extension candidates. Maximal degree in co-relation 2163. Up to 526 conditions per place. [2022-12-06 05:37:31,014 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 49 selfloop transitions, 8 changer transitions 3/60 dead transitions. [2022-12-06 05:37:31,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 60 transitions, 359 flow [2022-12-06 05:37:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:31,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 05:37:31,015 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5086206896551724 [2022-12-06 05:37:31,015 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 162 flow. Second operand 4 states and 59 transitions. [2022-12-06 05:37:31,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 60 transitions, 359 flow [2022-12-06 05:37:31,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 60 transitions, 345 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 05:37:31,018 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 173 flow [2022-12-06 05:37:31,018 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2022-12-06 05:37:31,018 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2022-12-06 05:37:31,018 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:31,018 INFO L89 Accepts]: Start accepts. Operand has 37 places, 34 transitions, 173 flow [2022-12-06 05:37:31,019 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:31,019 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:31,019 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 34 transitions, 173 flow [2022-12-06 05:37:31,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 34 transitions, 173 flow [2022-12-06 05:37:31,025 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([269] thread2EXIT-->L101-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem12#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} AuxVars[] AssignedVars[][30], [Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 105#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 42#L83true, 114#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 16#L101-2true, 102#true, Black: 104#(= ~N~0 ~L~0)]) [2022-12-06 05:37:31,025 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2022-12-06 05:37:31,025 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2022-12-06 05:37:31,026 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2022-12-06 05:37:31,026 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2022-12-06 05:37:31,027 INFO L130 PetriNetUnfolder]: 45/121 cut-off events. [2022-12-06 05:37:31,027 INFO L131 PetriNetUnfolder]: For 60/69 co-relation queries the response was YES. [2022-12-06 05:37:31,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 121 events. 45/121 cut-off events. For 60/69 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 427 event pairs, 3 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 218. Up to 51 conditions per place. [2022-12-06 05:37:31,028 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 34 transitions, 173 flow [2022-12-06 05:37:31,028 INFO L188 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-06 05:37:31,031 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:31,032 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 05:37:31,032 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 173 flow [2022-12-06 05:37:31,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:31,032 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:31,032 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:31,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:37:31,033 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 1 more)] === [2022-12-06 05:37:31,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:31,033 INFO L85 PathProgramCache]: Analyzing trace with hash -864847907, now seen corresponding path program 1 times [2022-12-06 05:37:31,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:31,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055382240] [2022-12-06 05:37:31,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:31,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:31,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:31,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055382240] [2022-12-06 05:37:31,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055382240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:31,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:31,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:31,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013039734] [2022-12-06 05:37:31,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:31,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:31,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:31,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:31,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:31,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:37:31,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:31,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:31,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:37:31,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:31,255 INFO L130 PetriNetUnfolder]: 654/978 cut-off events. [2022-12-06 05:37:31,255 INFO L131 PetriNetUnfolder]: For 1019/1019 co-relation queries the response was YES. [2022-12-06 05:37:31,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2970 conditions, 978 events. 654/978 cut-off events. For 1019/1019 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3712 event pairs, 135 based on Foata normal form. 42/1014 useless extension candidates. Maximal degree in co-relation 2018. Up to 630 conditions per place. [2022-12-06 05:37:31,260 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 53 selfloop transitions, 8 changer transitions 3/64 dead transitions. [2022-12-06 05:37:31,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 64 transitions, 394 flow [2022-12-06 05:37:31,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:31,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 05:37:31,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5258620689655172 [2022-12-06 05:37:31,261 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 173 flow. Second operand 4 states and 61 transitions. [2022-12-06 05:37:31,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 64 transitions, 394 flow [2022-12-06 05:37:31,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 64 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:37:31,264 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 188 flow [2022-12-06 05:37:31,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2022-12-06 05:37:31,265 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2022-12-06 05:37:31,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:31,265 INFO L89 Accepts]: Start accepts. Operand has 39 places, 35 transitions, 188 flow [2022-12-06 05:37:31,266 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:31,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:31,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 35 transitions, 188 flow [2022-12-06 05:37:31,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 188 flow [2022-12-06 05:37:31,274 INFO L130 PetriNetUnfolder]: 47/132 cut-off events. [2022-12-06 05:37:31,274 INFO L131 PetriNetUnfolder]: For 88/105 co-relation queries the response was YES. [2022-12-06 05:37:31,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 132 events. 47/132 cut-off events. For 88/105 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 506 event pairs, 4 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 258. Up to 54 conditions per place. [2022-12-06 05:37:31,275 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 35 transitions, 188 flow [2022-12-06 05:37:31,275 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 05:37:31,276 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:31,277 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 05:37:31,277 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 188 flow [2022-12-06 05:37:31,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:31,277 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:31,277 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:31,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:37:31,277 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 1 more)] === [2022-12-06 05:37:31,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:31,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1207173731, now seen corresponding path program 1 times [2022-12-06 05:37:31,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:31,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302842395] [2022-12-06 05:37:31,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:31,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:31,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:31,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302842395] [2022-12-06 05:37:31,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302842395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:31,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:31,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:31,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440408465] [2022-12-06 05:37:31,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:31,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:31,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:31,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:31,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:31,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:37:31,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:31,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:31,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:37:31,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:31,533 INFO L130 PetriNetUnfolder]: 678/1058 cut-off events. [2022-12-06 05:37:31,533 INFO L131 PetriNetUnfolder]: For 1651/1651 co-relation queries the response was YES. [2022-12-06 05:37:31,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3340 conditions, 1058 events. 678/1058 cut-off events. For 1651/1651 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4266 event pairs, 328 based on Foata normal form. 20/1072 useless extension candidates. Maximal degree in co-relation 2226. Up to 865 conditions per place. [2022-12-06 05:37:31,538 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 51 selfloop transitions, 2 changer transitions 7/60 dead transitions. [2022-12-06 05:37:31,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 60 transitions, 379 flow [2022-12-06 05:37:31,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 05:37:31,539 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2022-12-06 05:37:31,539 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 188 flow. Second operand 4 states and 56 transitions. [2022-12-06 05:37:31,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 60 transitions, 379 flow [2022-12-06 05:37:31,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 60 transitions, 363 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:37:31,542 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 191 flow [2022-12-06 05:37:31,542 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2022-12-06 05:37:31,542 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2022-12-06 05:37:31,542 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:31,542 INFO L89 Accepts]: Start accepts. Operand has 42 places, 36 transitions, 191 flow [2022-12-06 05:37:31,543 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:31,543 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:31,543 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 36 transitions, 191 flow [2022-12-06 05:37:31,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 191 flow [2022-12-06 05:37:31,552 INFO L130 PetriNetUnfolder]: 46/143 cut-off events. [2022-12-06 05:37:31,552 INFO L131 PetriNetUnfolder]: For 108/125 co-relation queries the response was YES. [2022-12-06 05:37:31,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 143 events. 46/143 cut-off events. For 108/125 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 585 event pairs, 5 based on Foata normal form. 1/132 useless extension candidates. Maximal degree in co-relation 313. Up to 56 conditions per place. [2022-12-06 05:37:31,553 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 36 transitions, 191 flow [2022-12-06 05:37:31,553 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 05:37:31,554 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:31,555 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:37:31,555 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 191 flow [2022-12-06 05:37:31,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:31,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:31,555 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:31,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:37:31,555 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 1 more)] === [2022-12-06 05:37:31,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:31,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1673894509, now seen corresponding path program 2 times [2022-12-06 05:37:31,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:31,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857329678] [2022-12-06 05:37:31,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:31,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:31,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:31,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857329678] [2022-12-06 05:37:31,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857329678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:31,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:31,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:31,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034167492] [2022-12-06 05:37:31,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:31,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:31,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:31,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:31,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:31,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:37:31,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:31,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:31,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:37:31,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:31,804 INFO L130 PetriNetUnfolder]: 820/1235 cut-off events. [2022-12-06 05:37:31,804 INFO L131 PetriNetUnfolder]: For 2143/2143 co-relation queries the response was YES. [2022-12-06 05:37:31,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4148 conditions, 1235 events. 820/1235 cut-off events. For 2143/2143 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5058 event pairs, 200 based on Foata normal form. 10/1239 useless extension candidates. Maximal degree in co-relation 3938. Up to 714 conditions per place. [2022-12-06 05:37:31,811 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 49 selfloop transitions, 8 changer transitions 13/70 dead transitions. [2022-12-06 05:37:31,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 70 transitions, 483 flow [2022-12-06 05:37:31,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 05:37:31,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2022-12-06 05:37:31,812 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 191 flow. Second operand 4 states and 62 transitions. [2022-12-06 05:37:31,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 70 transitions, 483 flow [2022-12-06 05:37:31,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 70 transitions, 473 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:37:31,820 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 217 flow [2022-12-06 05:37:31,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2022-12-06 05:37:31,822 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2022-12-06 05:37:31,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:31,822 INFO L89 Accepts]: Start accepts. Operand has 43 places, 36 transitions, 217 flow [2022-12-06 05:37:31,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:31,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:31,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 36 transitions, 217 flow [2022-12-06 05:37:31,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 217 flow [2022-12-06 05:37:31,834 INFO L130 PetriNetUnfolder]: 61/163 cut-off events. [2022-12-06 05:37:31,834 INFO L131 PetriNetUnfolder]: For 142/171 co-relation queries the response was YES. [2022-12-06 05:37:31,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 163 events. 61/163 cut-off events. For 142/171 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 671 event pairs, 5 based on Foata normal form. 6/162 useless extension candidates. Maximal degree in co-relation 416. Up to 73 conditions per place. [2022-12-06 05:37:31,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 36 transitions, 217 flow [2022-12-06 05:37:31,835 INFO L188 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-06 05:37:31,841 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:31,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 05:37:31,842 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 217 flow [2022-12-06 05:37:31,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:31,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:31,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:31,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:37:31,842 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 1 more)] === [2022-12-06 05:37:31,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:31,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1214448801, now seen corresponding path program 1 times [2022-12-06 05:37:31,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:31,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827810031] [2022-12-06 05:37:31,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:31,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:32,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:32,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827810031] [2022-12-06 05:37:32,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827810031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:32,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:32,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:32,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675995905] [2022-12-06 05:37:32,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:32,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:32,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:32,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:32,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:32,001 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 05:37:32,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:32,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:32,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 05:37:32,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:32,192 INFO L130 PetriNetUnfolder]: 960/1410 cut-off events. [2022-12-06 05:37:32,192 INFO L131 PetriNetUnfolder]: For 2778/2778 co-relation queries the response was YES. [2022-12-06 05:37:32,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5062 conditions, 1410 events. 960/1410 cut-off events. For 2778/2778 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5827 event pairs, 168 based on Foata normal form. 18/1422 useless extension candidates. Maximal degree in co-relation 3673. Up to 676 conditions per place. [2022-12-06 05:37:32,199 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 66 selfloop transitions, 17 changer transitions 0/83 dead transitions. [2022-12-06 05:37:32,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 83 transitions, 608 flow [2022-12-06 05:37:32,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-06 05:37:32,201 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2022-12-06 05:37:32,201 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 217 flow. Second operand 5 states and 73 transitions. [2022-12-06 05:37:32,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 83 transitions, 608 flow [2022-12-06 05:37:32,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 83 transitions, 592 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 05:37:32,206 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 306 flow [2022-12-06 05:37:32,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2022-12-06 05:37:32,207 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2022-12-06 05:37:32,207 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:32,207 INFO L89 Accepts]: Start accepts. Operand has 45 places, 44 transitions, 306 flow [2022-12-06 05:37:32,210 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:32,210 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:32,210 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 44 transitions, 306 flow [2022-12-06 05:37:32,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 44 transitions, 306 flow [2022-12-06 05:37:32,219 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][32], [42#L83true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 63#L99-4true, 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, 6#L72true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 104#(= ~N~0 ~L~0), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 105#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 68#L46-1true]) [2022-12-06 05:37:32,219 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is not cut-off event [2022-12-06 05:37:32,219 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 05:37:32,219 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2022-12-06 05:37:32,219 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 05:37:32,221 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][32], [42#L83true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 63#L99-4true, 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 6#L72true, 102#true, Black: 104#(= ~N~0 ~L~0), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 105#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 68#L46-1true]) [2022-12-06 05:37:32,221 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:37:32,221 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:32,221 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:32,221 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:32,221 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:37:32,224 INFO L130 PetriNetUnfolder]: 91/222 cut-off events. [2022-12-06 05:37:32,224 INFO L131 PetriNetUnfolder]: For 317/359 co-relation queries the response was YES. [2022-12-06 05:37:32,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 222 events. 91/222 cut-off events. For 317/359 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1011 event pairs, 8 based on Foata normal form. 12/231 useless extension candidates. Maximal degree in co-relation 665. Up to 100 conditions per place. [2022-12-06 05:37:32,226 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 44 transitions, 306 flow [2022-12-06 05:37:32,226 INFO L188 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-06 05:37:32,227 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:32,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 05:37:32,229 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 306 flow [2022-12-06 05:37:32,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:32,230 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:32,230 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:32,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:37:32,230 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 1 more)] === [2022-12-06 05:37:32,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:32,236 INFO L85 PathProgramCache]: Analyzing trace with hash -861510489, now seen corresponding path program 1 times [2022-12-06 05:37:32,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:32,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666910498] [2022-12-06 05:37:32,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:32,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:32,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:32,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666910498] [2022-12-06 05:37:32,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666910498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:32,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:32,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:32,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194540556] [2022-12-06 05:37:32,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:32,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:37:32,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:32,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:37:32,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:37:32,390 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 05:37:32,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 306 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:32,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:32,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 05:37:32,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:32,652 INFO L130 PetriNetUnfolder]: 1207/1818 cut-off events. [2022-12-06 05:37:32,652 INFO L131 PetriNetUnfolder]: For 5089/5089 co-relation queries the response was YES. [2022-12-06 05:37:32,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7184 conditions, 1818 events. 1207/1818 cut-off events. For 5089/5089 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8062 event pairs, 280 based on Foata normal form. 24/1836 useless extension candidates. Maximal degree in co-relation 4653. Up to 990 conditions per place. [2022-12-06 05:37:32,662 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 75 selfloop transitions, 18 changer transitions 0/93 dead transitions. [2022-12-06 05:37:32,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 93 transitions, 721 flow [2022-12-06 05:37:32,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-06 05:37:32,664 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2022-12-06 05:37:32,664 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 306 flow. Second operand 5 states and 71 transitions. [2022-12-06 05:37:32,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 93 transitions, 721 flow [2022-12-06 05:37:32,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 93 transitions, 701 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:37:32,672 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 432 flow [2022-12-06 05:37:32,672 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=432, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2022-12-06 05:37:32,674 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2022-12-06 05:37:32,674 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:32,674 INFO L89 Accepts]: Start accepts. Operand has 51 places, 52 transitions, 432 flow [2022-12-06 05:37:32,675 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:32,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:32,676 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 52 transitions, 432 flow [2022-12-06 05:37:32,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 52 transitions, 432 flow [2022-12-06 05:37:32,689 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][33], [42#L83true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 145#true, 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 63#L99-4true, 80#L53true, 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 104#(= ~N~0 ~L~0), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 105#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 48#L65-1true, Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2022-12-06 05:37:32,690 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is not cut-off event [2022-12-06 05:37:32,690 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 05:37:32,690 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 05:37:32,690 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2022-12-06 05:37:32,690 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][35], [42#L83true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 145#true, 63#L99-4true, 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 6#L72true, 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 104#(= ~N~0 ~L~0), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 105#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 68#L46-1true, Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2022-12-06 05:37:32,690 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is not cut-off event [2022-12-06 05:37:32,690 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 05:37:32,690 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2022-12-06 05:37:32,690 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 05:37:32,693 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][33], [42#L83true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 145#true, 80#L53true, 63#L99-4true, 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 104#(= ~N~0 ~L~0), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 105#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2022-12-06 05:37:32,693 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:37:32,693 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:37:32,693 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:32,693 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:32,693 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:32,694 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][35], [42#L83true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 145#true, 63#L99-4true, 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, 6#L72true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 104#(= ~N~0 ~L~0), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 105#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 68#L46-1true, Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2022-12-06 05:37:32,694 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:37:32,694 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:32,694 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:32,694 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:37:32,694 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:32,698 INFO L130 PetriNetUnfolder]: 128/310 cut-off events. [2022-12-06 05:37:32,698 INFO L131 PetriNetUnfolder]: For 743/854 co-relation queries the response was YES. [2022-12-06 05:37:32,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 310 events. 128/310 cut-off events. For 743/854 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1539 event pairs, 8 based on Foata normal form. 26/323 useless extension candidates. Maximal degree in co-relation 1079. Up to 138 conditions per place. [2022-12-06 05:37:32,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 52 transitions, 432 flow [2022-12-06 05:37:32,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 432 [2022-12-06 05:37:32,702 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:32,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 05:37:32,703 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 432 flow [2022-12-06 05:37:32,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:32,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:32,704 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:32,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:37:32,704 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 1 more)] === [2022-12-06 05:37:32,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:32,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1489845740, now seen corresponding path program 2 times [2022-12-06 05:37:32,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:32,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223344147] [2022-12-06 05:37:32,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:32,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:32,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:32,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223344147] [2022-12-06 05:37:32,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223344147] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:37:32,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359080334] [2022-12-06 05:37:32,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:37:32,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:32,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:32,815 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) [2022-12-06 05:37:32,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:37:32,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:37:32,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:37:32,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:37:32,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:37:32,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:32,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:37:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:33,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359080334] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:37:33,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:37:33,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 05:37:33,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991589832] [2022-12-06 05:37:33,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:37:33,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:37:33,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:33,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:37:33,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:37:33,009 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 05:37:33,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 432 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:33,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:33,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 05:37:33,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:33,287 INFO L130 PetriNetUnfolder]: 1535/2356 cut-off events. [2022-12-06 05:37:33,288 INFO L131 PetriNetUnfolder]: For 9451/9451 co-relation queries the response was YES. [2022-12-06 05:37:33,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10368 conditions, 2356 events. 1535/2356 cut-off events. For 9451/9451 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 11256 event pairs, 108 based on Foata normal form. 30/2380 useless extension candidates. Maximal degree in co-relation 8966. Up to 1088 conditions per place. [2022-12-06 05:37:33,301 INFO L137 encePairwiseOnDemand]: 17/28 looper letters, 108 selfloop transitions, 54 changer transitions 4/166 dead transitions. [2022-12-06 05:37:33,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 166 transitions, 1526 flow [2022-12-06 05:37:33,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:37:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:37:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-12-06 05:37:33,302 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3964285714285714 [2022-12-06 05:37:33,302 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 432 flow. Second operand 10 states and 111 transitions. [2022-12-06 05:37:33,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 166 transitions, 1526 flow [2022-12-06 05:37:33,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 166 transitions, 1466 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 05:37:33,324 INFO L231 Difference]: Finished difference. Result has 64 places, 91 transitions, 972 flow [2022-12-06 05:37:33,324 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=972, PETRI_PLACES=64, PETRI_TRANSITIONS=91} [2022-12-06 05:37:33,324 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2022-12-06 05:37:33,325 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:33,325 INFO L89 Accepts]: Start accepts. Operand has 64 places, 91 transitions, 972 flow [2022-12-06 05:37:33,325 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:33,325 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:33,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 91 transitions, 972 flow [2022-12-06 05:37:33,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 91 transitions, 972 flow [2022-12-06 05:37:33,344 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][49], [42#L83true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 63#L99-4true, 137#true, 80#L53true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, 159#true, Black: 104#(= ~N~0 ~L~0), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 278#(and (= thread1Thread1of1ForFork2_~cond~0 1) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 48#L65-1true, Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 280#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2022-12-06 05:37:33,344 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is not cut-off event [2022-12-06 05:37:33,344 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2022-12-06 05:37:33,344 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 05:37:33,344 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 05:37:33,344 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][52], [42#L83true, 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 63#L99-4true, 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, 6#L72true, Black: 104#(= ~N~0 ~L~0), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 278#(and (= thread1Thread1of1ForFork2_~cond~0 1) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 280#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 68#L46-1true, Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2022-12-06 05:37:33,344 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is not cut-off event [2022-12-06 05:37:33,345 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is not cut-off event [2022-12-06 05:37:33,345 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is not cut-off event [2022-12-06 05:37:33,345 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2022-12-06 05:37:33,349 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][58], [26#thread3EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 137#true, 80#L53true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 63#L99-4true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 6#L72true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 104#(= ~N~0 ~L~0), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 278#(and (= thread1Thread1of1ForFork2_~cond~0 1) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 280#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2022-12-06 05:37:33,349 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:37:33,349 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:33,349 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:33,349 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:33,354 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][49], [42#L83true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 63#L99-4true, 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 80#L53true, 102#true, 159#true, Black: 104#(= ~N~0 ~L~0), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 278#(and (= thread1Thread1of1ForFork2_~cond~0 1) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 48#L65-1true, Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 280#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1)]) [2022-12-06 05:37:33,354 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:37:33,354 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:33,354 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:33,354 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:33,354 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:33,354 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][52], [42#L83true, 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 63#L99-4true, 137#true, 6#L72true, 102#true, Black: 104#(= ~N~0 ~L~0), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 109#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 278#(and (= thread1Thread1of1ForFork2_~cond~0 1) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), 68#L46-1true, Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 280#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1)]) [2022-12-06 05:37:33,354 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:37:33,354 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:33,354 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:33,354 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:33,354 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:33,362 INFO L130 PetriNetUnfolder]: 246/549 cut-off events. [2022-12-06 05:37:33,362 INFO L131 PetriNetUnfolder]: For 2514/2667 co-relation queries the response was YES. [2022-12-06 05:37:33,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2474 conditions, 549 events. 246/549 cut-off events. For 2514/2667 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3001 event pairs, 8 based on Foata normal form. 60/598 useless extension candidates. Maximal degree in co-relation 2324. Up to 232 conditions per place. [2022-12-06 05:37:33,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 91 transitions, 972 flow [2022-12-06 05:37:33,367 INFO L188 LiptonReduction]: Number of co-enabled transitions 566 [2022-12-06 05:37:33,376 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:37:33,495 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:37:33,603 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 05:37:33,738 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:37:33,770 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:37:33,802 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 05:37:33,906 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 05:37:34,030 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:37:34,067 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:37:34,106 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:37:34,143 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 05:37:34,264 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 05:37:34,378 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 05:37:34,506 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:37:34,547 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:37:34,590 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:37:34,591 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1266 [2022-12-06 05:37:34,591 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 89 transitions, 1057 flow [2022-12-06 05:37:34,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:34,591 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:34,591 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:34,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:37:34,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:34,792 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 1 more)] === [2022-12-06 05:37:34,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:34,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2129447873, now seen corresponding path program 2 times [2022-12-06 05:37:34,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:34,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402835139] [2022-12-06 05:37:34,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:34,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:34,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:34,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402835139] [2022-12-06 05:37:34,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402835139] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:37:34,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195797301] [2022-12-06 05:37:34,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:37:34,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:34,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:34,979 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) [2022-12-06 05:37:34,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:37:35,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:37:35,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:37:35,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 05:37:35,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:37:35,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:35,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:37:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:35,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195797301] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:37:35,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:37:35,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2022-12-06 05:37:35,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981750530] [2022-12-06 05:37:35,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:37:35,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:37:35,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:35,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:37:35,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:37:35,337 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:37:35,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 89 transitions, 1057 flow. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:35,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:35,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:37:35,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:36,808 INFO L130 PetriNetUnfolder]: 2740/4183 cut-off events. [2022-12-06 05:37:36,809 INFO L131 PetriNetUnfolder]: For 21786/21786 co-relation queries the response was YES. [2022-12-06 05:37:36,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20467 conditions, 4183 events. 2740/4183 cut-off events. For 21786/21786 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 22051 event pairs, 32 based on Foata normal form. 107/4284 useless extension candidates. Maximal degree in co-relation 18211. Up to 1440 conditions per place. [2022-12-06 05:37:36,847 INFO L137 encePairwiseOnDemand]: 15/43 looper letters, 176 selfloop transitions, 148 changer transitions 52/376 dead transitions. [2022-12-06 05:37:36,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 376 transitions, 3891 flow [2022-12-06 05:37:36,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 05:37:36,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 05:37:36,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 291 transitions. [2022-12-06 05:37:36,849 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2942366026289181 [2022-12-06 05:37:36,849 INFO L175 Difference]: Start difference. First operand has 62 places, 89 transitions, 1057 flow. Second operand 23 states and 291 transitions. [2022-12-06 05:37:36,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 376 transitions, 3891 flow [2022-12-06 05:37:36,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 376 transitions, 3667 flow, removed 101 selfloop flow, removed 3 redundant places. [2022-12-06 05:37:36,961 INFO L231 Difference]: Finished difference. Result has 96 places, 187 transitions, 2672 flow [2022-12-06 05:37:36,961 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2672, PETRI_PLACES=96, PETRI_TRANSITIONS=187} [2022-12-06 05:37:36,961 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 66 predicate places. [2022-12-06 05:37:36,962 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:36,962 INFO L89 Accepts]: Start accepts. Operand has 96 places, 187 transitions, 2672 flow [2022-12-06 05:37:36,963 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:36,963 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:36,964 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 187 transitions, 2672 flow [2022-12-06 05:37:36,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 187 transitions, 2672 flow [2022-12-06 05:37:37,005 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][110], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 444#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 63#L99-4true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 380#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 278#(and (= thread1Thread1of1ForFork2_~cond~0 1) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 280#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, 6#L72true, 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 104#(= ~N~0 ~L~0), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 436#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:37:37,005 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:37:37,005 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:37,006 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:37,006 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:37,017 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][110], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 444#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 137#true, 63#L99-4true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 380#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 278#(and (= thread1Thread1of1ForFork2_~cond~0 1) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), 48#L65-1true, Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 280#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 287#true, 26#thread3EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, Black: 104#(= ~N~0 ~L~0), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 436#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:37:37,018 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:37,018 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:37,018 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:37,018 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:37,064 INFO L130 PetriNetUnfolder]: 423/913 cut-off events. [2022-12-06 05:37:37,064 INFO L131 PetriNetUnfolder]: For 9115/9744 co-relation queries the response was YES. [2022-12-06 05:37:37,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5415 conditions, 913 events. 423/913 cut-off events. For 9115/9744 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5644 event pairs, 2 based on Foata normal form. 69/966 useless extension candidates. Maximal degree in co-relation 5267. Up to 389 conditions per place. [2022-12-06 05:37:37,079 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 187 transitions, 2672 flow [2022-12-06 05:37:37,079 INFO L188 LiptonReduction]: Number of co-enabled transitions 1140 [2022-12-06 05:37:37,086 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:37:37,254 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:37:37,352 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [254] L65-1-->L72: Formula: (= (ite (= (ite (< 1 (mod v_~N~0_12 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_7) InVars {~N~0=v_~N~0_12} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_7, ~N~0=v_~N~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] [2022-12-06 05:37:37,405 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:37:37,509 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [254] L65-1-->L72: Formula: (= (ite (= (ite (< 1 (mod v_~N~0_12 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_7) InVars {~N~0=v_~N~0_12} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_7, ~N~0=v_~N~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] [2022-12-06 05:37:37,539 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [254] L65-1-->L72: Formula: (= (ite (= (ite (< 1 (mod v_~N~0_12 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_7) InVars {~N~0=v_~N~0_12} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_7, ~N~0=v_~N~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] [2022-12-06 05:37:37,619 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [248] $Ultimate##0-->L72: Formula: (= v_thread2Thread1of1ForFork0_~cond~1_1 (ite (= (ite (< 1 (mod v_~N~0_10 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_10} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_1, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] and [340] $Ultimate##0-->L65-1: Formula: (let ((.cse1 (mod v_~N~0_102 4294967296))) (and (let ((.cse0 (< 1 .cse1))) (or (and .cse0 (= v_~N~0_102 (+ v_~N~0_101 2)) (= v_~p~0_89 (+ (* 2 v_~M~0_68) v_~p~0_90))) (and (= v_~p~0_90 v_~p~0_89) (= v_~N~0_102 v_~N~0_101) (not .cse0)))) (= v_thread1Thread1of1ForFork2_~cond~0_37 (ite (= (ite (< 0 .cse1) 1 0) 0) 0 1)) (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_25 256) 0)))) InVars {~M~0=v_~M~0_68, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_25, ~p~0=v_~p~0_90, ~N~0=v_~N~0_102} OutVars{~M~0=v_~M~0_68, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_25, ~p~0=v_~p~0_89, ~N~0=v_~N~0_101, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_37} AuxVars[] AssignedVars[~p~0, ~N~0, thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:37:37,673 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [248] $Ultimate##0-->L72: Formula: (= v_thread2Thread1of1ForFork0_~cond~1_1 (ite (= (ite (< 1 (mod v_~N~0_10 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_10} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_1, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] and [336] $Ultimate##0-->L46-1: Formula: (and (= (+ v_~p~0_86 v_~M~0_64) v_~p~0_85) (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_29 256) 0)) (= v_thread1Thread1of1ForFork2_~cond~0_29 (ite (= (ite (< 0 (mod v_~N~0_92 4294967296)) 1 0) 0) 0 1)) (= (+ 1 v_~N~0_91) v_~N~0_92)) InVars {~M~0=v_~M~0_64, ~p~0=v_~p~0_86, ~N~0=v_~N~0_92} OutVars{~M~0=v_~M~0_64, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_19|, ~p~0=v_~p~0_85, ~N~0=v_~N~0_91, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_29} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0, thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:37:37,723 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:37:37,890 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:37:37,890 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 928 [2022-12-06 05:37:37,891 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 184 transitions, 2723 flow [2022-12-06 05:37:37,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:37,891 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:37,891 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:37,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:37:38,091 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,SelfDestructingSolverStorable9 [2022-12-06 05:37:38,092 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 1 more)] === [2022-12-06 05:37:38,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:38,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1954420314, now seen corresponding path program 1 times [2022-12-06 05:37:38,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:38,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948026173] [2022-12-06 05:37:38,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:38,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:38,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:38,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948026173] [2022-12-06 05:37:38,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948026173] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:37:38,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563010280] [2022-12-06 05:37:38,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:38,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:38,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:38,277 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) [2022-12-06 05:37:38,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:37:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:38,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 05:37:38,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:37:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:38,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:37:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:38,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563010280] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:37:38,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:37:38,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 2] total 5 [2022-12-06 05:37:38,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042289146] [2022-12-06 05:37:38,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:37:38,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:37:38,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:38,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:37:38,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:37:38,448 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2022-12-06 05:37:38,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 184 transitions, 2723 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:38,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:38,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2022-12-06 05:37:38,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:38,954 INFO L130 PetriNetUnfolder]: 2637/4121 cut-off events. [2022-12-06 05:37:38,954 INFO L131 PetriNetUnfolder]: For 41590/41914 co-relation queries the response was YES. [2022-12-06 05:37:38,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25616 conditions, 4121 events. 2637/4121 cut-off events. For 41590/41914 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 22859 event pairs, 295 based on Foata normal form. 180/4232 useless extension candidates. Maximal degree in co-relation 25135. Up to 3178 conditions per place. [2022-12-06 05:37:38,988 INFO L137 encePairwiseOnDemand]: 39/51 looper letters, 161 selfloop transitions, 46 changer transitions 1/249 dead transitions. [2022-12-06 05:37:38,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 249 transitions, 3819 flow [2022-12-06 05:37:38,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-06 05:37:38,990 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2022-12-06 05:37:38,990 INFO L175 Difference]: Start difference. First operand has 89 places, 184 transitions, 2723 flow. Second operand 5 states and 105 transitions. [2022-12-06 05:37:38,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 249 transitions, 3819 flow [2022-12-06 05:37:39,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 249 transitions, 3540 flow, removed 135 selfloop flow, removed 5 redundant places. [2022-12-06 05:37:39,124 INFO L231 Difference]: Finished difference. Result has 90 places, 221 transitions, 3193 flow [2022-12-06 05:37:39,124 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2494, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3193, PETRI_PLACES=90, PETRI_TRANSITIONS=221} [2022-12-06 05:37:39,125 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 60 predicate places. [2022-12-06 05:37:39,125 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:39,125 INFO L89 Accepts]: Start accepts. Operand has 90 places, 221 transitions, 3193 flow [2022-12-06 05:37:39,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:39,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:39,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 221 transitions, 3193 flow [2022-12-06 05:37:39,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 221 transitions, 3193 flow [2022-12-06 05:37:39,159 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][94], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 137#true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 287#true, 26#thread3EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, Black: 104#(= ~N~0 ~L~0), 460#true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 436#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 05:37:39,159 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 05:37:39,159 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:37:39,160 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:39,160 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:37:39,163 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][94], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 26#thread3EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, 6#L72true, 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 104#(= ~N~0 ~L~0), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 436#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:37:39,163 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 05:37:39,163 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:39,163 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:39,163 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:39,168 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][94], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, 137#true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 287#true, 26#thread3EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, 6#L72true, Black: 104#(= ~N~0 ~L~0), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 436#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:37:39,168 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:39,168 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:39,168 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:39,168 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:39,209 INFO L130 PetriNetUnfolder]: 465/1005 cut-off events. [2022-12-06 05:37:39,209 INFO L131 PetriNetUnfolder]: For 9727/10611 co-relation queries the response was YES. [2022-12-06 05:37:39,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5940 conditions, 1005 events. 465/1005 cut-off events. For 9727/10611 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6305 event pairs, 5 based on Foata normal form. 71/1048 useless extension candidates. Maximal degree in co-relation 5648. Up to 369 conditions per place. [2022-12-06 05:37:39,219 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 221 transitions, 3193 flow [2022-12-06 05:37:39,219 INFO L188 LiptonReduction]: Number of co-enabled transitions 1326 [2022-12-06 05:37:39,220 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:39,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 05:37:39,221 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 221 transitions, 3193 flow [2022-12-06 05:37:39,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:39,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:39,221 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:39,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 05:37:39,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:39,423 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 1 more)] === [2022-12-06 05:37:39,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:39,423 INFO L85 PathProgramCache]: Analyzing trace with hash -946661476, now seen corresponding path program 1 times [2022-12-06 05:37:39,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:39,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031121154] [2022-12-06 05:37:39,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:39,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:39,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:39,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031121154] [2022-12-06 05:37:39,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031121154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:39,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:39,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:39,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136961783] [2022-12-06 05:37:39,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:39,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:37:39,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:39,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:37:39,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:37:39,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:37:39,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 221 transitions, 3193 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:39,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:39,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:37:39,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:40,311 INFO L130 PetriNetUnfolder]: 3303/4994 cut-off events. [2022-12-06 05:37:40,311 INFO L131 PetriNetUnfolder]: For 47688/47688 co-relation queries the response was YES. [2022-12-06 05:37:40,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30498 conditions, 4994 events. 3303/4994 cut-off events. For 47688/47688 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 26710 event pairs, 524 based on Foata normal form. 10/5004 useless extension candidates. Maximal degree in co-relation 29260. Up to 4720 conditions per place. [2022-12-06 05:37:40,340 INFO L137 encePairwiseOnDemand]: 35/51 looper letters, 235 selfloop transitions, 35 changer transitions 4/274 dead transitions. [2022-12-06 05:37:40,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 274 transitions, 4254 flow [2022-12-06 05:37:40,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 05:37:40,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34509803921568627 [2022-12-06 05:37:40,341 INFO L175 Difference]: Start difference. First operand has 90 places, 221 transitions, 3193 flow. Second operand 5 states and 88 transitions. [2022-12-06 05:37:40,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 274 transitions, 4254 flow [2022-12-06 05:37:40,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 274 transitions, 4145 flow, removed 50 selfloop flow, removed 2 redundant places. [2022-12-06 05:37:40,472 INFO L231 Difference]: Finished difference. Result has 94 places, 247 transitions, 3599 flow [2022-12-06 05:37:40,473 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=3084, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3599, PETRI_PLACES=94, PETRI_TRANSITIONS=247} [2022-12-06 05:37:40,473 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 64 predicate places. [2022-12-06 05:37:40,473 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:40,473 INFO L89 Accepts]: Start accepts. Operand has 94 places, 247 transitions, 3599 flow [2022-12-06 05:37:40,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:40,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:40,476 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 247 transitions, 3599 flow [2022-12-06 05:37:40,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 247 transitions, 3599 flow [2022-12-06 05:37:40,512 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][108], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 63#L99-4true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 137#true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 287#true, 26#thread3EXITtrue, 577#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, Black: 104#(= ~N~0 ~L~0), 460#true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 05:37:40,513 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 05:37:40,513 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:37:40,513 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:40,513 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:37:40,518 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][108], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 63#L99-4true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 287#true, 26#thread3EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 80#L53true, 6#L72true, Black: 104#(= ~N~0 ~L~0), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 05:37:40,519 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:40,519 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:40,519 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:40,519 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:40,522 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][108], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 63#L99-4true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, 577#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, 6#L72true, 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 104#(= ~N~0 ~L~0), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 05:37:40,522 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 05:37:40,522 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:40,522 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:40,522 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:40,582 INFO L130 PetriNetUnfolder]: 493/1079 cut-off events. [2022-12-06 05:37:40,583 INFO L131 PetriNetUnfolder]: For 9870/10750 co-relation queries the response was YES. [2022-12-06 05:37:40,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6411 conditions, 1079 events. 493/1079 cut-off events. For 9870/10750 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6996 event pairs, 5 based on Foata normal form. 76/1127 useless extension candidates. Maximal degree in co-relation 6101. Up to 331 conditions per place. [2022-12-06 05:37:40,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 247 transitions, 3599 flow [2022-12-06 05:37:40,597 INFO L188 LiptonReduction]: Number of co-enabled transitions 1474 [2022-12-06 05:37:40,598 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:40,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-06 05:37:40,599 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 247 transitions, 3599 flow [2022-12-06 05:37:40,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:40,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:40,600 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:40,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:37:40,600 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 1 more)] === [2022-12-06 05:37:40,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:40,600 INFO L85 PathProgramCache]: Analyzing trace with hash -795023675, now seen corresponding path program 1 times [2022-12-06 05:37:40,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:40,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709997699] [2022-12-06 05:37:40,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:40,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:40,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:40,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709997699] [2022-12-06 05:37:40,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709997699] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:37:40,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42006400] [2022-12-06 05:37:40,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:40,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:40,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:40,768 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) [2022-12-06 05:37:40,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:37:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:40,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 05:37:40,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:37:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:40,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:37:41,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:41,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42006400] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:37:41,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:37:41,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 05:37:41,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624135122] [2022-12-06 05:37:41,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:37:41,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:37:41,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:41,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:37:41,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:37:41,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:37:41,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 247 transitions, 3599 flow. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:41,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:41,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:37:41,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:41,987 INFO L130 PetriNetUnfolder]: 4021/6144 cut-off events. [2022-12-06 05:37:41,987 INFO L131 PetriNetUnfolder]: For 59000/59000 co-relation queries the response was YES. [2022-12-06 05:37:42,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38549 conditions, 6144 events. 4021/6144 cut-off events. For 59000/59000 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 34564 event pairs, 486 based on Foata normal form. 8/6152 useless extension candidates. Maximal degree in co-relation 35503. Up to 4379 conditions per place. [2022-12-06 05:37:42,034 INFO L137 encePairwiseOnDemand]: 17/51 looper letters, 234 selfloop transitions, 169 changer transitions 5/408 dead transitions. [2022-12-06 05:37:42,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 408 transitions, 6374 flow [2022-12-06 05:37:42,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:37:42,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:37:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2022-12-06 05:37:42,035 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-06 05:37:42,035 INFO L175 Difference]: Start difference. First operand has 94 places, 247 transitions, 3599 flow. Second operand 8 states and 119 transitions. [2022-12-06 05:37:42,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 408 transitions, 6374 flow [2022-12-06 05:37:42,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 408 transitions, 6307 flow, removed 29 selfloop flow, removed 1 redundant places. [2022-12-06 05:37:42,228 INFO L231 Difference]: Finished difference. Result has 103 places, 328 transitions, 5362 flow [2022-12-06 05:37:42,228 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=3532, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5362, PETRI_PLACES=103, PETRI_TRANSITIONS=328} [2022-12-06 05:37:42,230 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2022-12-06 05:37:42,230 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:42,230 INFO L89 Accepts]: Start accepts. Operand has 103 places, 328 transitions, 5362 flow [2022-12-06 05:37:42,231 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:42,231 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:42,231 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 328 transitions, 5362 flow [2022-12-06 05:37:42,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 328 transitions, 5362 flow [2022-12-06 05:37:42,273 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][119], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 137#true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 287#true, 26#thread3EXITtrue, 577#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, Black: 104#(= ~N~0 ~L~0), 460#true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 05:37:42,273 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 05:37:42,273 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:37:42,273 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:37:42,273 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:42,278 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][119], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 287#true, 26#thread3EXITtrue, 577#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, 6#L72true, Black: 104#(= ~N~0 ~L~0), 460#true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 05:37:42,279 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,279 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,279 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:42,279 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:42,280 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][98], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 137#true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 102#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 287#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 80#L53true, 159#true, Black: 104#(= ~N~0 ~L~0), 586#true, 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 05:37:42,280 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,280 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,280 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:42,280 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,280 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][119], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 287#true, 26#thread3EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 80#L53true, 6#L72true, Black: 104#(= ~N~0 ~L~0), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 05:37:42,281 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,281 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,281 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:42,281 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:42,281 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,281 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][38], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 137#true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 102#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 68#L46-1true, Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 287#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 6#L72true, Black: 104#(= ~N~0 ~L~0), 586#true, 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 05:37:42,281 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,281 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,281 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:42,281 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,295 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][119], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, 577#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 80#L53true, 6#L72true, 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 104#(= ~N~0 ~L~0), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 05:37:42,295 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 05:37:42,295 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:42,295 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:42,295 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,299 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][142], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 287#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 80#L53true, 159#true, Black: 104#(= ~N~0 ~L~0), 586#true, 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 05:37:42,299 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,299 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,299 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:42,299 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:42,300 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][145], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 63#L99-4true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 102#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), 68#L46-1true, Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 287#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 6#L72true, Black: 104#(= ~N~0 ~L~0), 586#true, 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 05:37:42,300 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,300 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,300 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:42,300 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:42,301 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][119], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 80#L53true, 6#L72true, 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 104#(= ~N~0 ~L~0), 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 05:37:42,301 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,301 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:42,301 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:42,301 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:42,301 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,301 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][151], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 80#L53true, 159#true, Black: 104#(= ~N~0 ~L~0), 586#true, 460#true, 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 05:37:42,301 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,301 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,301 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:42,302 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:42,302 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][148], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 63#L99-4true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 102#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), 68#L46-1true, Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 6#L72true, Black: 104#(= ~N~0 ~L~0), 460#true, 586#true, 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 05:37:42,302 INFO L382 tUnfolder$Statistics]: this new event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,302 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:42,302 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,302 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:42,309 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][48], [Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 580#(= ~L~0 (+ 2 ~N~0)), 102#true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 287#true, 9#thread1EXITtrue, 577#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 104#(= ~N~0 ~L~0), 586#true, 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 05:37:42,309 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:37:42,309 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:42,309 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:42,309 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,319 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][207], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 287#true, 9#thread1EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 104#(= ~N~0 ~L~0), 586#true, 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 05:37:42,319 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:37:42,319 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,319 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:42,319 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:37:42,320 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][233], [Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 440#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 583#(and (= ~L~0 (+ 2 ~N~0)) (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))), 137#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 577#true, 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 104#(= ~N~0 ~L~0), 586#true, 460#true, 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 442#(and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0))]) [2022-12-06 05:37:42,320 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:37:42,320 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:42,320 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:42,320 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:37:42,353 INFO L130 PetriNetUnfolder]: 610/1385 cut-off events. [2022-12-06 05:37:42,353 INFO L131 PetriNetUnfolder]: For 15549/16317 co-relation queries the response was YES. [2022-12-06 05:37:42,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8789 conditions, 1385 events. 610/1385 cut-off events. For 15549/16317 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 9669 event pairs, 5 based on Foata normal form. 90/1444 useless extension candidates. Maximal degree in co-relation 8362. Up to 439 conditions per place. [2022-12-06 05:37:42,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 328 transitions, 5362 flow [2022-12-06 05:37:42,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 1792 [2022-12-06 05:37:42,368 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [339] $Ultimate##0-->L83: Formula: (and (= v_thread1Thread1of1ForFork2_~cond~0_35 (ite (= 0 (ite (< 0 (mod v_~N~0_99 4294967296)) 1 0)) 0 1)) (< 0 (mod v_~L~0_57 4294967296)) (= v_~q~0_43 (+ v_~q~0_44 v_~M~0_66)) (= (+ v_~L~0_56 1) v_~L~0_57)) InVars {~M~0=v_~M~0_66, ~L~0=v_~L~0_57, ~q~0=v_~q~0_44, ~N~0=v_~N~0_99} OutVars{~M~0=v_~M~0_66, ~L~0=v_~L~0_56, ~q~0=v_~q~0_43, ~N~0=v_~N~0_99, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_7|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_35} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:37:42,446 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [339] $Ultimate##0-->L83: Formula: (and (= v_thread1Thread1of1ForFork2_~cond~0_35 (ite (= 0 (ite (< 0 (mod v_~N~0_99 4294967296)) 1 0)) 0 1)) (< 0 (mod v_~L~0_57 4294967296)) (= v_~q~0_43 (+ v_~q~0_44 v_~M~0_66)) (= (+ v_~L~0_56 1) v_~L~0_57)) InVars {~M~0=v_~M~0_66, ~L~0=v_~L~0_57, ~q~0=v_~q~0_44, ~N~0=v_~N~0_99} OutVars{~M~0=v_~M~0_66, ~L~0=v_~L~0_56, ~q~0=v_~q~0_43, ~N~0=v_~N~0_99, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_7|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_35} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] and [248] $Ultimate##0-->L72: Formula: (= v_thread2Thread1of1ForFork0_~cond~1_1 (ite (= (ite (< 1 (mod v_~N~0_10 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_10} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_1, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] [2022-12-06 05:37:42,474 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:42,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 245 [2022-12-06 05:37:42,475 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 328 transitions, 5388 flow [2022-12-06 05:37:42,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:42,475 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:42,475 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:42,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 05:37:42,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:42,675 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 1 more)] === [2022-12-06 05:37:42,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1554296755, now seen corresponding path program 1 times [2022-12-06 05:37:42,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:42,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338473613] [2022-12-06 05:37:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:37:42,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:42,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338473613] [2022-12-06 05:37:42,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338473613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:42,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:42,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:42,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462565562] [2022-12-06 05:37:42,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:42,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:42,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:42,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:42,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:42,753 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 05:37:42,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 328 transitions, 5388 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:42,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:42,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 05:37:42,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:43,660 INFO L130 PetriNetUnfolder]: 4259/6501 cut-off events. [2022-12-06 05:37:43,660 INFO L131 PetriNetUnfolder]: For 93004/93004 co-relation queries the response was YES. [2022-12-06 05:37:43,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43544 conditions, 6501 events. 4259/6501 cut-off events. For 93004/93004 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 37144 event pairs, 712 based on Foata normal form. 272/6773 useless extension candidates. Maximal degree in co-relation 40891. Up to 5101 conditions per place. [2022-12-06 05:37:43,712 INFO L137 encePairwiseOnDemand]: 29/53 looper letters, 352 selfloop transitions, 45 changer transitions 0/397 dead transitions. [2022-12-06 05:37:43,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 397 transitions, 6883 flow [2022-12-06 05:37:43,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:43,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-12-06 05:37:43,714 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4528301886792453 [2022-12-06 05:37:43,714 INFO L175 Difference]: Start difference. First operand has 103 places, 328 transitions, 5388 flow. Second operand 4 states and 96 transitions. [2022-12-06 05:37:43,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 397 transitions, 6883 flow [2022-12-06 05:37:44,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 397 transitions, 6391 flow, removed 195 selfloop flow, removed 6 redundant places. [2022-12-06 05:37:44,078 INFO L231 Difference]: Finished difference. Result has 99 places, 318 transitions, 4935 flow [2022-12-06 05:37:44,078 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=4339, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4935, PETRI_PLACES=99, PETRI_TRANSITIONS=318} [2022-12-06 05:37:44,078 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2022-12-06 05:37:44,079 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:44,079 INFO L89 Accepts]: Start accepts. Operand has 99 places, 318 transitions, 4935 flow [2022-12-06 05:37:44,080 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:44,080 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:44,080 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 318 transitions, 4935 flow [2022-12-06 05:37:44,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 318 transitions, 4935 flow [2022-12-06 05:37:44,203 INFO L130 PetriNetUnfolder]: 565/1366 cut-off events. [2022-12-06 05:37:44,203 INFO L131 PetriNetUnfolder]: For 11987/12435 co-relation queries the response was YES. [2022-12-06 05:37:44,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7981 conditions, 1366 events. 565/1366 cut-off events. For 11987/12435 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 9967 event pairs, 6 based on Foata normal form. 61/1399 useless extension candidates. Maximal degree in co-relation 7548. Up to 412 conditions per place. [2022-12-06 05:37:44,222 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 318 transitions, 4935 flow [2022-12-06 05:37:44,222 INFO L188 LiptonReduction]: Number of co-enabled transitions 1788 [2022-12-06 05:37:44,224 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:44,225 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-06 05:37:44,225 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 318 transitions, 4935 flow [2022-12-06 05:37:44,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:44,225 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:44,225 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:44,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:37:44,225 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 1 more)] === [2022-12-06 05:37:44,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:44,226 INFO L85 PathProgramCache]: Analyzing trace with hash -770404099, now seen corresponding path program 1 times [2022-12-06 05:37:44,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:44,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420236306] [2022-12-06 05:37:44,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:44,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:44,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:44,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420236306] [2022-12-06 05:37:44,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420236306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:44,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:44,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:44,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017250330] [2022-12-06 05:37:44,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:44,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:44,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:44,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:44,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:44,374 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 05:37:44,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 318 transitions, 4935 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:44,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:44,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 05:37:44,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:45,583 INFO L130 PetriNetUnfolder]: 5544/8572 cut-off events. [2022-12-06 05:37:45,583 INFO L131 PetriNetUnfolder]: For 98405/98405 co-relation queries the response was YES. [2022-12-06 05:37:45,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54461 conditions, 8572 events. 5544/8572 cut-off events. For 98405/98405 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 52412 event pairs, 539 based on Foata normal form. 76/8648 useless extension candidates. Maximal degree in co-relation 51211. Up to 3923 conditions per place. [2022-12-06 05:37:45,637 INFO L137 encePairwiseOnDemand]: 16/45 looper letters, 548 selfloop transitions, 135 changer transitions 0/683 dead transitions. [2022-12-06 05:37:45,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 683 transitions, 11075 flow [2022-12-06 05:37:45,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:37:45,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:37:45,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2022-12-06 05:37:45,638 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3656565656565657 [2022-12-06 05:37:45,638 INFO L175 Difference]: Start difference. First operand has 99 places, 318 transitions, 4935 flow. Second operand 11 states and 181 transitions. [2022-12-06 05:37:45,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 683 transitions, 11075 flow [2022-12-06 05:37:45,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 683 transitions, 11011 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 05:37:45,888 INFO L231 Difference]: Finished difference. Result has 113 places, 406 transitions, 6797 flow [2022-12-06 05:37:45,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=4880, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6797, PETRI_PLACES=113, PETRI_TRANSITIONS=406} [2022-12-06 05:37:45,889 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 83 predicate places. [2022-12-06 05:37:45,889 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:45,889 INFO L89 Accepts]: Start accepts. Operand has 113 places, 406 transitions, 6797 flow [2022-12-06 05:37:45,890 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:45,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:45,891 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 406 transitions, 6797 flow [2022-12-06 05:37:45,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 406 transitions, 6797 flow [2022-12-06 05:37:46,066 INFO L130 PetriNetUnfolder]: 869/2028 cut-off events. [2022-12-06 05:37:46,066 INFO L131 PetriNetUnfolder]: For 25554/26215 co-relation queries the response was YES. [2022-12-06 05:37:46,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13035 conditions, 2028 events. 869/2028 cut-off events. For 25554/26215 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 15831 event pairs, 8 based on Foata normal form. 100/2091 useless extension candidates. Maximal degree in co-relation 12414. Up to 582 conditions per place. [2022-12-06 05:37:46,085 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 406 transitions, 6797 flow [2022-12-06 05:37:46,085 INFO L188 LiptonReduction]: Number of co-enabled transitions 2210 [2022-12-06 05:37:46,087 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:37:46,195 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [339] $Ultimate##0-->L83: Formula: (and (= v_thread1Thread1of1ForFork2_~cond~0_35 (ite (= 0 (ite (< 0 (mod v_~N~0_99 4294967296)) 1 0)) 0 1)) (< 0 (mod v_~L~0_57 4294967296)) (= v_~q~0_43 (+ v_~q~0_44 v_~M~0_66)) (= (+ v_~L~0_56 1) v_~L~0_57)) InVars {~M~0=v_~M~0_66, ~L~0=v_~L~0_57, ~q~0=v_~q~0_44, ~N~0=v_~N~0_99} OutVars{~M~0=v_~M~0_66, ~L~0=v_~L~0_56, ~q~0=v_~q~0_43, ~N~0=v_~N~0_99, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_7|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_35} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:37:46,248 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:37:46,357 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:37:46,402 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [349] L83-->L53: Formula: (and (= v_thread1Thread1of1ForFork2_~cond~0_59 (ite (= (ite (< 0 (mod v_~N~0_149 4294967296)) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork1_#res.offset_33| 0) (= |v_thread3Thread1of1ForFork1_#res.base_33| 0) (not (< 0 (mod v_~L~0_79 4294967296)))) InVars {~L~0=v_~L~0_79, ~N~0=v_~N~0_149} OutVars{~L~0=v_~L~0_79, thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_33|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_33|, ~N~0=v_~N~0_149, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:37:46,516 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [248] $Ultimate##0-->L72: Formula: (= v_thread2Thread1of1ForFork0_~cond~1_1 (ite (= (ite (< 1 (mod v_~N~0_10 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_10} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_1, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] and [339] $Ultimate##0-->L83: Formula: (and (= v_thread1Thread1of1ForFork2_~cond~0_35 (ite (= 0 (ite (< 0 (mod v_~N~0_99 4294967296)) 1 0)) 0 1)) (< 0 (mod v_~L~0_57 4294967296)) (= v_~q~0_43 (+ v_~q~0_44 v_~M~0_66)) (= (+ v_~L~0_56 1) v_~L~0_57)) InVars {~M~0=v_~M~0_66, ~L~0=v_~L~0_57, ~q~0=v_~q~0_44, ~N~0=v_~N~0_99} OutVars{~M~0=v_~M~0_66, ~L~0=v_~L~0_56, ~q~0=v_~q~0_43, ~N~0=v_~N~0_99, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_7|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_35} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:37:46,584 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [248] $Ultimate##0-->L72: Formula: (= v_thread2Thread1of1ForFork0_~cond~1_1 (ite (= (ite (< 1 (mod v_~N~0_10 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_10} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_1, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:37:46,607 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:37:46,608 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 719 [2022-12-06 05:37:46,608 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 406 transitions, 6832 flow [2022-12-06 05:37:46,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:46,608 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:46,608 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:46,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:37:46,608 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 1 more)] === [2022-12-06 05:37:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1411093443, now seen corresponding path program 2 times [2022-12-06 05:37:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:46,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509195319] [2022-12-06 05:37:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:46,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:46,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:46,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509195319] [2022-12-06 05:37:46,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509195319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:46,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:46,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:46,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586343595] [2022-12-06 05:37:46,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:46,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:46,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:46,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:46,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:46,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 05:37:46,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 406 transitions, 6832 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:46,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:46,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 05:37:46,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:49,030 INFO L130 PetriNetUnfolder]: 6335/9912 cut-off events. [2022-12-06 05:37:49,031 INFO L131 PetriNetUnfolder]: For 141093/141093 co-relation queries the response was YES. [2022-12-06 05:37:49,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69212 conditions, 9912 events. 6335/9912 cut-off events. For 141093/141093 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 63483 event pairs, 663 based on Foata normal form. 82/9994 useless extension candidates. Maximal degree in co-relation 65535. Up to 5652 conditions per place. [2022-12-06 05:37:49,128 INFO L137 encePairwiseOnDemand]: 16/52 looper letters, 472 selfloop transitions, 164 changer transitions 7/643 dead transitions. [2022-12-06 05:37:49,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 643 transitions, 11386 flow [2022-12-06 05:37:49,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:37:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:37:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2022-12-06 05:37:49,129 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-06 05:37:49,130 INFO L175 Difference]: Start difference. First operand has 113 places, 406 transitions, 6832 flow. Second operand 8 states and 169 transitions. [2022-12-06 05:37:49,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 643 transitions, 11386 flow [2022-12-06 05:37:49,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 643 transitions, 11280 flow, removed 53 selfloop flow, removed 0 redundant places. [2022-12-06 05:37:49,841 INFO L231 Difference]: Finished difference. Result has 123 places, 453 transitions, 8098 flow [2022-12-06 05:37:49,842 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=6678, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8098, PETRI_PLACES=123, PETRI_TRANSITIONS=453} [2022-12-06 05:37:49,842 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 93 predicate places. [2022-12-06 05:37:49,843 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:49,843 INFO L89 Accepts]: Start accepts. Operand has 123 places, 453 transitions, 8098 flow [2022-12-06 05:37:49,845 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:49,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:49,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 453 transitions, 8098 flow [2022-12-06 05:37:49,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 453 transitions, 8098 flow [2022-12-06 05:37:50,265 INFO L130 PetriNetUnfolder]: 1039/2439 cut-off events. [2022-12-06 05:37:50,266 INFO L131 PetriNetUnfolder]: For 35730/36463 co-relation queries the response was YES. [2022-12-06 05:37:50,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16917 conditions, 2439 events. 1039/2439 cut-off events. For 35730/36463 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 19908 event pairs, 13 based on Foata normal form. 116/2513 useless extension candidates. Maximal degree in co-relation 16166. Up to 717 conditions per place. [2022-12-06 05:37:50,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 453 transitions, 8098 flow [2022-12-06 05:37:50,308 INFO L188 LiptonReduction]: Number of co-enabled transitions 2482 [2022-12-06 05:37:50,313 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:37:50,366 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:50,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 524 [2022-12-06 05:37:50,367 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 453 transitions, 8101 flow [2022-12-06 05:37:50,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:50,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:50,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:50,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:37:50,368 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 1 more)] === [2022-12-06 05:37:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:50,368 INFO L85 PathProgramCache]: Analyzing trace with hash -803092475, now seen corresponding path program 1 times [2022-12-06 05:37:50,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:50,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508356598] [2022-12-06 05:37:50,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:50,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:50,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:50,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:50,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508356598] [2022-12-06 05:37:50,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508356598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:50,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:50,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:37:50,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509988946] [2022-12-06 05:37:50,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:50,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:37:50,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:50,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:37:50,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:37:50,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 05:37:50,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 453 transitions, 8101 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:50,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:50,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 05:37:50,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:52,420 INFO L130 PetriNetUnfolder]: 6906/10762 cut-off events. [2022-12-06 05:37:52,421 INFO L131 PetriNetUnfolder]: For 190435/190435 co-relation queries the response was YES. [2022-12-06 05:37:52,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80687 conditions, 10762 events. 6906/10762 cut-off events. For 190435/190435 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 69657 event pairs, 834 based on Foata normal form. 66/10826 useless extension candidates. Maximal degree in co-relation 76792. Up to 7686 conditions per place. [2022-12-06 05:37:52,509 INFO L137 encePairwiseOnDemand]: 23/53 looper letters, 444 selfloop transitions, 174 changer transitions 0/618 dead transitions. [2022-12-06 05:37:52,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 618 transitions, 11928 flow [2022-12-06 05:37:52,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:37:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:37:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2022-12-06 05:37:52,511 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30660377358490565 [2022-12-06 05:37:52,511 INFO L175 Difference]: Start difference. First operand has 122 places, 453 transitions, 8101 flow. Second operand 8 states and 130 transitions. [2022-12-06 05:37:52,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 618 transitions, 11928 flow [2022-12-06 05:37:53,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 618 transitions, 11798 flow, removed 42 selfloop flow, removed 1 redundant places. [2022-12-06 05:37:53,198 INFO L231 Difference]: Finished difference. Result has 132 places, 499 transitions, 9453 flow [2022-12-06 05:37:53,198 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=7994, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9453, PETRI_PLACES=132, PETRI_TRANSITIONS=499} [2022-12-06 05:37:53,199 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 102 predicate places. [2022-12-06 05:37:53,199 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:53,199 INFO L89 Accepts]: Start accepts. Operand has 132 places, 499 transitions, 9453 flow [2022-12-06 05:37:53,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:53,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:53,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 499 transitions, 9453 flow [2022-12-06 05:37:53,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 499 transitions, 9453 flow [2022-12-06 05:37:53,432 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][327], [Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 65#thread2EXITtrue, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, 80#L53true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 137#true, 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:37:53,433 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 05:37:53,433 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:37:53,433 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:53,433 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:53,433 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][28], [Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 65#thread2EXITtrue, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 276#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 586#true, 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 68#L46-1true, Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:37:53,433 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 05:37:53,433 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:37:53,433 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:53,433 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:53,483 INFO L130 PetriNetUnfolder]: 1186/2709 cut-off events. [2022-12-06 05:37:53,484 INFO L131 PetriNetUnfolder]: For 45074/45896 co-relation queries the response was YES. [2022-12-06 05:37:53,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20219 conditions, 2709 events. 1186/2709 cut-off events. For 45074/45896 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 22087 event pairs, 18 based on Foata normal form. 137/2796 useless extension candidates. Maximal degree in co-relation 19430. Up to 796 conditions per place. [2022-12-06 05:37:53,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 499 transitions, 9453 flow [2022-12-06 05:37:53,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 2636 [2022-12-06 05:37:53,586 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [368] $Ultimate##0-->L46-1: Formula: (and (= (+ v_~L~0_111 1) v_~L~0_112) (= v_~q~0_52 (+ v_~M~0_110 v_~q~0_53)) (= v_thread1Thread1of1ForFork2_~cond~0_91 (ite (= (ite (< 0 (mod v_~N~0_215 4294967296)) 1 0) 0) 0 1)) (< 0 (mod v_~L~0_112 4294967296)) (= v_~p~0_179 (+ v_~M~0_110 v_~p~0_180)) (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_91 256) 0)) (= v_~N~0_215 (+ v_~N~0_214 1))) InVars {~M~0=v_~M~0_110, ~L~0=v_~L~0_112, ~q~0=v_~q~0_53, ~p~0=v_~p~0_180, ~N~0=v_~N~0_215} OutVars{~M~0=v_~M~0_110, ~L~0=v_~L~0_111, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_64|, ~q~0=v_~q~0_52, ~p~0=v_~p~0_179, ~N~0=v_~N~0_214, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_16|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_91} AuxVars[] AssignedVars[~L~0, thread1Thread1of1ForFork2_#t~post1, ~q~0, ~p~0, ~N~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] and [349] L83-->L53: Formula: (and (= v_thread1Thread1of1ForFork2_~cond~0_59 (ite (= (ite (< 0 (mod v_~N~0_149 4294967296)) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork1_#res.offset_33| 0) (= |v_thread3Thread1of1ForFork1_#res.base_33| 0) (not (< 0 (mod v_~L~0_79 4294967296)))) InVars {~L~0=v_~L~0_79, ~N~0=v_~N~0_149} OutVars{~L~0=v_~L~0_79, thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_33|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_33|, ~N~0=v_~N~0_149, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:37:53,703 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [368] $Ultimate##0-->L46-1: Formula: (and (= (+ v_~L~0_111 1) v_~L~0_112) (= v_~q~0_52 (+ v_~M~0_110 v_~q~0_53)) (= v_thread1Thread1of1ForFork2_~cond~0_91 (ite (= (ite (< 0 (mod v_~N~0_215 4294967296)) 1 0) 0) 0 1)) (< 0 (mod v_~L~0_112 4294967296)) (= v_~p~0_179 (+ v_~M~0_110 v_~p~0_180)) (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_91 256) 0)) (= v_~N~0_215 (+ v_~N~0_214 1))) InVars {~M~0=v_~M~0_110, ~L~0=v_~L~0_112, ~q~0=v_~q~0_53, ~p~0=v_~p~0_180, ~N~0=v_~N~0_215} OutVars{~M~0=v_~M~0_110, ~L~0=v_~L~0_111, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_64|, ~q~0=v_~q~0_52, ~p~0=v_~p~0_179, ~N~0=v_~N~0_214, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_16|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_91} AuxVars[] AssignedVars[~L~0, thread1Thread1of1ForFork2_#t~post1, ~q~0, ~p~0, ~N~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:37:53,766 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:53,767 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 568 [2022-12-06 05:37:53,779 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 499 transitions, 9469 flow [2022-12-06 05:37:53,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:53,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:53,779 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:53,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 05:37:53,780 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 1 more)] === [2022-12-06 05:37:53,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:53,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1927942813, now seen corresponding path program 3 times [2022-12-06 05:37:53,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:53,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054499837] [2022-12-06 05:37:53,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:53,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:53,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:53,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054499837] [2022-12-06 05:37:53,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054499837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:53,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:53,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:53,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571708512] [2022-12-06 05:37:53,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:53,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:53,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:53,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:53,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:53,941 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 05:37:53,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 499 transitions, 9469 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:53,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:53,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 05:37:53,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:56,064 INFO L130 PetriNetUnfolder]: 6770/10520 cut-off events. [2022-12-06 05:37:56,064 INFO L131 PetriNetUnfolder]: For 195490/195490 co-relation queries the response was YES. [2022-12-06 05:37:56,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81775 conditions, 10520 events. 6770/10520 cut-off events. For 195490/195490 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 67300 event pairs, 711 based on Foata normal form. 68/10586 useless extension candidates. Maximal degree in co-relation 77555. Up to 4305 conditions per place. [2022-12-06 05:37:56,137 INFO L137 encePairwiseOnDemand]: 16/55 looper letters, 538 selfloop transitions, 147 changer transitions 2/687 dead transitions. [2022-12-06 05:37:56,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 687 transitions, 13398 flow [2022-12-06 05:37:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:37:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:37:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2022-12-06 05:37:56,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35909090909090907 [2022-12-06 05:37:56,139 INFO L175 Difference]: Start difference. First operand has 132 places, 499 transitions, 9469 flow. Second operand 8 states and 158 transitions. [2022-12-06 05:37:56,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 687 transitions, 13398 flow [2022-12-06 05:37:56,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 687 transitions, 13266 flow, removed 33 selfloop flow, removed 2 redundant places. [2022-12-06 05:37:56,937 INFO L231 Difference]: Finished difference. Result has 138 places, 495 transitions, 9658 flow [2022-12-06 05:37:56,938 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=9226, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9658, PETRI_PLACES=138, PETRI_TRANSITIONS=495} [2022-12-06 05:37:56,938 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 108 predicate places. [2022-12-06 05:37:56,939 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:56,939 INFO L89 Accepts]: Start accepts. Operand has 138 places, 495 transitions, 9658 flow [2022-12-06 05:37:56,941 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:56,941 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:56,941 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 495 transitions, 9658 flow [2022-12-06 05:37:56,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 495 transitions, 9658 flow [2022-12-06 05:37:57,266 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][177], [Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 80#L53true, 586#true, 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 63#L99-4true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 159#true, Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:37:57,267 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:37:57,267 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:57,267 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:57,267 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:57,267 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][26], [Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 6#L72true, 586#true, 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, 137#true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 68#L46-1true, Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:37:57,268 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:37:57,268 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:57,268 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:57,268 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:57,268 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][110], [Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 26#thread3EXITtrue, 80#L53true, 6#L72true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 63#L99-4true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:37:57,268 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:37:57,268 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:37:57,268 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:57,268 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:37:57,296 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][82], [Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, 586#true, 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 63#L99-4true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:37:57,296 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 05:37:57,296 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:57,296 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:37:57,296 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:37:57,352 INFO L130 PetriNetUnfolder]: 1159/2641 cut-off events. [2022-12-06 05:37:57,352 INFO L131 PetriNetUnfolder]: For 46205/47055 co-relation queries the response was YES. [2022-12-06 05:37:57,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20019 conditions, 2641 events. 1159/2641 cut-off events. For 46205/47055 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 21495 event pairs, 15 based on Foata normal form. 126/2716 useless extension candidates. Maximal degree in co-relation 19260. Up to 782 conditions per place. [2022-12-06 05:37:57,400 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 495 transitions, 9658 flow [2022-12-06 05:37:57,400 INFO L188 LiptonReduction]: Number of co-enabled transitions 2604 [2022-12-06 05:37:57,404 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:57,405 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 466 [2022-12-06 05:37:57,405 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 495 transitions, 9658 flow [2022-12-06 05:37:57,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:57,405 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:57,406 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:57,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 05:37:57,406 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 1 more)] === [2022-12-06 05:37:57,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:57,406 INFO L85 PathProgramCache]: Analyzing trace with hash 19215245, now seen corresponding path program 1 times [2022-12-06 05:37:57,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:57,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445744808] [2022-12-06 05:37:57,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:57,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:57,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:57,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445744808] [2022-12-06 05:37:57,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445744808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:57,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:57,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:57,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092835086] [2022-12-06 05:37:57,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:57,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:57,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:57,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:57,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:57,602 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 05:37:57,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 495 transitions, 9658 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:57,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:57,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 05:37:57,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:59,959 INFO L130 PetriNetUnfolder]: 7725/12243 cut-off events. [2022-12-06 05:37:59,959 INFO L131 PetriNetUnfolder]: For 243456/243456 co-relation queries the response was YES. [2022-12-06 05:38:00,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95702 conditions, 12243 events. 7725/12243 cut-off events. For 243456/243456 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 81951 event pairs, 701 based on Foata normal form. 80/12321 useless extension candidates. Maximal degree in co-relation 91419. Up to 7160 conditions per place. [2022-12-06 05:38:00,074 INFO L137 encePairwiseOnDemand]: 27/55 looper letters, 435 selfloop transitions, 220 changer transitions 4/659 dead transitions. [2022-12-06 05:38:00,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 659 transitions, 13207 flow [2022-12-06 05:38:00,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:38:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:38:00,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2022-12-06 05:38:00,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35454545454545455 [2022-12-06 05:38:00,077 INFO L175 Difference]: Start difference. First operand has 138 places, 495 transitions, 9658 flow. Second operand 8 states and 156 transitions. [2022-12-06 05:38:00,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 659 transitions, 13207 flow [2022-12-06 05:38:01,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 659 transitions, 13052 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-06 05:38:01,035 INFO L231 Difference]: Finished difference. Result has 148 places, 568 transitions, 11925 flow [2022-12-06 05:38:01,035 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=9244, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11925, PETRI_PLACES=148, PETRI_TRANSITIONS=568} [2022-12-06 05:38:01,036 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 118 predicate places. [2022-12-06 05:38:01,036 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:01,036 INFO L89 Accepts]: Start accepts. Operand has 148 places, 568 transitions, 11925 flow [2022-12-06 05:38:01,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:01,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:01,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 568 transitions, 11925 flow [2022-12-06 05:38:01,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 568 transitions, 11925 flow [2022-12-06 05:38:01,447 INFO L130 PetriNetUnfolder]: 1299/3092 cut-off events. [2022-12-06 05:38:01,447 INFO L131 PetriNetUnfolder]: For 59272/59985 co-relation queries the response was YES. [2022-12-06 05:38:01,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24343 conditions, 3092 events. 1299/3092 cut-off events. For 59272/59985 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 26266 event pairs, 19 based on Foata normal form. 138/3178 useless extension candidates. Maximal degree in co-relation 23462. Up to 895 conditions per place. [2022-12-06 05:38:01,505 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 568 transitions, 11925 flow [2022-12-06 05:38:01,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 2978 [2022-12-06 05:38:01,507 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [248] $Ultimate##0-->L72: Formula: (= v_thread2Thread1of1ForFork0_~cond~1_1 (ite (= (ite (< 1 (mod v_~N~0_10 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_10} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_1, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] [2022-12-06 05:38:01,629 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:38:01,630 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 594 [2022-12-06 05:38:01,630 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 568 transitions, 11945 flow [2022-12-06 05:38:01,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:01,630 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:01,630 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:01,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 05:38:01,631 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 1 more)] === [2022-12-06 05:38:01,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:01,631 INFO L85 PathProgramCache]: Analyzing trace with hash -141597587, now seen corresponding path program 1 times [2022-12-06 05:38:01,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:01,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439381543] [2022-12-06 05:38:01,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:01,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:01,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:01,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439381543] [2022-12-06 05:38:01,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439381543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:01,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:01,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:38:01,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583240136] [2022-12-06 05:38:01,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:01,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:38:01,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:01,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:38:01,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:38:01,834 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 05:38:01,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 568 transitions, 11945 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:01,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:01,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 05:38:01,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:05,083 INFO L130 PetriNetUnfolder]: 8000/12658 cut-off events. [2022-12-06 05:38:05,083 INFO L131 PetriNetUnfolder]: For 298663/298663 co-relation queries the response was YES. [2022-12-06 05:38:05,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105895 conditions, 12658 events. 8000/12658 cut-off events. For 298663/298663 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 85109 event pairs, 1071 based on Foata normal form. 184/12840 useless extension candidates. Maximal degree in co-relation 103495. Up to 9148 conditions per place. [2022-12-06 05:38:05,250 INFO L137 encePairwiseOnDemand]: 32/55 looper letters, 535 selfloop transitions, 77 changer transitions 3/615 dead transitions. [2022-12-06 05:38:05,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 615 transitions, 13649 flow [2022-12-06 05:38:05,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:38:05,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:38:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-06 05:38:05,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3563636363636364 [2022-12-06 05:38:05,252 INFO L175 Difference]: Start difference. First operand has 148 places, 568 transitions, 11945 flow. Second operand 5 states and 98 transitions. [2022-12-06 05:38:05,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 615 transitions, 13649 flow [2022-12-06 05:38:06,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 615 transitions, 13481 flow, removed 84 selfloop flow, removed 0 redundant places. [2022-12-06 05:38:06,879 INFO L231 Difference]: Finished difference. Result has 153 places, 557 transitions, 11756 flow [2022-12-06 05:38:06,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=11442, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11756, PETRI_PLACES=153, PETRI_TRANSITIONS=557} [2022-12-06 05:38:06,880 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 123 predicate places. [2022-12-06 05:38:06,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:06,880 INFO L89 Accepts]: Start accepts. Operand has 153 places, 557 transitions, 11756 flow [2022-12-06 05:38:06,881 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:06,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:06,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 557 transitions, 11756 flow [2022-12-06 05:38:06,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 557 transitions, 11756 flow [2022-12-06 05:38:07,399 INFO L130 PetriNetUnfolder]: 1340/3194 cut-off events. [2022-12-06 05:38:07,399 INFO L131 PetriNetUnfolder]: For 61344/62050 co-relation queries the response was YES. [2022-12-06 05:38:07,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25141 conditions, 3194 events. 1340/3194 cut-off events. For 61344/62050 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 27441 event pairs, 27 based on Foata normal form. 118/3254 useless extension candidates. Maximal degree in co-relation 24402. Up to 923 conditions per place. [2022-12-06 05:38:07,455 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 557 transitions, 11756 flow [2022-12-06 05:38:07,455 INFO L188 LiptonReduction]: Number of co-enabled transitions 2960 [2022-12-06 05:38:07,460 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:07,461 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 581 [2022-12-06 05:38:07,461 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 557 transitions, 11756 flow [2022-12-06 05:38:07,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:07,461 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:07,461 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:07,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 05:38:07,461 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 1 more)] === [2022-12-06 05:38:07,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:07,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1335490921, now seen corresponding path program 1 times [2022-12-06 05:38:07,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:07,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677180531] [2022-12-06 05:38:07,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:07,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:07,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:07,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677180531] [2022-12-06 05:38:07,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677180531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:07,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:07,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:38:07,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153124222] [2022-12-06 05:38:07,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:07,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:38:07,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:07,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:38:07,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:38:07,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 05:38:07,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 557 transitions, 11756 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:07,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:07,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 05:38:07,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:10,610 INFO L130 PetriNetUnfolder]: 8145/12843 cut-off events. [2022-12-06 05:38:10,610 INFO L131 PetriNetUnfolder]: For 323870/323870 co-relation queries the response was YES. [2022-12-06 05:38:10,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109048 conditions, 12843 events. 8145/12843 cut-off events. For 323870/323870 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 85920 event pairs, 956 based on Foata normal form. 208/13049 useless extension candidates. Maximal degree in co-relation 106348. Up to 5463 conditions per place. [2022-12-06 05:38:10,862 INFO L137 encePairwiseOnDemand]: 16/55 looper letters, 583 selfloop transitions, 225 changer transitions 12/820 dead transitions. [2022-12-06 05:38:10,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 820 transitions, 18232 flow [2022-12-06 05:38:10,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:38:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:38:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2022-12-06 05:38:10,863 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27090909090909093 [2022-12-06 05:38:10,863 INFO L175 Difference]: Start difference. First operand has 153 places, 557 transitions, 11756 flow. Second operand 10 states and 149 transitions. [2022-12-06 05:38:10,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 820 transitions, 18232 flow [2022-12-06 05:38:12,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 820 transitions, 18096 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 05:38:12,149 INFO L231 Difference]: Finished difference. Result has 166 places, 623 transitions, 14333 flow [2022-12-06 05:38:12,149 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=11487, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14333, PETRI_PLACES=166, PETRI_TRANSITIONS=623} [2022-12-06 05:38:12,149 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 136 predicate places. [2022-12-06 05:38:12,149 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:12,150 INFO L89 Accepts]: Start accepts. Operand has 166 places, 623 transitions, 14333 flow [2022-12-06 05:38:12,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:12,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:12,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 623 transitions, 14333 flow [2022-12-06 05:38:12,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 623 transitions, 14333 flow [2022-12-06 05:38:12,293 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][399], [778#true, 806#true, 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 780#(= ~N~0 ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, 137#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:12,293 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:12,293 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:12,293 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:12,293 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:12,294 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][398], [778#true, 806#true, 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 6#L72true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 752#true, 68#L46-1true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:12,294 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:12,294 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:12,294 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:12,294 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:12,294 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][159], [139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 778#true, Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 6#L72true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 806#true, Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 63#L99-4true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:12,294 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:12,294 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:12,294 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:12,294 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:12,316 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][489], [778#true, 715#true, 806#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:12,316 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:12,316 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:12,316 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:12,316 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:38:12,680 INFO L130 PetriNetUnfolder]: 1418/3281 cut-off events. [2022-12-06 05:38:12,680 INFO L131 PetriNetUnfolder]: For 87453/88481 co-relation queries the response was YES. [2022-12-06 05:38:12,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28393 conditions, 3281 events. 1418/3281 cut-off events. For 87453/88481 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 27652 event pairs, 20 based on Foata normal form. 167/3390 useless extension candidates. Maximal degree in co-relation 27557. Up to 914 conditions per place. [2022-12-06 05:38:12,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 623 transitions, 14333 flow [2022-12-06 05:38:12,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 3210 [2022-12-06 05:38:12,736 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:12,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 588 [2022-12-06 05:38:12,737 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 623 transitions, 14333 flow [2022-12-06 05:38:12,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:12,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:12,737 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:12,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 05:38:12,737 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 1 more)] === [2022-12-06 05:38:12,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:12,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1761997621, now seen corresponding path program 2 times [2022-12-06 05:38:12,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:12,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222292567] [2022-12-06 05:38:12,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:12,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:12,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:12,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222292567] [2022-12-06 05:38:12,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222292567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:12,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:12,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:38:12,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322064021] [2022-12-06 05:38:12,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:12,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:38:12,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:12,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:38:12,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:38:12,858 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 05:38:12,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 623 transitions, 14333 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:12,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:12,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 05:38:12,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:15,895 INFO L130 PetriNetUnfolder]: 8417/13268 cut-off events. [2022-12-06 05:38:15,896 INFO L131 PetriNetUnfolder]: For 360108/360108 co-relation queries the response was YES. [2022-12-06 05:38:15,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117895 conditions, 13268 events. 8417/13268 cut-off events. For 360108/360108 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 89496 event pairs, 884 based on Foata normal form. 80/13346 useless extension candidates. Maximal degree in co-relation 113856. Up to 7684 conditions per place. [2022-12-06 05:38:16,077 INFO L137 encePairwiseOnDemand]: 18/55 looper letters, 577 selfloop transitions, 228 changer transitions 4/809 dead transitions. [2022-12-06 05:38:16,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 809 transitions, 18924 flow [2022-12-06 05:38:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:38:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:38:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-12-06 05:38:16,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29772727272727273 [2022-12-06 05:38:16,091 INFO L175 Difference]: Start difference. First operand has 164 places, 623 transitions, 14333 flow. Second operand 8 states and 131 transitions. [2022-12-06 05:38:16,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 809 transitions, 18924 flow [2022-12-06 05:38:18,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 809 transitions, 18873 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-12-06 05:38:18,562 INFO L231 Difference]: Finished difference. Result has 173 places, 636 transitions, 15281 flow [2022-12-06 05:38:18,563 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=13920, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15281, PETRI_PLACES=173, PETRI_TRANSITIONS=636} [2022-12-06 05:38:18,563 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 143 predicate places. [2022-12-06 05:38:18,563 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:18,563 INFO L89 Accepts]: Start accepts. Operand has 173 places, 636 transitions, 15281 flow [2022-12-06 05:38:18,579 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:18,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:18,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 636 transitions, 15281 flow [2022-12-06 05:38:18,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 636 transitions, 15281 flow [2022-12-06 05:38:18,822 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][386], [778#true, 806#true, 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), 42#L83true, Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:18,822 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:18,822 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:18,823 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:18,823 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:18,823 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][385], [778#true, 806#true, 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 6#L72true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), 42#L83true, Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 68#L46-1true, Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:18,823 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:18,823 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:18,823 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:18,823 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:18,824 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][213], [139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 778#true, Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 6#L72true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 806#true, Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 827#true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:18,824 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:18,824 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:18,824 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:18,824 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:18,850 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][493], [778#true, 715#true, 806#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:18,851 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:18,851 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:18,851 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:18,851 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:38:19,043 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][138], [778#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 780#(= ~N~0 ~L~0), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 806#true, Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 827#true, Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 137#true, 63#L99-4true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:19,044 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:38:19,044 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:19,044 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:38:19,044 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:19,044 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][28], [778#true, 806#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 137#true, 63#L99-4true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 752#true, 68#L46-1true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:19,044 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:38:19,044 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:19,044 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:38:19,045 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:19,045 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L65-1-->L72: Formula: (= (ite (= (ite (< 1 (mod v_~N~0_12 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_7) InVars {~N~0=v_~N~0_12} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_7, ~N~0=v_~N~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1][370], [139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 778#true, 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 715#true, 806#true, 102#true, Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), 9#thread1EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 6#L72true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:19,045 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 05:38:19,045 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:19,045 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:19,045 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:19,400 INFO L130 PetriNetUnfolder]: 1527/3520 cut-off events. [2022-12-06 05:38:19,400 INFO L131 PetriNetUnfolder]: For 100118/101309 co-relation queries the response was YES. [2022-12-06 05:38:19,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31517 conditions, 3520 events. 1527/3520 cut-off events. For 100118/101309 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 29943 event pairs, 27 based on Foata normal form. 184/3643 useless extension candidates. Maximal degree in co-relation 30502. Up to 993 conditions per place. [2022-12-06 05:38:19,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 636 transitions, 15281 flow [2022-12-06 05:38:19,474 INFO L188 LiptonReduction]: Number of co-enabled transitions 3190 [2022-12-06 05:38:19,482 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:19,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 920 [2022-12-06 05:38:19,483 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 636 transitions, 15281 flow [2022-12-06 05:38:19,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:19,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:19,483 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:19,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 05:38:19,483 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 1 more)] === [2022-12-06 05:38:19,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:19,483 INFO L85 PathProgramCache]: Analyzing trace with hash 357982343, now seen corresponding path program 1 times [2022-12-06 05:38:19,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:19,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320937208] [2022-12-06 05:38:19,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:19,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:19,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:19,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:19,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320937208] [2022-12-06 05:38:19,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320937208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:19,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:19,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:38:19,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283850742] [2022-12-06 05:38:19,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:19,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:38:19,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:19,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:38:19,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:38:19,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 05:38:19,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 636 transitions, 15281 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:19,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:19,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 05:38:19,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:22,178 INFO L130 PetriNetUnfolder]: 8427/13308 cut-off events. [2022-12-06 05:38:22,178 INFO L131 PetriNetUnfolder]: For 402216/402216 co-relation queries the response was YES. [2022-12-06 05:38:22,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122259 conditions, 13308 events. 8427/13308 cut-off events. For 402216/402216 co-relation queries the response was YES. Maximal size of possible extension queue 832. Compared 90465 event pairs, 3449 based on Foata normal form. 6/13312 useless extension candidates. Maximal degree in co-relation 118508. Up to 13257 conditions per place. [2022-12-06 05:38:22,309 INFO L137 encePairwiseOnDemand]: 51/55 looper letters, 632 selfloop transitions, 0 changer transitions 16/648 dead transitions. [2022-12-06 05:38:22,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 648 transitions, 16679 flow [2022-12-06 05:38:22,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:38:22,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:38:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-06 05:38:22,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2545454545454545 [2022-12-06 05:38:22,310 INFO L175 Difference]: Start difference. First operand has 173 places, 636 transitions, 15281 flow. Second operand 5 states and 70 transitions. [2022-12-06 05:38:22,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 648 transitions, 16679 flow [2022-12-06 05:38:24,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 648 transitions, 16589 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 05:38:24,390 INFO L231 Difference]: Finished difference. Result has 176 places, 632 transitions, 15095 flow [2022-12-06 05:38:24,390 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=15192, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15095, PETRI_PLACES=176, PETRI_TRANSITIONS=632} [2022-12-06 05:38:24,391 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 146 predicate places. [2022-12-06 05:38:24,391 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:24,391 INFO L89 Accepts]: Start accepts. Operand has 176 places, 632 transitions, 15095 flow [2022-12-06 05:38:24,393 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:24,393 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:24,394 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 632 transitions, 15095 flow [2022-12-06 05:38:24,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 632 transitions, 15095 flow [2022-12-06 05:38:24,537 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][374], [778#true, 806#true, 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 780#(= ~N~0 ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 137#true, 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 844#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 846#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 845#(<= ~N~0 (* (div ~N~0 4294967296) 4294967296)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:24,537 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:24,537 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:24,537 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:24,537 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:24,538 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][373], [778#true, 806#true, 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 6#L72true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 137#true, 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 844#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 846#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 845#(<= ~N~0 (* (div ~N~0 4294967296) 4294967296)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 68#L46-1true, Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:24,538 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:24,538 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:24,538 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:24,538 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:24,538 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][201], [139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 778#true, Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 6#L72true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 806#true, Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 827#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 844#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 846#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 845#(<= ~N~0 (* (div ~N~0 4294967296) 4294967296)), 752#true, 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:24,538 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:24,538 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:24,538 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:24,538 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:24,557 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][480], [778#true, 806#true, 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 780#(= ~N~0 ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 137#true, 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 844#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 846#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 845#(<= ~N~0 (* (div ~N~0 4294967296) 4294967296)), 752#true, Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:24,557 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:24,557 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:24,557 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:38:24,558 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:24,843 INFO L130 PetriNetUnfolder]: 1514/3504 cut-off events. [2022-12-06 05:38:24,843 INFO L131 PetriNetUnfolder]: For 98367/99446 co-relation queries the response was YES. [2022-12-06 05:38:24,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31295 conditions, 3504 events. 1514/3504 cut-off events. For 98367/99446 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 29845 event pairs, 27 based on Foata normal form. 168/3615 useless extension candidates. Maximal degree in co-relation 31053. Up to 982 conditions per place. [2022-12-06 05:38:24,894 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 632 transitions, 15095 flow [2022-12-06 05:38:24,895 INFO L188 LiptonReduction]: Number of co-enabled transitions 3182 [2022-12-06 05:38:24,897 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:24,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 506 [2022-12-06 05:38:24,897 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 632 transitions, 15095 flow [2022-12-06 05:38:24,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:24,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:24,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:24,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 05:38:24,898 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 1 more)] === [2022-12-06 05:38:24,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:24,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1627427305, now seen corresponding path program 1 times [2022-12-06 05:38:24,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:24,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108746344] [2022-12-06 05:38:24,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:24,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:25,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:25,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108746344] [2022-12-06 05:38:25,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108746344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:38:25,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:38:25,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:38:25,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057283266] [2022-12-06 05:38:25,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:38:25,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:38:25,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:25,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:38:25,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:38:25,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 05:38:25,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 632 transitions, 15095 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:25,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:25,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 05:38:25,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:28,037 INFO L130 PetriNetUnfolder]: 8498/13535 cut-off events. [2022-12-06 05:38:28,037 INFO L131 PetriNetUnfolder]: For 418095/418095 co-relation queries the response was YES. [2022-12-06 05:38:28,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123689 conditions, 13535 events. 8498/13535 cut-off events. For 418095/418095 co-relation queries the response was YES. Maximal size of possible extension queue 842. Compared 93624 event pairs, 1803 based on Foata normal form. 130/13663 useless extension candidates. Maximal degree in co-relation 122956. Up to 7519 conditions per place. [2022-12-06 05:38:28,152 INFO L137 encePairwiseOnDemand]: 33/54 looper letters, 414 selfloop transitions, 355 changer transitions 3/772 dead transitions. [2022-12-06 05:38:28,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 772 transitions, 19183 flow [2022-12-06 05:38:28,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:38:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:38:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-12-06 05:38:28,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33641975308641975 [2022-12-06 05:38:28,153 INFO L175 Difference]: Start difference. First operand has 172 places, 632 transitions, 15095 flow. Second operand 6 states and 109 transitions. [2022-12-06 05:38:28,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 772 transitions, 19183 flow [2022-12-06 05:38:29,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 772 transitions, 19038 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 05:38:29,998 INFO L231 Difference]: Finished difference. Result has 176 places, 661 transitions, 16697 flow [2022-12-06 05:38:29,998 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=14714, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=315, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=16697, PETRI_PLACES=176, PETRI_TRANSITIONS=661} [2022-12-06 05:38:29,998 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 146 predicate places. [2022-12-06 05:38:29,998 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:29,999 INFO L89 Accepts]: Start accepts. Operand has 176 places, 661 transitions, 16697 flow [2022-12-06 05:38:30,001 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:30,001 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:30,001 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 661 transitions, 16697 flow [2022-12-06 05:38:30,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 661 transitions, 16697 flow [2022-12-06 05:38:30,162 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][217], [139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), 778#true, Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 6#L72true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 806#true, Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:30,162 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:30,162 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:30,162 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:30,162 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:30,162 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][383], [778#true, 806#true, 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), 42#L83true, Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 850#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:30,163 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:30,163 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:30,163 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:30,163 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:30,163 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][382], [778#true, 806#true, 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 6#L72true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), 42#L83true, Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 137#true, 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 68#L46-1true, Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 850#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:30,163 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:30,163 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:30,163 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:30,163 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:30,185 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][501], [778#true, 715#true, 806#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 780#(= ~N~0 ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 752#true, Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 850#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:30,185 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:30,185 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:38:30,186 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:30,186 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:30,512 INFO L130 PetriNetUnfolder]: 1490/3539 cut-off events. [2022-12-06 05:38:30,512 INFO L131 PetriNetUnfolder]: For 108187/109340 co-relation queries the response was YES. [2022-12-06 05:38:30,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33146 conditions, 3539 events. 1490/3539 cut-off events. For 108187/109340 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 30671 event pairs, 22 based on Foata normal form. 179/3663 useless extension candidates. Maximal degree in co-relation 32085. Up to 954 conditions per place. [2022-12-06 05:38:30,569 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 661 transitions, 16697 flow [2022-12-06 05:38:30,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 3324 [2022-12-06 05:38:30,671 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:38:30,671 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 673 [2022-12-06 05:38:30,671 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 661 transitions, 16726 flow [2022-12-06 05:38:30,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:30,671 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:30,671 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:30,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 05:38:30,672 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 1 more)] === [2022-12-06 05:38:30,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:30,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1961339890, now seen corresponding path program 1 times [2022-12-06 05:38:30,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:30,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449097159] [2022-12-06 05:38:30,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:30,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:30,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:30,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449097159] [2022-12-06 05:38:30,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449097159] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:38:30,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675595792] [2022-12-06 05:38:30,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:30,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:38:30,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:38:30,943 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) [2022-12-06 05:38:30,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 05:38:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:31,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:38:31,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:38:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:31,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:38:32,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:32,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675595792] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:38:32,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:38:32,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 05:38:32,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734545106] [2022-12-06 05:38:32,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:38:32,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:38:32,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:32,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:38:32,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:38:32,768 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 05:38:32,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 661 transitions, 16726 flow. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:32,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:32,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 05:38:32,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:38:37,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:38:41,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:38:43,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:38:48,168 INFO L130 PetriNetUnfolder]: 10328/16657 cut-off events. [2022-12-06 05:38:48,168 INFO L131 PetriNetUnfolder]: For 571056/571056 co-relation queries the response was YES. [2022-12-06 05:38:48,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159113 conditions, 16657 events. 10328/16657 cut-off events. For 571056/571056 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 119708 event pairs, 1116 based on Foata normal form. 37/16692 useless extension candidates. Maximal degree in co-relation 154325. Up to 10199 conditions per place. [2022-12-06 05:38:48,328 INFO L137 encePairwiseOnDemand]: 15/55 looper letters, 560 selfloop transitions, 514 changer transitions 86/1160 dead transitions. [2022-12-06 05:38:48,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 1160 transitions, 28572 flow [2022-12-06 05:38:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 05:38:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 05:38:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 330 transitions. [2022-12-06 05:38:48,330 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1875 [2022-12-06 05:38:48,330 INFO L175 Difference]: Start difference. First operand has 176 places, 661 transitions, 16726 flow. Second operand 32 states and 330 transitions. [2022-12-06 05:38:48,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 1160 transitions, 28572 flow [2022-12-06 05:38:52,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 1160 transitions, 28502 flow, removed 35 selfloop flow, removed 0 redundant places. [2022-12-06 05:38:52,262 INFO L231 Difference]: Finished difference. Result has 221 places, 867 transitions, 23720 flow [2022-12-06 05:38:52,262 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=16688, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=309, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=23720, PETRI_PLACES=221, PETRI_TRANSITIONS=867} [2022-12-06 05:38:52,263 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 191 predicate places. [2022-12-06 05:38:52,263 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:38:52,263 INFO L89 Accepts]: Start accepts. Operand has 221 places, 867 transitions, 23720 flow [2022-12-06 05:38:52,266 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:38:52,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:38:52,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 867 transitions, 23720 flow [2022-12-06 05:38:52,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 212 places, 867 transitions, 23720 flow [2022-12-06 05:38:52,510 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][268], [Black: 1018#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 139#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 1024#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 778#true, Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1014#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1012#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 26#thread3EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 6#L72true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 806#true, Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 434#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:52,510 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:52,510 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:52,510 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:52,510 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:52,511 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][504], [Black: 1018#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1024#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 778#true, Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1014#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), 806#true, 715#true, Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1012#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 861#true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 42#L83true, Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, 137#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 850#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:52,511 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:52,511 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:52,511 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:52,511 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:52,511 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][511], [Black: 1018#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1024#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 778#true, Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1014#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), 806#true, 715#true, Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1012#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 6#L72true, 861#true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 42#L83true, Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, 137#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 68#L46-1true, Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 850#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:52,511 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:52,511 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:52,511 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:52,511 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:38:52,534 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][679], [Black: 1018#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1024#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), 778#true, Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1014#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), 715#true, 806#true, Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 1002#(and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296) 1)) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod ~q~0 4294967296)) (+ ~M~0 ~p~0 1)))) (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 1012#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 780#(= ~N~0 ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 861#true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), 42#L83true, Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, 137#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 711#(= ~N~0 ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 752#true, Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 850#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:38:52,534 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 05:38:52,534 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:38:52,534 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:38:52,534 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:38:52,981 INFO L130 PetriNetUnfolder]: 1736/4154 cut-off events. [2022-12-06 05:38:52,981 INFO L131 PetriNetUnfolder]: For 148982/150395 co-relation queries the response was YES. [2022-12-06 05:38:53,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41876 conditions, 4154 events. 1736/4154 cut-off events. For 148982/150395 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 37139 event pairs, 12 based on Foata normal form. 194/4291 useless extension candidates. Maximal degree in co-relation 41084. Up to 1198 conditions per place. [2022-12-06 05:38:53,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 212 places, 867 transitions, 23720 flow [2022-12-06 05:38:53,056 INFO L188 LiptonReduction]: Number of co-enabled transitions 4082 [2022-12-06 05:38:53,059 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:38:53,059 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 796 [2022-12-06 05:38:53,060 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 867 transitions, 23720 flow [2022-12-06 05:38:53,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:53,060 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:38:53,060 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:38:53,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 05:38:53,265 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,SelfDestructingSolverStorable24 [2022-12-06 05:38:53,265 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 1 more)] === [2022-12-06 05:38:53,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:38:53,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1472657793, now seen corresponding path program 1 times [2022-12-06 05:38:53,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:38:53,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80552695] [2022-12-06 05:38:53,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:53,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:38:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:53,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:38:53,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80552695] [2022-12-06 05:38:53,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80552695] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:38:53,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111477006] [2022-12-06 05:38:53,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:38:53,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:38:53,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:38:53,486 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) [2022-12-06 05:38:53,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 05:38:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:38:53,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:38:53,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:38:53,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:53,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:38:54,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:38:54,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111477006] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:38:54,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:38:54,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 05:38:54,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855571006] [2022-12-06 05:38:54,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:38:54,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:38:54,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:38:54,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:38:54,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:38:54,210 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 05:38:54,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 867 transitions, 23720 flow. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:38:54,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:38:54,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 05:38:54,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:02,155 INFO L130 PetriNetUnfolder]: 11417/18199 cut-off events. [2022-12-06 05:39:02,155 INFO L131 PetriNetUnfolder]: For 735362/735362 co-relation queries the response was YES. [2022-12-06 05:39:02,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188087 conditions, 18199 events. 11417/18199 cut-off events. For 735362/735362 co-relation queries the response was YES. Maximal size of possible extension queue 1023. Compared 129146 event pairs, 1148 based on Foata normal form. 20/18217 useless extension candidates. Maximal degree in co-relation 187096. Up to 8015 conditions per place. [2022-12-06 05:39:02,353 INFO L137 encePairwiseOnDemand]: 15/54 looper letters, 793 selfloop transitions, 406 changer transitions 22/1221 dead transitions. [2022-12-06 05:39:02,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 1221 transitions, 33740 flow [2022-12-06 05:39:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:39:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:39:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 226 transitions. [2022-12-06 05:39:02,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24618736383442266 [2022-12-06 05:39:02,355 INFO L175 Difference]: Start difference. First operand has 212 places, 867 transitions, 23720 flow. Second operand 17 states and 226 transitions. [2022-12-06 05:39:02,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 1221 transitions, 33740 flow [2022-12-06 05:39:06,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 1221 transitions, 31923 flow, removed 873 selfloop flow, removed 9 redundant places. [2022-12-06 05:39:06,993 INFO L231 Difference]: Finished difference. Result has 226 places, 1026 transitions, 27762 flow [2022-12-06 05:39:06,993 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=21917, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=867, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=274, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=27762, PETRI_PLACES=226, PETRI_TRANSITIONS=1026} [2022-12-06 05:39:06,993 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 196 predicate places. [2022-12-06 05:39:06,994 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:06,994 INFO L89 Accepts]: Start accepts. Operand has 226 places, 1026 transitions, 27762 flow [2022-12-06 05:39:06,997 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:06,997 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:06,997 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 1026 transitions, 27762 flow [2022-12-06 05:39:07,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 1026 transitions, 27762 flow [2022-12-06 05:39:07,501 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][33], [Black: 1018#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 778#true, Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), 806#true, Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), 102#true, Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 780#(= ~N~0 ~L~0), Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1166#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 1084#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1174#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1178#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1172#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1170#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1168#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 861#true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 240#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 137#true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 68#L46-1true, Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 850#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, 1039#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:39:07,501 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:39:07,501 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:39:07,501 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:39:07,501 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:39:07,502 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L83-->thread3EXIT: Formula: (and (not (< 0 (mod v_~L~0_In_6 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~L~0=v_~L~0_In_6} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~L~0=v_~L~0_In_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][166], [Black: 1018#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 778#true, Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 1166#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 1084#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1174#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1178#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1172#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1170#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1168#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), 26#thread3EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 80#L53true, 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 772#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 806#true, Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, 107#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 63#L99-4true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), 287#true, Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 460#true, 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 1164#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (or (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))]) [2022-12-06 05:39:07,502 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:39:07,502 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 05:39:07,502 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:39:07,502 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 05:39:07,545 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][721], [Black: 1018#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 778#true, Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), 806#true, 715#true, Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1166#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 1084#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1174#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1178#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1172#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1170#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), 9#thread1EXITtrue, Black: 1168#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 861#true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 63#L99-4true, 137#true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 850#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 1039#true, 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:39:07,545 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:39:07,545 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:39:07,545 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:39:07,545 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:39:07,546 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][280], [Black: 1018#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 778#true, Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), 806#true, Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), 102#true, Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 780#(= ~N~0 ~L~0), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 1166#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 1084#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1174#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1178#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1172#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1170#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), 9#thread1EXITtrue, Black: 1168#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 861#true, 586#true, Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 819#(and (= ~N~0 ~L~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 0)), 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), 42#L83true, Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 137#true, 63#L99-4true, Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 752#true, Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 287#true, Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 850#true, Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 159#true, Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 104#(= ~N~0 ~L~0), 1039#true, 460#true, 827#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:39:07,546 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:39:07,546 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:39:07,546 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:39:07,546 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:39:07,905 INFO L130 PetriNetUnfolder]: 1915/4654 cut-off events. [2022-12-06 05:39:07,905 INFO L131 PetriNetUnfolder]: For 174108/175738 co-relation queries the response was YES. [2022-12-06 05:39:07,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46214 conditions, 4654 events. 1915/4654 cut-off events. For 174108/175738 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 42845 event pairs, 11 based on Foata normal form. 228/4820 useless extension candidates. Maximal degree in co-relation 45290. Up to 1343 conditions per place. [2022-12-06 05:39:07,981 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 1026 transitions, 27762 flow [2022-12-06 05:39:07,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 4854 [2022-12-06 05:39:07,983 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:39:07,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 990 [2022-12-06 05:39:07,984 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 1026 transitions, 27762 flow [2022-12-06 05:39:07,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:07,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:07,984 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:39:07,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 05:39:08,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-06 05:39:08,189 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 1 more)] === [2022-12-06 05:39:08,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:08,191 INFO L85 PathProgramCache]: Analyzing trace with hash 129654173, now seen corresponding path program 2 times [2022-12-06 05:39:08,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:08,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448901103] [2022-12-06 05:39:08,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:08,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:08,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:39:08,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:08,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448901103] [2022-12-06 05:39:08,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448901103] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:39:08,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395939142] [2022-12-06 05:39:08,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:39:08,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:39:08,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:39:08,329 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) [2022-12-06 05:39:08,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 05:39:08,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:39:08,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:39:08,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 05:39:08,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:39:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:39:08,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:39:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:39:08,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395939142] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 05:39:08,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 05:39:08,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2022-12-06 05:39:08,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365463681] [2022-12-06 05:39:08,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:08,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:39:08,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:08,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:39:08,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:39:08,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 05:39:08,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 1026 transitions, 27762 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:08,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:08,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 05:39:08,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:15,449 INFO L130 PetriNetUnfolder]: 12973/20560 cut-off events. [2022-12-06 05:39:15,449 INFO L131 PetriNetUnfolder]: For 919397/919397 co-relation queries the response was YES. [2022-12-06 05:39:15,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213494 conditions, 20560 events. 12973/20560 cut-off events. For 919397/919397 co-relation queries the response was YES. Maximal size of possible extension queue 1139. Compared 148237 event pairs, 1415 based on Foata normal form. 66/20624 useless extension candidates. Maximal degree in co-relation 211083. Up to 7650 conditions per place. [2022-12-06 05:39:15,675 INFO L137 encePairwiseOnDemand]: 15/52 looper letters, 578 selfloop transitions, 888 changer transitions 0/1466 dead transitions. [2022-12-06 05:39:15,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 1466 transitions, 41016 flow [2022-12-06 05:39:15,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:39:15,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:39:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 202 transitions. [2022-12-06 05:39:15,678 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2988165680473373 [2022-12-06 05:39:15,678 INFO L175 Difference]: Start difference. First operand has 225 places, 1026 transitions, 27762 flow. Second operand 13 states and 202 transitions. [2022-12-06 05:39:15,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 1466 transitions, 41016 flow [2022-12-06 05:39:22,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 1466 transitions, 38524 flow, removed 875 selfloop flow, removed 6 redundant places. [2022-12-06 05:39:22,629 INFO L231 Difference]: Finished difference. Result has 240 places, 1244 transitions, 35249 flow [2022-12-06 05:39:22,629 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=25721, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1026, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=686, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=35249, PETRI_PLACES=240, PETRI_TRANSITIONS=1244} [2022-12-06 05:39:22,630 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 210 predicate places. [2022-12-06 05:39:22,630 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:22,633 INFO L89 Accepts]: Start accepts. Operand has 240 places, 1244 transitions, 35249 flow [2022-12-06 05:39:22,638 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:22,639 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:22,639 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 240 places, 1244 transitions, 35249 flow [2022-12-06 05:39:22,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 240 places, 1244 transitions, 35249 flow [2022-12-06 05:39:23,585 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][761], [Black: 1018#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 778#true, Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), 806#true, Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 1188#true, 586#true, Black: 1330#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 1320#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1328#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 1277#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1284#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 1324#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 1326#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 1288#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 42#L83true, 63#L99-4true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 104#(= ~N~0 ~L~0), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1166#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 1084#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1174#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1178#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1172#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1170#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1168#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), 861#true, Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 1039#true, 827#true, Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:39:23,585 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:39:23,585 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:39:23,585 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:39:23,585 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:39:23,958 INFO L130 PetriNetUnfolder]: 2183/5264 cut-off events. [2022-12-06 05:39:23,959 INFO L131 PetriNetUnfolder]: For 221137/222720 co-relation queries the response was YES. [2022-12-06 05:39:24,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55203 conditions, 5264 events. 2183/5264 cut-off events. For 221137/222720 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 49213 event pairs, 13 based on Foata normal form. 235/5435 useless extension candidates. Maximal degree in co-relation 54091. Up to 1538 conditions per place. [2022-12-06 05:39:24,092 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 240 places, 1244 transitions, 35249 flow [2022-12-06 05:39:24,092 INFO L188 LiptonReduction]: Number of co-enabled transitions 5680 [2022-12-06 05:39:24,096 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:39:24,097 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1467 [2022-12-06 05:39:24,097 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 1244 transitions, 35249 flow [2022-12-06 05:39:24,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:24,097 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:24,097 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:39:24,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 05:39:24,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:39:24,302 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 1 more)] === [2022-12-06 05:39:24,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:24,302 INFO L85 PathProgramCache]: Analyzing trace with hash 174758280, now seen corresponding path program 1 times [2022-12-06 05:39:24,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:24,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40421734] [2022-12-06 05:39:24,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:24,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:24,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:39:24,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:24,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40421734] [2022-12-06 05:39:24,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40421734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:39:24,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:39:24,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:39:24,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438141829] [2022-12-06 05:39:24,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:39:24,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:39:24,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:24,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:39:24,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:39:24,483 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 05:39:24,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 1244 transitions, 35249 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:24,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:24,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 05:39:24,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:32,223 INFO L130 PetriNetUnfolder]: 13552/21544 cut-off events. [2022-12-06 05:39:32,223 INFO L131 PetriNetUnfolder]: For 1011742/1011742 co-relation queries the response was YES. [2022-12-06 05:39:32,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230108 conditions, 21544 events. 13552/21544 cut-off events. For 1011742/1011742 co-relation queries the response was YES. Maximal size of possible extension queue 1247. Compared 157584 event pairs, 5355 based on Foata normal form. 24/21566 useless extension candidates. Maximal degree in co-relation 227986. Up to 20164 conditions per place. [2022-12-06 05:39:32,462 INFO L137 encePairwiseOnDemand]: 43/52 looper letters, 1321 selfloop transitions, 47 changer transitions 8/1376 dead transitions. [2022-12-06 05:39:32,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 1376 transitions, 41057 flow [2022-12-06 05:39:32,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:39:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:39:32,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-12-06 05:39:32,464 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-06 05:39:32,464 INFO L175 Difference]: Start difference. First operand has 240 places, 1244 transitions, 35249 flow. Second operand 5 states and 100 transitions. [2022-12-06 05:39:32,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 1376 transitions, 41057 flow [2022-12-06 05:39:43,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 1376 transitions, 40277 flow, removed 390 selfloop flow, removed 0 redundant places. [2022-12-06 05:39:43,035 INFO L231 Difference]: Finished difference. Result has 247 places, 1268 transitions, 35219 flow [2022-12-06 05:39:43,036 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=34515, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=35219, PETRI_PLACES=247, PETRI_TRANSITIONS=1268} [2022-12-06 05:39:43,042 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 217 predicate places. [2022-12-06 05:39:43,043 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:39:43,043 INFO L89 Accepts]: Start accepts. Operand has 247 places, 1268 transitions, 35219 flow [2022-12-06 05:39:43,053 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:39:43,053 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:39:43,053 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 1268 transitions, 35219 flow [2022-12-06 05:39:43,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 1268 transitions, 35219 flow [2022-12-06 05:39:43,959 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0][681], [Black: 1018#(and (or (and (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1))) (not (< 0 (mod ~L~0 4294967296)))) (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 778#true, Black: 1006#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1008#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), 806#true, Black: 998#(and (not (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0 1) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (not (<= (+ (div ~p~0 4294967296) 1) (div ~q~0 4294967296))) (<= (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0) (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))))), Black: 865#(and (or (and (<= (+ ~M~0 ~p~0) ~q~0) (<= ~q~0 (+ ~M~0 ~p~0))) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 957#(or (not (< 0 (mod ~L~0 4294967296))) (and (or (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (or (not (< 0 (mod ~N~0 4294967296))) (and (< (+ ~M~0 ~p~0) (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* (div (+ ~M~0 ~p~0) 4294967296) 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~M~0 ~p~0 1)))))), Black: 986#(and (<= (+ ~M~0 ~p~0) ~q~0) (= thread1Thread1of1ForFork2_~cond~0 1) (<= ~q~0 (+ ~M~0 ~p~0)) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 771#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 102#true, Black: 899#(and (= ~M~0 ~p~0) (< 0 (mod ~N~0 4294967296)) (= (* 2 ~M~0) ~q~0)), Black: 903#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1000#(and (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296)) (and (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) 1 (mod (+ ~M~0 ~q~0) 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod (+ ~M~0 ~q~0) 4294967296)) (+ ~p~0 1)))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 781#(and (<= ~N~0 ~L~0) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 791#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 253#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 789#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), Black: 162#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 787#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 780#(= ~N~0 ~L~0), Black: 785#(and (<= ~N~0 ~L~0) (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (not (<= (+ (div ~N~0 4294967296) 1) (div ~L~0 4294967296)))), Black: 197#(= thread1Thread1of1ForFork2_~cond~0 1), 9#thread1EXITtrue, Black: 802#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 1188#true, 586#true, Black: 1330#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), Black: 1320#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 811#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 809#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1328#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))))), 291#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 817#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1277#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 813#(and (or (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (* (div ~N~0 4294967296) 4294967296) ~L~0) (<= ~L~0 (* (div ~N~0 4294967296) 4294967296)))) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 1284#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296)))), Black: 1324#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (<= (+ (* (div (+ (- 1) ~N~0) 4294967296) 4294967296) 2) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296))))), Black: 810#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 1326#(and (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 1288#(or (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (not (< 0 (mod ~L~0 4294967296))) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))), Black: 463#(and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)), Black: 498#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), 42#L83true, 1340#true, Black: 1346#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1349#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 63#L99-4true, Black: 832#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 580#(= ~L~0 (+ 2 ~N~0)), Black: 1342#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 831#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 852#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 752#true, Black: 856#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 853#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 100#(and (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (= ~q~0 0)), 151#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 104#(= ~N~0 ~L~0), 460#true, Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 122#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 715#true, Black: 134#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 140#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 739#true, 48#L65-1true, Black: 147#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1166#(and (<= (+ ~M~0 ~q~0) ~p~0) (= ~M~0 ~q~0) (or (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (<= ~p~0 (+ ~M~0 ~q~0))), Black: 1084#(and (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1174#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (= (mod ~p~0 2) 0)), Black: 1178#(and (or (< 0 (mod (+ 4294967295 ~N~0) 4294967296)) (not (< 0 (mod (+ 4294967295 ~L~0) 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1172#(and (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1170#(and (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 (* (div ~p~0 2) 2)) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (= (mod ~p~0 2) 0)), Black: 1168#(and (<= ~p~0 ~q~0) (or (not (< 0 (mod ~L~0 4294967296))) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (not (<= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296)) 1) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)))), 861#true, Black: 289#(or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)), Black: 418#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 407#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 677#(or (not (< 0 (mod ~L~0 4294967296))) (and (< 0 (mod ~N~0 4294967296)) (< (+ (* (div (+ (* (- 1) ~p~0) 4294967295 ~q~0) 4294967296) 4294967296) ~p~0) (+ ~q~0 1)))), Black: 387#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 705#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0)), Black: 624#(and (<= ~q~0 ~p~0) (<= ~p~0 ~q~0)), Black: 432#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 420#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 137#true, Black: 712#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 412#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (= thread2Thread1of1ForFork0_~cond~1 0) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 722#(and (= ~N~0 ~L~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 718#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 720#(<= ~L~0 (* 4294967296 (div ~L~0 4294967296))), Black: 726#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), Black: 728#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), 159#true, Black: 744#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 743#(or (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 742#(or (<= ~L~0 (+ (* (div (+ (- 1) ~L~0) 4294967296) 4294967296) 1)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), 1039#true, 827#true, Black: 757#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 758#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 756#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 762#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2022-12-06 05:39:43,960 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:39:43,960 INFO L385 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2022-12-06 05:39:43,960 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:39:43,960 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 05:39:44,276 INFO L130 PetriNetUnfolder]: 2299/5538 cut-off events. [2022-12-06 05:39:44,276 INFO L131 PetriNetUnfolder]: For 232461/234249 co-relation queries the response was YES. [2022-12-06 05:39:44,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58035 conditions, 5538 events. 2299/5538 cut-off events. For 232461/234249 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 52198 event pairs, 19 based on Foata normal form. 260/5730 useless extension candidates. Maximal degree in co-relation 56870. Up to 1558 conditions per place. [2022-12-06 05:39:44,374 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 1268 transitions, 35219 flow [2022-12-06 05:39:44,375 INFO L188 LiptonReduction]: Number of co-enabled transitions 5834 [2022-12-06 05:39:44,377 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:39:44,378 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1335 [2022-12-06 05:39:44,378 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 1268 transitions, 35219 flow [2022-12-06 05:39:44,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:44,378 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:39:44,378 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:39:44,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 05:39:44,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 1 more)] === [2022-12-06 05:39:44,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:39:44,378 INFO L85 PathProgramCache]: Analyzing trace with hash 718506249, now seen corresponding path program 1 times [2022-12-06 05:39:44,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:39:44,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061082715] [2022-12-06 05:39:44,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:44,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:39:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:44,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:39:44,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:39:44,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061082715] [2022-12-06 05:39:44,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061082715] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:39:44,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240238674] [2022-12-06 05:39:44,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:39:44,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:39:44,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:39:44,443 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) [2022-12-06 05:39:44,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 05:39:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:39:44,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 05:39:44,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:39:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:39:44,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:39:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:39:44,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240238674] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:39:44,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:39:44,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 7] total 15 [2022-12-06 05:39:44,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478174853] [2022-12-06 05:39:44,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:39:44,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:39:44,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:39:44,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:39:44,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:39:44,768 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 05:39:44,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 1268 transitions, 35219 flow. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:39:44,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:39:44,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 05:39:44,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:39:55,542 INFO L130 PetriNetUnfolder]: 16338/25251 cut-off events. [2022-12-06 05:39:55,542 INFO L131 PetriNetUnfolder]: For 1447618/1447618 co-relation queries the response was YES. [2022-12-06 05:39:55,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287294 conditions, 25251 events. 16338/25251 cut-off events. For 1447618/1447618 co-relation queries the response was YES. Maximal size of possible extension queue 1462. Compared 179094 event pairs, 1222 based on Foata normal form. 326/25575 useless extension candidates. Maximal degree in co-relation 285148. Up to 12251 conditions per place. [2022-12-06 05:39:55,883 INFO L137 encePairwiseOnDemand]: 13/52 looper letters, 955 selfloop transitions, 1072 changer transitions 1/2028 dead transitions. [2022-12-06 05:39:55,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 2028 transitions, 58475 flow [2022-12-06 05:39:55,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 05:39:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 05:39:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 341 transitions. [2022-12-06 05:39:55,885 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24287749287749288 [2022-12-06 05:39:55,885 INFO L175 Difference]: Start difference. First operand has 247 places, 1268 transitions, 35219 flow. Second operand 27 states and 341 transitions. [2022-12-06 05:39:55,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 2028 transitions, 58475 flow [2022-12-06 05:40:09,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 2028 transitions, 58356 flow, removed 25 selfloop flow, removed 1 redundant places. [2022-12-06 05:40:09,308 INFO L231 Difference]: Finished difference. Result has 287 places, 1757 transitions, 54418 flow [2022-12-06 05:40:09,309 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=35141, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=635, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=54418, PETRI_PLACES=287, PETRI_TRANSITIONS=1757} [2022-12-06 05:40:09,312 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 257 predicate places. [2022-12-06 05:40:09,312 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:09,312 INFO L89 Accepts]: Start accepts. Operand has 287 places, 1757 transitions, 54418 flow [2022-12-06 05:40:09,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:09,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:09,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 287 places, 1757 transitions, 54418 flow [2022-12-06 05:40:09,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 287 places, 1757 transitions, 54418 flow [2022-12-06 05:40:12,160 INFO L130 PetriNetUnfolder]: 3186/6933 cut-off events. [2022-12-06 05:40:12,160 INFO L131 PetriNetUnfolder]: For 394536/395580 co-relation queries the response was YES. [2022-12-06 05:40:12,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86424 conditions, 6933 events. 3186/6933 cut-off events. For 394536/395580 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 63135 event pairs, 16 based on Foata normal form. 209/7070 useless extension candidates. Maximal degree in co-relation 85950. Up to 1793 conditions per place. [2022-12-06 05:40:12,305 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 287 places, 1757 transitions, 54418 flow [2022-12-06 05:40:12,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 7732 [2022-12-06 05:40:12,310 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:40:12,526 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:40:12,641 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:40:12,755 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:40:12,821 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [240] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_1 (ite (= 0 (ite (< 0 (mod v_~N~0_1 4294967296)) 1 0)) 0 1)) InVars {~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_1, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:40:12,855 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:40:12,982 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] L72-->L53: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_51| 0) (= (ite (= (ite (< 0 (mod v_~N~0_286 4294967296)) 1 0) 0) 0 1) v_thread1Thread1of1ForFork2_~cond~0_142) (= (mod v_thread2Thread1of1ForFork0_~cond~1_110 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_51| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_110, ~N~0=v_~N~0_286} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_51|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_51|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_110, ~N~0=v_~N~0_286, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_142} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork2_~cond~0] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:40:13,344 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:40:13,345 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4033 [2022-12-06 05:40:13,345 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 1754 transitions, 54523 flow [2022-12-06 05:40:13,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:13,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:13,345 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:13,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 05:40:13,550 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,SelfDestructingSolverStorable28 [2022-12-06 05:40:13,550 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 1 more)] === [2022-12-06 05:40:13,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:13,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1817144938, now seen corresponding path program 2 times [2022-12-06 05:40:13,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:13,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456675152] [2022-12-06 05:40:13,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:13,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:13,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:13,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456675152] [2022-12-06 05:40:13,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456675152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:40:13,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:40:13,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:40:13,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103276406] [2022-12-06 05:40:13,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:40:13,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:40:13,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:13,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:40:13,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:40:13,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:40:13,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 1754 transitions, 54523 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:13,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:13,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:40:13,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:40:26,890 INFO L130 PetriNetUnfolder]: 17003/26596 cut-off events. [2022-12-06 05:40:26,890 INFO L131 PetriNetUnfolder]: For 1588266/1588266 co-relation queries the response was YES. [2022-12-06 05:40:27,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325734 conditions, 26596 events. 17003/26596 cut-off events. For 1588266/1588266 co-relation queries the response was YES. Maximal size of possible extension queue 1544. Compared 194442 event pairs, 1591 based on Foata normal form. 10/26604 useless extension candidates. Maximal degree in co-relation 323001. Up to 11968 conditions per place. [2022-12-06 05:40:27,233 INFO L137 encePairwiseOnDemand]: 28/61 looper letters, 1223 selfloop transitions, 845 changer transitions 7/2075 dead transitions. [2022-12-06 05:40:27,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 2075 transitions, 67314 flow [2022-12-06 05:40:27,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:40:27,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:40:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 161 transitions. [2022-12-06 05:40:27,235 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2639344262295082 [2022-12-06 05:40:27,235 INFO L175 Difference]: Start difference. First operand has 284 places, 1754 transitions, 54523 flow. Second operand 10 states and 161 transitions. [2022-12-06 05:40:27,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 2075 transitions, 67314 flow [2022-12-06 05:40:51,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 2075 transitions, 63517 flow, removed 1826 selfloop flow, removed 8 redundant places. [2022-12-06 05:40:51,483 INFO L231 Difference]: Finished difference. Result has 291 places, 1928 transitions, 59896 flow [2022-12-06 05:40:51,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=51480, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1754, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=676, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=949, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=59896, PETRI_PLACES=291, PETRI_TRANSITIONS=1928} [2022-12-06 05:40:51,485 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 261 predicate places. [2022-12-06 05:40:51,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:40:51,485 INFO L89 Accepts]: Start accepts. Operand has 291 places, 1928 transitions, 59896 flow [2022-12-06 05:40:51,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:40:51,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:40:51,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 291 places, 1928 transitions, 59896 flow [2022-12-06 05:40:51,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 1928 transitions, 59896 flow [2022-12-06 05:40:53,478 INFO L130 PetriNetUnfolder]: 3257/7276 cut-off events. [2022-12-06 05:40:53,478 INFO L131 PetriNetUnfolder]: For 391052/391908 co-relation queries the response was YES. [2022-12-06 05:40:53,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85384 conditions, 7276 events. 3257/7276 cut-off events. For 391052/391908 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 68160 event pairs, 16 based on Foata normal form. 218/7415 useless extension candidates. Maximal degree in co-relation 84022. Up to 1827 conditions per place. [2022-12-06 05:40:53,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 291 places, 1928 transitions, 59896 flow [2022-12-06 05:40:53,626 INFO L188 LiptonReduction]: Number of co-enabled transitions 8382 [2022-12-06 05:40:53,630 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:40:53,631 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2146 [2022-12-06 05:40:53,631 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 1928 transitions, 59896 flow [2022-12-06 05:40:53,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:53,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:40:53,631 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:53,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 05:40:53,631 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 1 more)] === [2022-12-06 05:40:53,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:40:53,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1468629520, now seen corresponding path program 1 times [2022-12-06 05:40:53,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:40:53,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834858247] [2022-12-06 05:40:53,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:53,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:40:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:53,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:40:53,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834858247] [2022-12-06 05:40:53,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834858247] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:40:53,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195029624] [2022-12-06 05:40:53,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:40:53,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:53,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:40:53,732 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) [2022-12-06 05:40:53,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 05:40:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:40:53,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 05:40:53,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:40:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:53,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:40:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:40:53,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195029624] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:40:53,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:40:53,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 2] total 6 [2022-12-06 05:40:53,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960818826] [2022-12-06 05:40:53,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:40:53,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:40:53,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:40:53,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:40:53,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:40:53,963 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 61 [2022-12-06 05:40:53,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 1928 transitions, 59896 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:40:53,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:40:53,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 61 [2022-12-06 05:40:53,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:06,737 INFO L130 PetriNetUnfolder]: 15167/24481 cut-off events. [2022-12-06 05:41:06,737 INFO L131 PetriNetUnfolder]: For 1534648/1536028 co-relation queries the response was YES. [2022-12-06 05:41:06,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294422 conditions, 24481 events. 15167/24481 cut-off events. For 1534648/1536028 co-relation queries the response was YES. Maximal size of possible extension queue 1569. Compared 189829 event pairs, 2568 based on Foata normal form. 678/24779 useless extension candidates. Maximal degree in co-relation 291691. Up to 20626 conditions per place. [2022-12-06 05:41:07,090 INFO L137 encePairwiseOnDemand]: 34/61 looper letters, 1454 selfloop transitions, 54 changer transitions 2/1958 dead transitions. [2022-12-06 05:41:07,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 1958 transitions, 63190 flow [2022-12-06 05:41:07,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:41:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:41:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2022-12-06 05:41:07,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2903981264637002 [2022-12-06 05:41:07,091 INFO L175 Difference]: Start difference. First operand has 291 places, 1928 transitions, 59896 flow. Second operand 7 states and 124 transitions. [2022-12-06 05:41:07,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 1958 transitions, 63190 flow [2022-12-06 05:41:26,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 1958 transitions, 62533 flow, removed 100 selfloop flow, removed 1 redundant places. [2022-12-06 05:41:26,204 INFO L231 Difference]: Finished difference. Result has 298 places, 1929 transitions, 59389 flow [2022-12-06 05:41:26,205 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=59269, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1928, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1874, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=59389, PETRI_PLACES=298, PETRI_TRANSITIONS=1929} [2022-12-06 05:41:26,206 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 268 predicate places. [2022-12-06 05:41:26,206 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:26,206 INFO L89 Accepts]: Start accepts. Operand has 298 places, 1929 transitions, 59389 flow [2022-12-06 05:41:26,215 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:26,215 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:26,215 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 298 places, 1929 transitions, 59389 flow [2022-12-06 05:41:26,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 298 places, 1929 transitions, 59389 flow [2022-12-06 05:41:28,314 INFO L130 PetriNetUnfolder]: 3249/7284 cut-off events. [2022-12-06 05:41:28,314 INFO L131 PetriNetUnfolder]: For 374237/375060 co-relation queries the response was YES. [2022-12-06 05:41:28,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85141 conditions, 7284 events. 3249/7284 cut-off events. For 374237/375060 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 68522 event pairs, 16 based on Foata normal form. 233/7441 useless extension candidates. Maximal degree in co-relation 83805. Up to 1820 conditions per place. [2022-12-06 05:41:28,680 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 298 places, 1929 transitions, 59389 flow [2022-12-06 05:41:28,680 INFO L188 LiptonReduction]: Number of co-enabled transitions 8388 [2022-12-06 05:41:28,829 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:41:28,829 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2623 [2022-12-06 05:41:28,829 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 1928 transitions, 59404 flow [2022-12-06 05:41:28,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:28,830 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:28,830 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:28,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 05:41:29,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:29,035 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 1 more)] === [2022-12-06 05:41:29,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:29,035 INFO L85 PathProgramCache]: Analyzing trace with hash 489433499, now seen corresponding path program 1 times [2022-12-06 05:41:29,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:29,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909428051] [2022-12-06 05:41:29,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:29,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:29,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:29,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909428051] [2022-12-06 05:41:29,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909428051] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:29,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968024560] [2022-12-06 05:41:29,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:29,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:29,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:29,365 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) [2022-12-06 05:41:29,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 05:41:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:29,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 05:41:29,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:29,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:29,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968024560] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:29,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:29,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2022-12-06 05:41:29,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68644027] [2022-12-06 05:41:29,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:29,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:41:29,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:29,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:41:29,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:41:29,737 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 62 [2022-12-06 05:41:29,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 1928 transitions, 59404 flow. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:29,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:29,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 62 [2022-12-06 05:41:29,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:45,722 INFO L130 PetriNetUnfolder]: 15466/25025 cut-off events. [2022-12-06 05:41:45,722 INFO L131 PetriNetUnfolder]: For 1490176/1491737 co-relation queries the response was YES. [2022-12-06 05:41:45,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301105 conditions, 25025 events. 15466/25025 cut-off events. For 1490176/1491737 co-relation queries the response was YES. Maximal size of possible extension queue 1603. Compared 194015 event pairs, 2222 based on Foata normal form. 767/25458 useless extension candidates. Maximal degree in co-relation 299130. Up to 20059 conditions per place. [2022-12-06 05:41:46,065 INFO L137 encePairwiseOnDemand]: 32/62 looper letters, 1435 selfloop transitions, 149 changer transitions 11/2043 dead transitions. [2022-12-06 05:41:46,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 2043 transitions, 65083 flow [2022-12-06 05:41:46,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:41:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:41:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2022-12-06 05:41:46,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31899641577060933 [2022-12-06 05:41:46,066 INFO L175 Difference]: Start difference. First operand has 297 places, 1928 transitions, 59404 flow. Second operand 9 states and 178 transitions. [2022-12-06 05:41:46,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 2043 transitions, 65083 flow [2022-12-06 05:42:11,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 2043 transitions, 64903 flow, removed 38 selfloop flow, removed 5 redundant places. [2022-12-06 05:42:11,076 INFO L231 Difference]: Finished difference. Result has 302 places, 1962 transitions, 60815 flow [2022-12-06 05:42:11,078 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=59226, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1928, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=60815, PETRI_PLACES=302, PETRI_TRANSITIONS=1962} [2022-12-06 05:42:11,078 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 272 predicate places. [2022-12-06 05:42:11,078 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:11,078 INFO L89 Accepts]: Start accepts. Operand has 302 places, 1962 transitions, 60815 flow [2022-12-06 05:42:11,087 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:11,087 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:11,087 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 302 places, 1962 transitions, 60815 flow [2022-12-06 05:42:11,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 302 places, 1962 transitions, 60815 flow [2022-12-06 05:42:13,949 INFO L130 PetriNetUnfolder]: 3291/7434 cut-off events. [2022-12-06 05:42:13,949 INFO L131 PetriNetUnfolder]: For 385954/386856 co-relation queries the response was YES. [2022-12-06 05:42:14,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87488 conditions, 7434 events. 3291/7434 cut-off events. For 385954/386856 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 70660 event pairs, 16 based on Foata normal form. 243/7597 useless extension candidates. Maximal degree in co-relation 85851. Up to 1864 conditions per place. [2022-12-06 05:42:14,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 302 places, 1962 transitions, 60815 flow [2022-12-06 05:42:14,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 8512 [2022-12-06 05:42:14,390 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:42:14,499 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 05:42:14,592 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 05:42:14,681 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 05:42:14,772 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:42:14,868 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 05:42:14,945 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:42:15,015 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:42:15,016 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3938 [2022-12-06 05:42:15,016 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 1962 transitions, 60961 flow [2022-12-06 05:42:15,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:15,016 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:15,016 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:15,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 05:42:15,221 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,SelfDestructingSolverStorable31 [2022-12-06 05:42:15,222 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 1 more)] === [2022-12-06 05:42:15,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:15,222 INFO L85 PathProgramCache]: Analyzing trace with hash 509434413, now seen corresponding path program 1 times [2022-12-06 05:42:15,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:15,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933845633] [2022-12-06 05:42:15,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:15,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:15,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:15,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933845633] [2022-12-06 05:42:15,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933845633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:15,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:15,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:42:15,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911173474] [2022-12-06 05:42:15,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:15,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:42:15,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:15,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:42:15,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:42:15,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 05:42:15,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 1962 transitions, 60961 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:15,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:15,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 05:42:15,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:33,505 INFO L130 PetriNetUnfolder]: 18053/28287 cut-off events. [2022-12-06 05:42:33,505 INFO L131 PetriNetUnfolder]: For 1543759/1543759 co-relation queries the response was YES. [2022-12-06 05:42:33,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333783 conditions, 28287 events. 18053/28287 cut-off events. For 1543759/1543759 co-relation queries the response was YES. Maximal size of possible extension queue 1636. Compared 209213 event pairs, 2213 based on Foata normal form. 2/28287 useless extension candidates. Maximal degree in co-relation 330722. Up to 25330 conditions per place. [2022-12-06 05:42:33,936 INFO L137 encePairwiseOnDemand]: 27/69 looper letters, 1867 selfloop transitions, 334 changer transitions 4/2205 dead transitions. [2022-12-06 05:42:33,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 2205 transitions, 70295 flow [2022-12-06 05:42:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:42:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:42:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2022-12-06 05:42:33,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2608695652173913 [2022-12-06 05:42:33,938 INFO L175 Difference]: Start difference. First operand has 302 places, 1962 transitions, 60961 flow. Second operand 9 states and 162 transitions. [2022-12-06 05:42:33,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 2205 transitions, 70295 flow [2022-12-06 05:42:56,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 2205 transitions, 69813 flow, removed 219 selfloop flow, removed 3 redundant places. [2022-12-06 05:42:56,126 INFO L231 Difference]: Finished difference. Result has 310 places, 2028 transitions, 63290 flow [2022-12-06 05:42:56,127 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=60523, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=270, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=63290, PETRI_PLACES=310, PETRI_TRANSITIONS=2028} [2022-12-06 05:42:56,127 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 280 predicate places. [2022-12-06 05:42:56,127 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:56,127 INFO L89 Accepts]: Start accepts. Operand has 310 places, 2028 transitions, 63290 flow [2022-12-06 05:42:56,137 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:56,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:56,137 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 310 places, 2028 transitions, 63290 flow [2022-12-06 05:42:56,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 310 places, 2028 transitions, 63290 flow [2022-12-06 05:42:58,652 INFO L130 PetriNetUnfolder]: 3388/7674 cut-off events. [2022-12-06 05:42:58,653 INFO L131 PetriNetUnfolder]: For 404452/405388 co-relation queries the response was YES. [2022-12-06 05:42:58,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91144 conditions, 7674 events. 3388/7674 cut-off events. For 404452/405388 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 73485 event pairs, 18 based on Foata normal form. 226/7820 useless extension candidates. Maximal degree in co-relation 89513. Up to 1918 conditions per place. [2022-12-06 05:42:58,805 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 310 places, 2028 transitions, 63290 flow [2022-12-06 05:42:58,805 INFO L188 LiptonReduction]: Number of co-enabled transitions 8922 [2022-12-06 05:42:58,808 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:58,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2682 [2022-12-06 05:42:58,809 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 2028 transitions, 63290 flow [2022-12-06 05:42:58,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:58,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:58,809 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:58,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 05:42:58,809 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 1 more)] === [2022-12-06 05:42:58,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:58,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1110722, now seen corresponding path program 1 times [2022-12-06 05:42:58,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:58,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576889777] [2022-12-06 05:42:58,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:58,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:59,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:42:59,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:59,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576889777] [2022-12-06 05:42:59,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576889777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:59,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:59,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:42:59,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312250024] [2022-12-06 05:42:59,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:59,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:42:59,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:59,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:42:59,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:42:59,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 05:42:59,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 2028 transitions, 63290 flow. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:42:59,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:59,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 05:42:59,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:15,427 INFO L130 PetriNetUnfolder]: 18209/28531 cut-off events. [2022-12-06 05:43:15,432 INFO L131 PetriNetUnfolder]: For 1592659/1592659 co-relation queries the response was YES. [2022-12-06 05:43:15,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340529 conditions, 28531 events. 18209/28531 cut-off events. For 1592659/1592659 co-relation queries the response was YES. Maximal size of possible extension queue 1659. Compared 210616 event pairs, 2395 based on Foata normal form. 20/28549 useless extension candidates. Maximal degree in co-relation 337475. Up to 24789 conditions per place. [2022-12-06 05:43:15,999 INFO L137 encePairwiseOnDemand]: 44/69 looper letters, 2011 selfloop transitions, 153 changer transitions 0/2164 dead transitions. [2022-12-06 05:43:16,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 2164 transitions, 70681 flow [2022-12-06 05:43:16,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:43:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:43:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2022-12-06 05:43:16,001 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2536231884057971 [2022-12-06 05:43:16,001 INFO L175 Difference]: Start difference. First operand has 310 places, 2028 transitions, 63290 flow. Second operand 8 states and 140 transitions. [2022-12-06 05:43:16,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 2164 transitions, 70681 flow [2022-12-06 05:43:38,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 2164 transitions, 70437 flow, removed 108 selfloop flow, removed 2 redundant places. [2022-12-06 05:43:38,410 INFO L231 Difference]: Finished difference. Result has 318 places, 2060 transitions, 64566 flow [2022-12-06 05:43:38,411 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=62957, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2025, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1875, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=64566, PETRI_PLACES=318, PETRI_TRANSITIONS=2060} [2022-12-06 05:43:38,412 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 288 predicate places. [2022-12-06 05:43:38,412 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:43:38,412 INFO L89 Accepts]: Start accepts. Operand has 318 places, 2060 transitions, 64566 flow [2022-12-06 05:43:38,421 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:43:38,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:43:38,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 318 places, 2060 transitions, 64566 flow [2022-12-06 05:43:38,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 318 places, 2060 transitions, 64566 flow [2022-12-06 05:43:40,551 INFO L130 PetriNetUnfolder]: 3404/7696 cut-off events. [2022-12-06 05:43:40,551 INFO L131 PetriNetUnfolder]: For 408706/409526 co-relation queries the response was YES. [2022-12-06 05:43:40,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92322 conditions, 7696 events. 3404/7696 cut-off events. For 408706/409526 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 73579 event pairs, 18 based on Foata normal form. 174/7791 useless extension candidates. Maximal degree in co-relation 90697. Up to 1914 conditions per place. [2022-12-06 05:43:40,718 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 318 places, 2060 transitions, 64566 flow [2022-12-06 05:43:40,718 INFO L188 LiptonReduction]: Number of co-enabled transitions 9054 [2022-12-06 05:43:40,723 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:43:40,724 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2312 [2022-12-06 05:43:40,724 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 2060 transitions, 64566 flow [2022-12-06 05:43:40,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:40,724 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:43:40,724 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:43:40,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 05:43:40,724 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 1 more)] === [2022-12-06 05:43:40,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:43:40,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1231434448, now seen corresponding path program 1 times [2022-12-06 05:43:40,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:43:40,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995044731] [2022-12-06 05:43:40,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:40,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:43:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:43:41,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:43:41,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995044731] [2022-12-06 05:43:41,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995044731] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:43:41,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233491673] [2022-12-06 05:43:41,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:43:41,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:43:41,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:43:41,015 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) [2022-12-06 05:43:41,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 05:43:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:43:41,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 05:43:41,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:43:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:43:41,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:43:41,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233491673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:43:41,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:43:41,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2022-12-06 05:43:41,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421876917] [2022-12-06 05:43:41,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:43:41,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:43:41,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:43:41,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:43:41,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:43:41,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 05:43:41,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 2060 transitions, 64566 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:43:41,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:43:41,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 05:43:41,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:43:59,924 INFO L130 PetriNetUnfolder]: 18187/28497 cut-off events. [2022-12-06 05:43:59,924 INFO L131 PetriNetUnfolder]: For 1637945/1637945 co-relation queries the response was YES. [2022-12-06 05:44:00,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343409 conditions, 28497 events. 18187/28497 cut-off events. For 1637945/1637945 co-relation queries the response was YES. Maximal size of possible extension queue 1652. Compared 212568 event pairs, 3247 based on Foata normal form. 6/28501 useless extension candidates. Maximal degree in co-relation 340351. Up to 28290 conditions per place. [2022-12-06 05:44:00,442 INFO L137 encePairwiseOnDemand]: 44/69 looper letters, 2025 selfloop transitions, 49 changer transitions 8/2082 dead transitions. [2022-12-06 05:44:00,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 2082 transitions, 68845 flow [2022-12-06 05:44:00,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:44:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:44:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-06 05:44:00,444 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2927536231884058 [2022-12-06 05:44:00,444 INFO L175 Difference]: Start difference. First operand has 318 places, 2060 transitions, 64566 flow. Second operand 5 states and 101 transitions. [2022-12-06 05:44:00,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 2082 transitions, 68845 flow [2022-12-06 05:44:26,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 2082 transitions, 68691 flow, removed 58 selfloop flow, removed 3 redundant places. [2022-12-06 05:44:27,064 INFO L231 Difference]: Finished difference. Result has 319 places, 2057 transitions, 64437 flow [2022-12-06 05:44:27,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=64361, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2058, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2009, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64437, PETRI_PLACES=319, PETRI_TRANSITIONS=2057} [2022-12-06 05:44:27,067 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 289 predicate places. [2022-12-06 05:44:27,067 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:27,067 INFO L89 Accepts]: Start accepts. Operand has 319 places, 2057 transitions, 64437 flow [2022-12-06 05:44:27,084 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:27,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:27,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 319 places, 2057 transitions, 64437 flow [2022-12-06 05:44:27,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 317 places, 2057 transitions, 64437 flow [2022-12-06 05:44:30,600 INFO L130 PetriNetUnfolder]: 3414/7702 cut-off events. [2022-12-06 05:44:30,600 INFO L131 PetriNetUnfolder]: For 410608/411629 co-relation queries the response was YES. [2022-12-06 05:44:30,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92465 conditions, 7702 events. 3414/7702 cut-off events. For 410608/411629 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 73546 event pairs, 18 based on Foata normal form. 188/7809 useless extension candidates. Maximal degree in co-relation 90839. Up to 1917 conditions per place. [2022-12-06 05:44:30,932 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 317 places, 2057 transitions, 64437 flow [2022-12-06 05:44:30,932 INFO L188 LiptonReduction]: Number of co-enabled transitions 9028 [2022-12-06 05:44:30,958 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:30,959 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3892 [2022-12-06 05:44:30,959 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 2057 transitions, 64437 flow [2022-12-06 05:44:30,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:30,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:30,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:30,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-06 05:44:31,179 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,SelfDestructingSolverStorable34 [2022-12-06 05:44:31,180 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 1 more)] === [2022-12-06 05:44:31,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:31,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1410512618, now seen corresponding path program 1 times [2022-12-06 05:44:31,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:31,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442112673] [2022-12-06 05:44:31,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:31,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:31,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:31,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442112673] [2022-12-06 05:44:31,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442112673] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:31,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765186504] [2022-12-06 05:44:31,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:31,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:31,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:31,321 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) [2022-12-06 05:44:31,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 05:44:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:31,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 05:44:31,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:31,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:31,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:31,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765186504] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:31,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:31,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2022-12-06 05:44:31,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657233901] [2022-12-06 05:44:31,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:31,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:44:31,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:31,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:44:31,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:44:31,654 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-06 05:44:31,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 2057 transitions, 64437 flow. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:31,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:31,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-06 05:44:31,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:57,997 INFO L130 PetriNetUnfolder]: 22153/34900 cut-off events. [2022-12-06 05:44:57,997 INFO L131 PetriNetUnfolder]: For 2146234/2146234 co-relation queries the response was YES. [2022-12-06 05:44:58,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421987 conditions, 34900 events. 22153/34900 cut-off events. For 2146234/2146234 co-relation queries the response was YES. Maximal size of possible extension queue 2050. Compared 268506 event pairs, 872 based on Foata normal form. 12/34910 useless extension candidates. Maximal degree in co-relation 418598. Up to 9556 conditions per place. [2022-12-06 05:44:58,903 INFO L137 encePairwiseOnDemand]: 14/67 looper letters, 941 selfloop transitions, 2328 changer transitions 18/3287 dead transitions. [2022-12-06 05:44:58,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 3287 transitions, 102601 flow [2022-12-06 05:44:58,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-06 05:44:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-06 05:44:58,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 467 transitions. [2022-12-06 05:44:58,905 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1700036403349108 [2022-12-06 05:44:58,905 INFO L175 Difference]: Start difference. First operand has 317 places, 2057 transitions, 64437 flow. Second operand 41 states and 467 transitions. [2022-12-06 05:44:58,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 3287 transitions, 102601 flow [2022-12-06 05:45:33,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 3287 transitions, 102477 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 05:45:33,819 INFO L231 Difference]: Finished difference. Result has 375 places, 2907 transitions, 98950 flow [2022-12-06 05:45:33,821 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=64327, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2057, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1544, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=98950, PETRI_PLACES=375, PETRI_TRANSITIONS=2907} [2022-12-06 05:45:33,822 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 345 predicate places. [2022-12-06 05:45:33,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:33,822 INFO L89 Accepts]: Start accepts. Operand has 375 places, 2907 transitions, 98950 flow [2022-12-06 05:45:33,845 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:33,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:33,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 2907 transitions, 98950 flow [2022-12-06 05:45:33,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 375 places, 2907 transitions, 98950 flow [2022-12-06 05:45:40,773 INFO L130 PetriNetUnfolder]: 4893/10773 cut-off events. [2022-12-06 05:45:40,773 INFO L131 PetriNetUnfolder]: For 746491/747412 co-relation queries the response was YES. [2022-12-06 05:45:40,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147440 conditions, 10773 events. 4893/10773 cut-off events. For 746491/747412 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 106712 event pairs, 15 based on Foata normal form. 61/10685 useless extension candidates. Maximal degree in co-relation 146970. Up to 2626 conditions per place. [2022-12-06 05:45:41,099 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 2907 transitions, 98950 flow [2022-12-06 05:45:41,099 INFO L188 LiptonReduction]: Number of co-enabled transitions 11510 [2022-12-06 05:45:41,103 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L72-->L83: Formula: (and (= (+ v_~N~0_296 1) v_~N~0_297) (= (mod v_thread2Thread1of1ForFork0_~cond~1_118 256) 0) (= v_~p~0_237 (+ v_~M~0_154 v_~p~0_238)) (= v_~q~0_125 (+ v_~M~0_154 v_~q~0_126)) (= |v_thread2Thread1of1ForFork0_#res.offset_59| 0) (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_150 256) 0)) (= |v_thread2Thread1of1ForFork0_#res.base_59| 0) (= (+ v_~L~0_188 1) v_~L~0_189) (= (ite (= (ite (< 0 (mod v_~N~0_297 4294967296)) 1 0) 0) 0 1) v_thread1Thread1of1ForFork2_~cond~0_150) (< 0 (mod v_~L~0_189 4294967296))) InVars {~M~0=v_~M~0_154, ~L~0=v_~L~0_189, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_118, ~q~0=v_~q~0_126, ~p~0=v_~p~0_238, ~N~0=v_~N~0_297} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_59|, ~M~0=v_~M~0_154, ~L~0=v_~L~0_188, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_59|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_118, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_117|, ~q~0=v_~q~0_125, ~p~0=v_~p~0_237, ~N~0=v_~N~0_296, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_59|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_150} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, ~L~0, thread2Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork2_#t~post1, ~q~0, ~p~0, ~N~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] and [246] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_7 (ite (= (ite (< 0 (mod v_~N~0_6 4294967296)) 1 0) 0) 0 1)) InVars {~N~0=v_~N~0_6} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_7, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:45:41,356 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L53-->thread1EXIT: Formula: (and (= (mod v_thread1Thread1of1ForFork2_~cond~0_In_1 256) 0) (= |v_thread1Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_In_1} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_Out_4|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_Out_4|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:45:41,398 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L53-->thread1EXIT: Formula: (and (= (mod v_thread1Thread1of1ForFork2_~cond~0_In_1 256) 0) (= |v_thread1Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_In_1} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_Out_4|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_Out_4|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 05:45:41,551 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [240] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_1 (ite (= 0 (ite (< 0 (mod v_~N~0_1 4294967296)) 1 0)) 0 1)) InVars {~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_1, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:45:41,575 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [240] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork2_~cond~0_1 (ite (= 0 (ite (< 0 (mod v_~N~0_1 4294967296)) 1 0)) 0 1)) InVars {~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_1, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0] and [254] L65-1-->L72: Formula: (= (ite (= (ite (< 1 (mod v_~N~0_12 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_7) InVars {~N~0=v_~N~0_12} OutVars{thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_7, ~N~0=v_~N~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1] [2022-12-06 05:45:41,672 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [364] $Ultimate##0-->L65-1: Formula: (let ((.cse0 (mod v_~N~0_196 4294967296))) (and (= (ite (= (ite (< 1 .cse0) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_61) (= v_thread1Thread1of1ForFork2_~cond~0_77 (ite (= (ite (< 0 .cse0) 1 0) 0) 0 1)) (= v_~p~0_159 (+ (* v_~M~0_102 2) v_~p~0_160)) (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_61 256) 0)) (= v_~N~0_196 (+ v_~N~0_195 2)))) InVars {~M~0=v_~M~0_102, ~p~0=v_~p~0_160, ~N~0=v_~N~0_196} OutVars{~M~0=v_~M~0_102, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_61, ~p~0=v_~p~0_159, ~N~0=v_~N~0_195, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1, ~p~0, ~N~0, thread1Thread1of1ForFork2_~cond~0] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:45:41,900 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [364] $Ultimate##0-->L65-1: Formula: (let ((.cse0 (mod v_~N~0_196 4294967296))) (and (= (ite (= (ite (< 1 .cse0) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_61) (= v_thread1Thread1of1ForFork2_~cond~0_77 (ite (= (ite (< 0 .cse0) 1 0) 0) 0 1)) (= v_~p~0_159 (+ (* v_~M~0_102 2) v_~p~0_160)) (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_61 256) 0)) (= v_~N~0_196 (+ v_~N~0_195 2)))) InVars {~M~0=v_~M~0_102, ~p~0=v_~p~0_160, ~N~0=v_~N~0_196} OutVars{~M~0=v_~M~0_102, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_61, ~p~0=v_~p~0_159, ~N~0=v_~N~0_195, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1, ~p~0, ~N~0, thread1Thread1of1ForFork2_~cond~0] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:45:41,951 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [365] $Ultimate##0-->L46-1: Formula: (let ((.cse0 (mod v_~N~0_200 4294967296))) (and (= (+ v_~N~0_199 1) v_~N~0_200) (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_79 256) 0)) (= (ite (= (ite (< 1 .cse0) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_63) (= v_~p~0_163 (+ v_~M~0_104 v_~p~0_164)) (= v_thread1Thread1of1ForFork2_~cond~0_79 (ite (= (ite (< 0 .cse0) 1 0) 0) 0 1)))) InVars {~M~0=v_~M~0_104, ~p~0=v_~p~0_164, ~N~0=v_~N~0_200} OutVars{~M~0=v_~M~0_104, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_63, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_49|, ~p~0=v_~p~0_163, ~N~0=v_~N~0_199, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_79} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1, thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0, thread1Thread1of1ForFork2_~cond~0] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 05:45:42,103 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [365] $Ultimate##0-->L46-1: Formula: (let ((.cse0 (mod v_~N~0_200 4294967296))) (and (= (+ v_~N~0_199 1) v_~N~0_200) (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_79 256) 0)) (= (ite (= (ite (< 1 .cse0) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_63) (= v_~p~0_163 (+ v_~M~0_104 v_~p~0_164)) (= v_thread1Thread1of1ForFork2_~cond~0_79 (ite (= (ite (< 0 .cse0) 1 0) 0) 0 1)))) InVars {~M~0=v_~M~0_104, ~p~0=v_~p~0_164, ~N~0=v_~N~0_200} OutVars{~M~0=v_~M~0_104, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_63, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_49|, ~p~0=v_~p~0_163, ~N~0=v_~N~0_199, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_79} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1, thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0, thread1Thread1of1ForFork2_~cond~0] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:45:42,682 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L53-->thread1EXIT: Formula: (and (= (mod v_thread1Thread1of1ForFork2_~cond~0_In_1 256) 0) (= |v_thread1Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_In_1} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_Out_4|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_Out_4|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:45:42,723 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L53-->thread1EXIT: Formula: (and (= (mod v_thread1Thread1of1ForFork2_~cond~0_In_1 256) 0) (= |v_thread1Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_In_1} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_Out_4|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_Out_4|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:45:42,762 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L53-->thread1EXIT: Formula: (and (= (mod v_thread1Thread1of1ForFork2_~cond~0_In_1 256) 0) (= |v_thread1Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_In_1} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_Out_4|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_Out_4|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:45:42,870 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L53-->thread1EXIT: Formula: (and (= (mod v_thread1Thread1of1ForFork2_~cond~0_In_1 256) 0) (= |v_thread1Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_In_1} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_Out_4|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_Out_4|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset] and [409] L83-->L83: Formula: (and (< 0 (mod (+ 4294967295 v_~L~0_256) 4294967296)) (< 0 (mod v_~L~0_256 4294967296)) (= (+ 2 v_~L~0_254) v_~L~0_256) (= v_~q~0_191 (+ v_~q~0_193 (* v_~M~0_184 2)))) InVars {~M~0=v_~M~0_184, ~L~0=v_~L~0_256, ~q~0=v_~q~0_193} OutVars{~M~0=v_~M~0_184, ~L~0=v_~L~0_254, ~q~0=v_~q~0_191, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_99|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:45:43,178 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L72-->L83: Formula: (and (= (+ v_~M~0_152 v_~q~0_122) v_~q~0_121) (= |v_thread2Thread1of1ForFork0_#res.offset_55| 0) (< 0 (mod v_~L~0_185 4294967296)) (= (+ v_~L~0_184 1) v_~L~0_185) (= |v_thread2Thread1of1ForFork0_#res.base_55| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_114 256) 0) (= (ite (= (ite (< 0 (mod v_~N~0_292 4294967296)) 1 0) 0) 0 1) v_thread1Thread1of1ForFork2_~cond~0_146)) InVars {~M~0=v_~M~0_152, ~L~0=v_~L~0_185, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_114, ~q~0=v_~q~0_122, ~N~0=v_~N~0_292} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_55|, ~M~0=v_~M~0_152, ~L~0=v_~L~0_184, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_55|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_114, ~q~0=v_~q~0_121, ~N~0=v_~N~0_292, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_57|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_146} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, ~L~0, thread2Thread1of1ForFork0_#res.base, ~q~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:45:43,311 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L72-->L83: Formula: (and (= (+ v_~M~0_152 v_~q~0_122) v_~q~0_121) (= |v_thread2Thread1of1ForFork0_#res.offset_55| 0) (< 0 (mod v_~L~0_185 4294967296)) (= (+ v_~L~0_184 1) v_~L~0_185) (= |v_thread2Thread1of1ForFork0_#res.base_55| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_114 256) 0) (= (ite (= (ite (< 0 (mod v_~N~0_292 4294967296)) 1 0) 0) 0 1) v_thread1Thread1of1ForFork2_~cond~0_146)) InVars {~M~0=v_~M~0_152, ~L~0=v_~L~0_185, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_114, ~q~0=v_~q~0_122, ~N~0=v_~N~0_292} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_55|, ~M~0=v_~M~0_152, ~L~0=v_~L~0_184, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_55|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_114, ~q~0=v_~q~0_121, ~N~0=v_~N~0_292, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_57|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_146} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, ~L~0, thread2Thread1of1ForFork0_#res.base, ~q~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] and [421] L53-->L83: Formula: (and (= (+ 2 v_~L~0_284) v_~L~0_285) (< 0 (mod v_~L~0_285 4294967296)) (= |v_thread1Thread1of1ForFork2_#res.offset_51| 0) (= |v_thread1Thread1of1ForFork2_#res.base_51| 0) (= (mod v_thread1Thread1of1ForFork2_~cond~0_201 256) 0) (< 0 (mod (+ 4294967295 v_~L~0_285) 4294967296)) (= v_~q~0_221 (+ (* v_~M~0_204 2) v_~q~0_222))) InVars {~M~0=v_~M~0_204, ~L~0=v_~L~0_285, ~q~0=v_~q~0_222, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_201} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_51|, ~M~0=v_~M~0_204, ~L~0=v_~L~0_284, ~q~0=v_~q~0_221, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_51|, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_115|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_201} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, ~L~0, ~q~0, thread1Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:45:43,449 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L53-->thread1EXIT: Formula: (and (= (mod v_thread1Thread1of1ForFork2_~cond~0_In_1 256) 0) (= |v_thread1Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_In_1} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_Out_4|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_Out_4|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset] and [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] [2022-12-06 05:45:43,589 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [424] L72-->L46-1: Formula: (and (= v_thread1Thread1of1ForFork2_~cond~0_207 (ite (= 0 (ite (< 0 (mod v_~N~0_387 4294967296)) 1 0)) 0 1)) (= v_~p~0_319 (+ v_~M~0_210 v_~p~0_320)) (< 0 (mod v_~L~0_301 4294967296)) (= |v_thread2Thread1of1ForFork0_#res.base_77| 0) (= |v_thread2Thread1of1ForFork0_#res.offset_77| 0) (= (+ v_~N~0_386 1) v_~N~0_387) (= v_~q~0_237 (+ v_~M~0_210 v_~q~0_238)) (= (+ v_~L~0_300 1) v_~L~0_301) (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_207 256) 0)) (= (mod v_thread2Thread1of1ForFork0_~cond~1_159 256) 0)) InVars {~M~0=v_~M~0_210, ~L~0=v_~L~0_301, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_159, ~q~0=v_~q~0_238, ~p~0=v_~p~0_320, ~N~0=v_~N~0_387} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_77|, ~M~0=v_~M~0_210, ~L~0=v_~L~0_300, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_77|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_159, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_161|, ~q~0=v_~q~0_237, ~p~0=v_~p~0_319, ~N~0=v_~N~0_386, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_125|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_207} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, ~L~0, thread2Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork2_#t~post1, ~q~0, ~p~0, ~N~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:45:43,938 WARN L322 ript$VariableManager]: TermVariable LBE145 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:43,938 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:45:44,139 INFO L203 LiptonReduction]: Total number of compositions: 12 [2022-12-06 05:45:44,142 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10320 [2022-12-06 05:45:44,142 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 2901 transitions, 99390 flow [2022-12-06 05:45:44,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:44,142 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:44,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:44,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-06 05:45:44,343 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,SelfDestructingSolverStorable35 [2022-12-06 05:45:44,343 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 1 more)] === [2022-12-06 05:45:44,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:44,343 INFO L85 PathProgramCache]: Analyzing trace with hash -55790450, now seen corresponding path program 1 times [2022-12-06 05:45:44,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:44,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915892543] [2022-12-06 05:45:44,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:44,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:44,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:44,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:44,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915892543] [2022-12-06 05:45:44,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915892543] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:44,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155953885] [2022-12-06 05:45:44,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:44,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:44,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:44,614 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) [2022-12-06 05:45:44,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 05:45:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:44,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 05:45:44,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:45,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:46:03,240 WARN L233 SmtUtils]: Spent 17.77s on a formula simplification. DAG size of input: 48 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:46:03,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:03,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155953885] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:03,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:03,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-06 05:46:03,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446666300] [2022-12-06 05:46:03,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:03,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:46:03,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:03,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:46:03,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:46:03,302 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 87 [2022-12-06 05:46:03,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 2901 transitions, 99390 flow. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:03,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:03,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 87 [2022-12-06 05:46:03,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:07,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:46:10,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:46:17,390 WARN L233 SmtUtils]: Spent 6.37s on a formula simplification. DAG size of input: 91 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:46:18,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:46:20,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:46:24,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:46:39,787 WARN L233 SmtUtils]: Spent 9.85s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:46:43,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:46:46,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:46:48,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:46:50,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:46:54,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:46:57,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:46:59,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:47:08,680 WARN L233 SmtUtils]: Spent 8.37s on a formula simplification. DAG size of input: 93 DAG size of output: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:47:12,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:47:14,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:47:15,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:47:52,902 INFO L130 PetriNetUnfolder]: 25986/40632 cut-off events. [2022-12-06 05:47:52,902 INFO L131 PetriNetUnfolder]: For 3277014/3277014 co-relation queries the response was YES. [2022-12-06 05:47:53,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571600 conditions, 40632 events. 25986/40632 cut-off events. For 3277014/3277014 co-relation queries the response was YES. Maximal size of possible extension queue 2328. Compared 313212 event pairs, 1865 based on Foata normal form. 45/40675 useless extension candidates. Maximal degree in co-relation 567819. Up to 19632 conditions per place. [2022-12-06 05:47:53,959 INFO L137 encePairwiseOnDemand]: 17/87 looper letters, 1940 selfloop transitions, 1779 changer transitions 30/3749 dead transitions. [2022-12-06 05:47:53,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 3749 transitions, 132395 flow [2022-12-06 05:47:53,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 05:47:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 05:47:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 378 transitions. [2022-12-06 05:47:53,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1810344827586207 [2022-12-06 05:47:53,961 INFO L175 Difference]: Start difference. First operand has 369 places, 2901 transitions, 99390 flow. Second operand 24 states and 378 transitions. [2022-12-06 05:47:53,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 3749 transitions, 132395 flow [2022-12-06 05:49:18,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 3749 transitions, 125835 flow, removed 3255 selfloop flow, removed 5 redundant places. [2022-12-06 05:49:18,639 INFO L231 Difference]: Finished difference. Result has 397 places, 3291 transitions, 115064 flow [2022-12-06 05:49:18,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=94777, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1435, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=115064, PETRI_PLACES=397, PETRI_TRANSITIONS=3291} [2022-12-06 05:49:18,641 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 367 predicate places. [2022-12-06 05:49:18,641 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:18,641 INFO L89 Accepts]: Start accepts. Operand has 397 places, 3291 transitions, 115064 flow [2022-12-06 05:49:18,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:18,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:18,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 397 places, 3291 transitions, 115064 flow [2022-12-06 05:49:18,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 394 places, 3291 transitions, 115064 flow [2022-12-06 05:49:24,446 INFO L130 PetriNetUnfolder]: 5513/12341 cut-off events. [2022-12-06 05:49:24,446 INFO L131 PetriNetUnfolder]: For 776390/778614 co-relation queries the response was YES. [2022-12-06 05:49:24,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161717 conditions, 12341 events. 5513/12341 cut-off events. For 776390/778614 co-relation queries the response was YES. Maximal size of possible extension queue 1157. Compared 126077 event pairs, 25 based on Foata normal form. 176/12351 useless extension candidates. Maximal degree in co-relation 160369. Up to 2828 conditions per place. [2022-12-06 05:49:24,714 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 394 places, 3291 transitions, 115064 flow [2022-12-06 05:49:24,714 INFO L188 LiptonReduction]: Number of co-enabled transitions 13340 [2022-12-06 05:49:24,932 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] L72-->L83: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_49| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_108 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_49| 0) (< 0 (mod v_~L~0_181 4294967296)) (= v_~q~0_117 (+ v_~M~0_148 v_~q~0_118)) (= v_~L~0_181 (+ v_~L~0_180 1))) InVars {~M~0=v_~M~0_148, ~L~0=v_~L~0_181, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_108, ~q~0=v_~q~0_118} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_49|, ~M~0=v_~M~0_148, ~L~0=v_~L~0_180, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_49|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_108, ~q~0=v_~q~0_117, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_55|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, ~L~0, thread2Thread1of1ForFork0_#res.base, ~q~0, thread3Thread1of1ForFork1_#t~post2] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:49:25,091 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [415] $Ultimate##0-->L83: Formula: (let ((.cse0 (mod v_~N~0_367 4294967296))) (and (= (+ v_~L~0_264 1) v_~L~0_265) (= v_~q~0_201 (+ v_~M~0_192 v_~q~0_202)) (= (+ (* v_~M~0_192 2) v_~p~0_302) v_~p~0_301) (= (ite (= (ite (< 1 .cse0) 1 0) 0) 0 1) v_thread2Thread1of1ForFork0_~cond~1_149) (< 0 (mod v_~L~0_265 4294967296)) (= v_~N~0_367 (+ v_~N~0_366 2)) (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_149 256) 0)) (= (ite (= 0 (ite (< 0 .cse0) 1 0)) 0 1) v_thread1Thread1of1ForFork2_~cond~0_189))) InVars {~M~0=v_~M~0_192, ~L~0=v_~L~0_265, ~q~0=v_~q~0_202, ~p~0=v_~p~0_302, ~N~0=v_~N~0_367} OutVars{~M~0=v_~M~0_192, ~L~0=v_~L~0_264, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_149, ~q~0=v_~q~0_201, ~p~0=v_~p~0_301, ~N~0=v_~N~0_366, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_105|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_189} AuxVars[] AssignedVars[~L~0, thread2Thread1of1ForFork0_~cond~1, ~q~0, ~p~0, ~N~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:49:25,605 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [431] L72-->L46-1: Formula: (and (= (+ v_~q~0_267 (* v_~M~0_222 2)) v_~q~0_265) (= |v_thread2Thread1of1ForFork0_#res.offset_89| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_174 256) 0) (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_224 256) 0)) (< 0 (mod (+ 4294967295 v_~L~0_330) 4294967296)) (= (+ 2 v_~L~0_328) v_~L~0_330) (< 0 (mod v_~L~0_330 4294967296)) (= |v_thread2Thread1of1ForFork0_#res.base_89| 0) (let ((.cse0 (< 0 (mod v_~N~0_415 4294967296)))) (or (and (= v_~N~0_415 v_~N~0_414) (not .cse0) (= v_~p~0_346 v_~p~0_345) (= |v_thread1Thread1of1ForFork2_#t~post1_177| |v_thread1Thread1of1ForFork2_#t~post1_176|)) (and (= (+ v_~M~0_222 v_~p~0_346) v_~p~0_345) (= v_~N~0_415 (+ v_~N~0_414 1)) .cse0)))) InVars {~M~0=v_~M~0_222, ~L~0=v_~L~0_330, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_174, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_177|, ~q~0=v_~q~0_267, ~p~0=v_~p~0_346, ~N~0=v_~N~0_415, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_224} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_89|, ~M~0=v_~M~0_222, ~L~0=v_~L~0_328, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_89|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_174, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_176|, ~q~0=v_~q~0_265, ~p~0=v_~p~0_345, ~N~0=v_~N~0_414, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_142|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_224} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, ~L~0, thread2Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork2_#t~post1, ~q~0, ~p~0, ~N~0, thread3Thread1of1ForFork1_#t~post2] and [355] L83-->L53: Formula: (and (= |v_thread3Thread1of1ForFork1_#res.base_45| 0) (= v_thread1Thread1of1ForFork2_~cond~0_65 (ite (= (ite (< 0 (mod v_~N~0_167 4294967296)) 1 0) 0) 0 1)) (not (< 0 (mod v_~L~0_91 4294967296))) (= |v_thread3Thread1of1ForFork1_#res.offset_45| 0)) InVars {~L~0=v_~L~0_91, ~N~0=v_~N~0_167} OutVars{~L~0=v_~L~0_91, thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_45|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_45|, ~N~0=v_~N~0_167, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_65} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:49:25,824 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [431] L72-->L46-1: Formula: (and (= (+ v_~q~0_267 (* v_~M~0_222 2)) v_~q~0_265) (= |v_thread2Thread1of1ForFork0_#res.offset_89| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_174 256) 0) (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_224 256) 0)) (< 0 (mod (+ 4294967295 v_~L~0_330) 4294967296)) (= (+ 2 v_~L~0_328) v_~L~0_330) (< 0 (mod v_~L~0_330 4294967296)) (= |v_thread2Thread1of1ForFork0_#res.base_89| 0) (let ((.cse0 (< 0 (mod v_~N~0_415 4294967296)))) (or (and (= v_~N~0_415 v_~N~0_414) (not .cse0) (= v_~p~0_346 v_~p~0_345) (= |v_thread1Thread1of1ForFork2_#t~post1_177| |v_thread1Thread1of1ForFork2_#t~post1_176|)) (and (= (+ v_~M~0_222 v_~p~0_346) v_~p~0_345) (= v_~N~0_415 (+ v_~N~0_414 1)) .cse0)))) InVars {~M~0=v_~M~0_222, ~L~0=v_~L~0_330, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_174, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_177|, ~q~0=v_~q~0_267, ~p~0=v_~p~0_346, ~N~0=v_~N~0_415, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_224} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_89|, ~M~0=v_~M~0_222, ~L~0=v_~L~0_328, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_89|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_174, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_176|, ~q~0=v_~q~0_265, ~p~0=v_~p~0_345, ~N~0=v_~N~0_414, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_142|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_224} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, ~L~0, thread2Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork2_#t~post1, ~q~0, ~p~0, ~N~0, thread3Thread1of1ForFork1_#t~post2] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:49:25,989 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] and [286] L53-->L46-1: Formula: (and (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_11 256) 0)) (let ((.cse0 (< 0 (mod v_~N~0_38 4294967296)))) (or (and (= v_~N~0_38 v_~N~0_37) (= v_~p~0_34 v_~p~0_33) (= |v_thread1Thread1of1ForFork2_#t~post1_8| |v_thread1Thread1of1ForFork2_#t~post1_7|) (not .cse0)) (and (= (+ 1 v_~N~0_37) v_~N~0_38) .cse0 (= (+ v_~p~0_34 v_~M~0_26) v_~p~0_33))))) InVars {~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_8|, ~p~0=v_~p~0_34, ~N~0=v_~N~0_38, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} OutVars{~M~0=v_~M~0_26, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_7|, ~p~0=v_~p~0_33, ~N~0=v_~N~0_37, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0] [2022-12-06 05:49:26,133 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [301] L72-->L65-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_13 256) 0)) (let ((.cse0 (< 1 (mod v_~N~0_56 4294967296)))) (or (and .cse0 (= (+ 2 v_~N~0_55) v_~N~0_56) (= v_~p~0_45 (+ (* 2 v_~M~0_38) v_~p~0_46))) (and (not .cse0) (= v_~N~0_56 v_~N~0_55) (= v_~p~0_46 v_~p~0_45))))) InVars {~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_46, ~N~0=v_~N~0_56} OutVars{~M~0=v_~M~0_38, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_13, ~p~0=v_~p~0_45, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~p~0, ~N~0] and [273] L83-->L83: Formula: (and (= v_~L~0_19 (+ v_~L~0_18 1)) (< 0 (mod v_~L~0_19 4294967296)) (= v_~q~0_17 (+ v_~q~0_18 v_~M~0_24))) InVars {~M~0=v_~M~0_24, ~L~0=v_~L~0_19, ~q~0=v_~q~0_18} OutVars{~M~0=v_~M~0_24, ~L~0=v_~L~0_18, ~q~0=v_~q~0_17, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2] [2022-12-06 05:49:26,210 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [363] $Ultimate##0-->L65-1: Formula: (and (= v_~p~0_155 (+ (* v_~M~0_100 2) v_~p~0_156)) (= v_thread2Thread1of1ForFork0_~cond~1_59 (ite (= (ite (< 1 (mod v_~N~0_192 4294967296)) 1 0) 0) 0 1)) (= (+ v_~N~0_191 2) v_~N~0_192) (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_59 256) 0))) InVars {~M~0=v_~M~0_100, ~p~0=v_~p~0_156, ~N~0=v_~N~0_192} OutVars{~M~0=v_~M~0_100, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_59, ~p~0=v_~p~0_155, ~N~0=v_~N~0_191} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1, ~p~0, ~N~0] and [413] $Ultimate##0-->L46-1: Formula: (and (= v_~N~0_357 (+ v_~N~0_356 1)) (= v_~p~0_291 (+ v_~M~0_188 v_~p~0_292)) (= (ite (= (ite (< 0 (mod v_~N~0_357 4294967296)) 1 0) 0) 0 1) v_thread1Thread1of1ForFork2_~cond~0_185) (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_185 256) 0))) InVars {~M~0=v_~M~0_188, ~p~0=v_~p~0_292, ~N~0=v_~N~0_357} OutVars{~M~0=v_~M~0_188, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_145|, ~p~0=v_~p~0_291, ~N~0=v_~N~0_356, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_185} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0, thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:49:26,270 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [363] $Ultimate##0-->L65-1: Formula: (and (= v_~p~0_155 (+ (* v_~M~0_100 2) v_~p~0_156)) (= v_thread2Thread1of1ForFork0_~cond~1_59 (ite (= (ite (< 1 (mod v_~N~0_192 4294967296)) 1 0) 0) 0 1)) (= (+ v_~N~0_191 2) v_~N~0_192) (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_59 256) 0))) InVars {~M~0=v_~M~0_100, ~p~0=v_~p~0_156, ~N~0=v_~N~0_192} OutVars{~M~0=v_~M~0_100, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_59, ~p~0=v_~p~0_155, ~N~0=v_~N~0_191} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1, ~p~0, ~N~0] and [410] $Ultimate##0-->L83: Formula: (and (= v_~q~0_197 (+ v_~M~0_186 v_~q~0_198)) (= v_thread1Thread1of1ForFork2_~cond~0_179 (ite (= (ite (< 0 (mod v_~N~0_350 4294967296)) 1 0) 0) 0 1)) (= (+ v_~L~0_260 1) v_~L~0_261) (< 0 (mod v_~L~0_261 4294967296))) InVars {~M~0=v_~M~0_186, ~L~0=v_~L~0_261, ~q~0=v_~q~0_198, ~N~0=v_~N~0_350} OutVars{~M~0=v_~M~0_186, ~L~0=v_~L~0_260, ~q~0=v_~q~0_197, ~N~0=v_~N~0_350, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_103|, thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_179} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork2_~cond~0] [2022-12-06 05:49:26,342 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:49:26,349 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7708 [2022-12-06 05:49:26,349 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 3291 transitions, 115411 flow [2022-12-06 05:49:26,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:49:26,349 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:26,349 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:26,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-06 05:49:26,556 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,SelfDestructingSolverStorable36 [2022-12-06 05:49:26,556 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 1 more)] === [2022-12-06 05:49:26,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:26,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2101348809, now seen corresponding path program 1 times [2022-12-06 05:49:26,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:26,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596459148] [2022-12-06 05:49:26,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:26,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:26,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:26,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596459148] [2022-12-06 05:49:26,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596459148] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:26,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748102756] [2022-12-06 05:49:26,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:26,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:26,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:26,650 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) [2022-12-06 05:49:26,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 05:49:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:26,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 05:49:26,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:26,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:26,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748102756] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:26,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:26,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-12-06 05:49:26,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020512375] [2022-12-06 05:49:26,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:26,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:49:26,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:26,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:49:26,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:49:26,912 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 92 [2022-12-06 05:49:26,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 3291 transitions, 115411 flow. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:49:26,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:26,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 92 [2022-12-06 05:49:26,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:50:12,129 INFO L130 PetriNetUnfolder]: 29388/45994 cut-off events. [2022-12-06 05:50:12,130 INFO L131 PetriNetUnfolder]: For 3362289/3362289 co-relation queries the response was YES. [2022-12-06 05:50:12,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618803 conditions, 45994 events. 29388/45994 cut-off events. For 3362289/3362289 co-relation queries the response was YES. Maximal size of possible extension queue 2607. Compared 362077 event pairs, 1742 based on Foata normal form. 500/46492 useless extension candidates. Maximal degree in co-relation 615140. Up to 12197 conditions per place. [2022-12-06 05:50:13,288 INFO L137 encePairwiseOnDemand]: 17/92 looper letters, 1594 selfloop transitions, 2813 changer transitions 4/4411 dead transitions. [2022-12-06 05:50:13,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 4411 transitions, 154765 flow [2022-12-06 05:50:13,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 05:50:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 05:50:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 568 transitions. [2022-12-06 05:50:13,290 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17149758454106281 [2022-12-06 05:50:13,290 INFO L175 Difference]: Start difference. First operand has 394 places, 3291 transitions, 115411 flow. Second operand 36 states and 568 transitions. [2022-12-06 05:50:13,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 4411 transitions, 154765 flow Received shutdown request... [2022-12-06 05:51:08,920 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 05:51:08,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 05:51:08,950 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:51:08,961 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:51:09,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:51:09,126 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-12-06 05:51:09,127 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 05:51:09,127 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 05:51:09,127 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 05:51:09,128 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:51:09,130 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:51:09,131 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:51:09,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:51:09 BasicIcfg [2022-12-06 05:51:09,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:51:09,135 INFO L158 Benchmark]: Toolchain (without parser) took 823078.82ms. Allocated memory was 196.1MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 172.6MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 6.7GB. Max. memory is 8.0GB. [2022-12-06 05:51:09,135 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 196.1MB. Free memory was 174.1MB in the beginning and 174.1MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:51:09,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.05ms. Allocated memory is still 196.1MB. Free memory was 172.6MB in the beginning and 159.5MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 05:51:09,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.53ms. Allocated memory is still 196.1MB. Free memory was 159.5MB in the beginning and 157.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:51:09,136 INFO L158 Benchmark]: Boogie Preprocessor took 34.00ms. Allocated memory is still 196.1MB. Free memory was 157.9MB in the beginning and 156.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:51:09,137 INFO L158 Benchmark]: RCFGBuilder took 473.79ms. Allocated memory is still 196.1MB. Free memory was 156.8MB in the beginning and 140.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 05:51:09,138 INFO L158 Benchmark]: TraceAbstraction took 822222.01ms. Allocated memory was 196.1MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 140.1MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 6.6GB. Max. memory is 8.0GB. [2022-12-06 05:51:09,144 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 196.1MB. Free memory was 174.1MB in the beginning and 174.1MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 299.05ms. Allocated memory is still 196.1MB. Free memory was 172.6MB in the beginning and 159.5MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.53ms. Allocated memory is still 196.1MB. Free memory was 159.5MB in the beginning and 157.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.00ms. Allocated memory is still 196.1MB. Free memory was 157.9MB in the beginning and 156.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 473.79ms. Allocated memory is still 196.1MB. Free memory was 156.8MB in the beginning and 140.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 822222.01ms. Allocated memory was 196.1MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 140.1MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 6.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 82 PlacesBefore, 30 PlacesAfterwards, 79 TransitionsBefore, 23 TransitionsAfterwards, 860 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 31 TrivialYvCompositions, 21 ConcurrentYvCompositions, 4 ChoiceCompositions, 56 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 467, independent: 459, independent conditional: 459, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 467, independent: 459, independent conditional: 0, independent unconditional: 459, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 467, independent: 459, independent conditional: 0, independent unconditional: 459, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 467, independent: 459, independent conditional: 0, independent unconditional: 459, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 435, independent: 430, independent conditional: 0, independent unconditional: 430, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 435, independent: 430, independent conditional: 0, independent unconditional: 430, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 467, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 435, unknown conditional: 0, unknown unconditional: 435] , Statistics on independence cache: Total cache size (in pairs): 666, Positive cache size: 661, Positive conditional cache size: 0, Positive unconditional cache size: 661, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 36 PlacesBefore, 34 PlacesAfterwards, 35 TransitionsBefore, 33 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 73, independent: 69, independent conditional: 41, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 73, independent: 69, independent conditional: 41, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 73, independent: 69, independent conditional: 41, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 73, independent: 55, independent conditional: 29, independent unconditional: 26, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 14, unknown conditional: 12, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 22, Positive conditional cache size: 12, Positive unconditional cache size: 10, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 23, Positive conditional cache size: 12, Positive unconditional cache size: 11, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 23, Positive conditional cache size: 12, Positive unconditional cache size: 11, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 23, Positive conditional cache size: 12, Positive unconditional cache size: 11, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 12, Positive unconditional cache size: 11, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 12, Positive unconditional cache size: 11, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 12, Positive unconditional cache size: 11, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 64 PlacesBefore, 62 PlacesAfterwards, 91 TransitionsBefore, 89 TransitionsAfterwards, 566 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 34, Positive conditional cache size: 12, Positive unconditional cache size: 22, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 84, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 92 PlacesBefore, 89 PlacesAfterwards, 187 TransitionsBefore, 184 TransitionsAfterwards, 1140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 59, Positive conditional cache size: 34, Positive unconditional cache size: 25, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 90 PlacesBefore, 90 PlacesAfterwards, 221 TransitionsBefore, 221 TransitionsAfterwards, 1326 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 59, Positive conditional cache size: 34, Positive unconditional cache size: 25, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 94 PlacesBefore, 94 PlacesAfterwards, 247 TransitionsBefore, 247 TransitionsAfterwards, 1474 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 59, Positive conditional cache size: 34, Positive unconditional cache size: 25, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 103 PlacesBefore, 103 PlacesAfterwards, 328 TransitionsBefore, 328 TransitionsAfterwards, 1792 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 62, Positive conditional cache size: 37, Positive unconditional cache size: 25, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 99 PlacesAfterwards, 318 TransitionsBefore, 318 TransitionsAfterwards, 1788 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 62, Positive conditional cache size: 37, Positive unconditional cache size: 25, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 113 PlacesBefore, 113 PlacesAfterwards, 406 TransitionsBefore, 406 TransitionsAfterwards, 2210 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 74, Positive conditional cache size: 46, Positive unconditional cache size: 28, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 122 PlacesBefore, 122 PlacesAfterwards, 453 TransitionsBefore, 453 TransitionsAfterwards, 2482 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 82, Positive conditional cache size: 53, Positive unconditional cache size: 29, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 132 PlacesBefore, 132 PlacesAfterwards, 499 TransitionsBefore, 499 TransitionsAfterwards, 2636 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 83, Positive conditional cache size: 54, Positive unconditional cache size: 29, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 138 PlacesBefore, 138 PlacesAfterwards, 495 TransitionsBefore, 495 TransitionsAfterwards, 2604 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 83, Positive conditional cache size: 54, Positive unconditional cache size: 29, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 148 PlacesBefore, 148 PlacesAfterwards, 568 TransitionsBefore, 568 TransitionsAfterwards, 2978 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 86, Positive conditional cache size: 54, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 153 PlacesBefore, 153 PlacesAfterwards, 557 TransitionsBefore, 557 TransitionsAfterwards, 2960 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 86, Positive conditional cache size: 54, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 164 PlacesBefore, 164 PlacesAfterwards, 623 TransitionsBefore, 623 TransitionsAfterwards, 3210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 86, Positive conditional cache size: 54, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 173 PlacesBefore, 173 PlacesAfterwards, 636 TransitionsBefore, 636 TransitionsAfterwards, 3190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 86, Positive conditional cache size: 54, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 172 PlacesBefore, 172 PlacesAfterwards, 632 TransitionsBefore, 632 TransitionsAfterwards, 3182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 86, Positive conditional cache size: 54, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 176 PlacesBefore, 176 PlacesAfterwards, 661 TransitionsBefore, 661 TransitionsAfterwards, 3324 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 86, Positive conditional cache size: 54, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 212 PlacesBefore, 212 PlacesAfterwards, 867 TransitionsBefore, 867 TransitionsAfterwards, 4082 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 86, Positive conditional cache size: 54, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 225 PlacesBefore, 225 PlacesAfterwards, 1026 TransitionsBefore, 1026 TransitionsAfterwards, 4854 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 86, Positive conditional cache size: 54, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 240 PlacesBefore, 240 PlacesAfterwards, 1244 TransitionsBefore, 1244 TransitionsAfterwards, 5680 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 86, Positive conditional cache size: 54, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 247 PlacesBefore, 247 PlacesAfterwards, 1268 TransitionsBefore, 1268 TransitionsAfterwards, 5834 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 86, Positive conditional cache size: 54, Positive unconditional cache size: 32, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 287 PlacesBefore, 284 PlacesAfterwards, 1757 TransitionsBefore, 1754 TransitionsAfterwards, 7732 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 58, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 117, Positive conditional cache size: 83, Positive unconditional cache size: 34, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 291 PlacesBefore, 291 PlacesAfterwards, 1928 TransitionsBefore, 1928 TransitionsAfterwards, 8382 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 117, Positive conditional cache size: 83, Positive unconditional cache size: 34, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 298 PlacesBefore, 297 PlacesAfterwards, 1929 TransitionsBefore, 1928 TransitionsAfterwards, 8388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 143, Positive conditional cache size: 108, Positive unconditional cache size: 35, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 302 PlacesBefore, 302 PlacesAfterwards, 1962 TransitionsBefore, 1962 TransitionsAfterwards, 8512 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 98, independent: 98, independent conditional: 98, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 98, independent: 98, independent conditional: 98, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 98, independent: 98, independent conditional: 70, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 98, independent: 98, independent conditional: 70, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 8, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 98, independent: 89, independent conditional: 62, independent unconditional: 27, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 8, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 152, Positive conditional cache size: 116, Positive unconditional cache size: 36, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 310 PlacesBefore, 310 PlacesAfterwards, 2028 TransitionsBefore, 2028 TransitionsAfterwards, 8922 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 152, Positive conditional cache size: 116, Positive unconditional cache size: 36, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 318 PlacesBefore, 318 PlacesAfterwards, 2060 TransitionsBefore, 2060 TransitionsAfterwards, 9054 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 152, Positive conditional cache size: 116, Positive unconditional cache size: 36, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 317 PlacesBefore, 317 PlacesAfterwards, 2057 TransitionsBefore, 2057 TransitionsAfterwards, 9028 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 152, Positive conditional cache size: 116, Positive unconditional cache size: 36, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 375 PlacesBefore, 369 PlacesAfterwards, 2907 TransitionsBefore, 2901 TransitionsAfterwards, 11510 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 68, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 49, independent: 49, independent conditional: 49, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 49, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 49, unknown conditional: 49, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 243, Positive cache size: 240, Positive conditional cache size: 202, Positive unconditional cache size: 38, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 394 PlacesBefore, 394 PlacesAfterwards, 3291 TransitionsBefore, 3291 TransitionsAfterwards, 13340 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 17, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 17, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 9, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 254, Positive conditional cache size: 214, Positive unconditional cache size: 40, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 108 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 822.1s, OverallIterations: 38, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 732.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 3558 SdHoareTripleChecker+Valid, 62.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3558 mSDsluCounter, 257 SdHoareTripleChecker+Invalid, 60.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 1757 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16287 IncrementalHoareTripleChecker+Invalid, 18057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1757 mSolverCounterUnsat, 131 mSDtfsCounter, 16287 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 873 GetRequests, 450 SyntacticMatches, 19 SemanticMatches, 404 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2090 ImplicationChecksByTransitivity, 57.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115411occurred in iteration=37, InterpolantAutomatonStates: 375, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 28.9s InterpolantComputationTime, 986 NumberOfCodeBlocks, 986 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 1169 ConstructedInterpolants, 21 QuantifiedInterpolants, 13136 SizeOfPredicates, 44 NumberOfNonLiveVariables, 2366 ConjunctsInSsa, 216 ConjunctsInUnsatCore, 65 InterpolantComputations, 26 PerfectInterpolantSequences, 30/75 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown