/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/bench-exp3x3-opt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:01:38,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:01:38,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:01:38,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:01:38,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:01:38,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:01:38,418 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:01:38,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:01:38,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:01:38,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:01:38,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:01:38,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:01:38,438 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:01:38,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:01:38,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:01:38,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:01:38,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:01:38,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:01:38,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:01:38,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:01:38,454 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:01:38,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:01:38,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:01:38,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:01:38,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:01:38,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:01:38,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:01:38,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:01:38,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:01:38,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:01:38,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:01:38,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:01:38,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:01:38,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:01:38,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:01:38,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:01:38,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:01:38,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:01:38,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:01:38,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:01:38,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:01:38,481 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:01:38,518 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:01:38,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:01:38,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:01:38,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:01:38,520 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:01:38,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:01:38,521 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:01:38,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:01:38,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:01:38,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:01:38,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:01:38,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:01:38,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:01:38,522 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:01:38,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:01:38,523 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:01:38,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:01:38,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:01:38,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:01:38,523 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:01:38,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:01:38,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:01:38,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:01:38,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:01:38,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:01:38,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:01:38,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:01:38,525 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:01:38,525 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:01:38,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:01:38,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:01:38,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:01:38,861 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:01:38,862 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:01:38,863 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2022-12-06 05:01:39,985 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:01:40,171 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:01:40,172 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2022-12-06 05:01:40,178 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d32ddb68e/e1686899bc7e4159870b4da253b2e6bb/FLAGa0ec6bd28 [2022-12-06 05:01:40,196 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d32ddb68e/e1686899bc7e4159870b4da253b2e6bb [2022-12-06 05:01:40,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:01:40,200 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:01:40,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:01:40,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:01:40,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:01:40,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:01:40" (1/1) ... [2022-12-06 05:01:40,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d085b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:40, skipping insertion in model container [2022-12-06 05:01:40,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:01:40" (1/1) ... [2022-12-06 05:01:40,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:01:40,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:01:40,379 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/bench-exp3x3-opt.wvr.c[2826,2839] [2022-12-06 05:01:40,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:01:40,393 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:01:40,415 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/bench-exp3x3-opt.wvr.c[2826,2839] [2022-12-06 05:01:40,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:01:40,438 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:01:40,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:40 WrapperNode [2022-12-06 05:01:40,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:01:40,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:01:40,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:01:40,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:01:40,445 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:01:40" (1/1) ... [2022-12-06 05:01:40,461 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:01:40" (1/1) ... [2022-12-06 05:01:40,493 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2022-12-06 05:01:40,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:01:40,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:01:40,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:01:40,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:01:40,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:40" (1/1) ... [2022-12-06 05:01:40,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:40" (1/1) ... [2022-12-06 05:01:40,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:40" (1/1) ... [2022-12-06 05:01:40,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:40" (1/1) ... [2022-12-06 05:01:40,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:40" (1/1) ... [2022-12-06 05:01:40,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:40" (1/1) ... [2022-12-06 05:01:40,530 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:40" (1/1) ... [2022-12-06 05:01:40,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:40" (1/1) ... [2022-12-06 05:01:40,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:01:40,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:01:40,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:01:40,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:01:40,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:40" (1/1) ... [2022-12-06 05:01:40,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:01:40,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:40,576 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:01:40,593 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:01:40,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:01:40,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:01:40,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:01:40,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:01:40,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:01:40,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:01:40,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:01:40,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:01:40,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:01:40,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:01:40,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 05:01:40,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 05:01:40,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:01:40,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-06 05:01:40,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-06 05:01:40,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-12-06 05:01:40,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-12-06 05:01:40,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:01:40,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:01:40,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:01:40,621 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:01:40,709 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:01:40,711 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:01:41,024 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:01:41,035 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:01:41,035 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 05:01:41,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:01:41 BoogieIcfgContainer [2022-12-06 05:01:41,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:01:41,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:01:41,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:01:41,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:01:41,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:01:40" (1/3) ... [2022-12-06 05:01:41,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9772be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:01:41, skipping insertion in model container [2022-12-06 05:01:41,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:01:40" (2/3) ... [2022-12-06 05:01:41,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9772be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:01:41, skipping insertion in model container [2022-12-06 05:01:41,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:01:41" (3/3) ... [2022-12-06 05:01:41,044 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2022-12-06 05:01:41,062 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:01:41,062 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:01:41,062 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:01:41,211 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-12-06 05:01:41,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 162 transitions, 372 flow [2022-12-06 05:01:41,356 INFO L130 PetriNetUnfolder]: 14/156 cut-off events. [2022-12-06 05:01:41,356 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:01:41,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 156 events. 14/156 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-06 05:01:41,362 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 162 transitions, 372 flow [2022-12-06 05:01:41,371 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 140 transitions, 316 flow [2022-12-06 05:01:41,373 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:41,395 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 140 transitions, 316 flow [2022-12-06 05:01:41,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 140 transitions, 316 flow [2022-12-06 05:01:41,456 INFO L130 PetriNetUnfolder]: 14/140 cut-off events. [2022-12-06 05:01:41,456 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:01:41,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 140 events. 14/140 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-06 05:01:41,462 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 140 transitions, 316 flow [2022-12-06 05:01:41,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 2916 [2022-12-06 05:01:46,951 INFO L203 LiptonReduction]: Total number of compositions: 103 [2022-12-06 05:01:46,964 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:01:46,970 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;@2c0741c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:01:46,970 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 05:01:46,976 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2022-12-06 05:01:46,976 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:01:46,976 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:46,977 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:46,978 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 4 more)] === [2022-12-06 05:01:46,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:46,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1155012049, now seen corresponding path program 1 times [2022-12-06 05:01:46,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:46,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580786310] [2022-12-06 05:01:46,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:46,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:47,790 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:01:47,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:47,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580786310] [2022-12-06 05:01:47,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580786310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:47,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:01:47,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:01:47,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967567913] [2022-12-06 05:01:47,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:47,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:01:47,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:47,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:01:47,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:01:47,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:01:47,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 110 flow. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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:01:47,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:47,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:01:47,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:48,236 INFO L130 PetriNetUnfolder]: 3453/4197 cut-off events. [2022-12-06 05:01:48,236 INFO L131 PetriNetUnfolder]: For 305/305 co-relation queries the response was YES. [2022-12-06 05:01:48,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8766 conditions, 4197 events. 3453/4197 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 11514 event pairs, 837 based on Foata normal form. 1/2408 useless extension candidates. Maximal degree in co-relation 6060. Up to 2419 conditions per place. [2022-12-06 05:01:48,265 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 59 selfloop transitions, 3 changer transitions 5/67 dead transitions. [2022-12-06 05:01:48,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 331 flow [2022-12-06 05:01:48,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:01:48,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:01:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-06 05:01:48,276 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2022-12-06 05:01:48,278 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 110 flow. Second operand 3 states and 68 transitions. [2022-12-06 05:01:48,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 331 flow [2022-12-06 05:01:48,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 67 transitions, 289 flow, removed 0 selfloop flow, removed 12 redundant places. [2022-12-06 05:01:48,291 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 105 flow [2022-12-06 05:01:48,293 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2022-12-06 05:01:48,297 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2022-12-06 05:01:48,297 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:48,298 INFO L89 Accepts]: Start accepts. Operand has 41 places, 39 transitions, 105 flow [2022-12-06 05:01:48,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:48,302 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:48,302 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 39 transitions, 105 flow [2022-12-06 05:01:48,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 39 transitions, 105 flow [2022-12-06 05:01:48,319 INFO L130 PetriNetUnfolder]: 9/51 cut-off events. [2022-12-06 05:01:48,319 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:01:48,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 51 events. 9/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 42. Up to 8 conditions per place. [2022-12-06 05:01:48,320 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 39 transitions, 105 flow [2022-12-06 05:01:48,320 INFO L188 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-06 05:01:48,322 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:48,324 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 05:01:48,324 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 105 flow [2022-12-06 05:01:48,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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:01:48,325 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:48,325 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:48,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:01:48,328 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 4 more)] === [2022-12-06 05:01:48,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:48,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1438143645, now seen corresponding path program 1 times [2022-12-06 05:01:48,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:48,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605820488] [2022-12-06 05:01:48,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:48,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:48,681 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:01:48,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:48,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605820488] [2022-12-06 05:01:48,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605820488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:48,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:01:48,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:01:48,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502037890] [2022-12-06 05:01:48,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:48,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:01:48,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:48,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:01:48,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:01:48,686 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:01:48,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:48,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:48,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:01:48,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:49,287 INFO L130 PetriNetUnfolder]: 5021/6142 cut-off events. [2022-12-06 05:01:49,288 INFO L131 PetriNetUnfolder]: For 981/981 co-relation queries the response was YES. [2022-12-06 05:01:49,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13815 conditions, 6142 events. 5021/6142 cut-off events. For 981/981 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 19186 event pairs, 301 based on Foata normal form. 168/4628 useless extension candidates. Maximal degree in co-relation 7235. Up to 4928 conditions per place. [2022-12-06 05:01:49,315 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 74 selfloop transitions, 13 changer transitions 7/94 dead transitions. [2022-12-06 05:01:49,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 94 transitions, 425 flow [2022-12-06 05:01:49,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:01:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:01:49,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-06 05:01:49,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6351351351351351 [2022-12-06 05:01:49,318 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 105 flow. Second operand 4 states and 94 transitions. [2022-12-06 05:01:49,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 94 transitions, 425 flow [2022-12-06 05:01:49,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 94 transitions, 420 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:01:49,320 INFO L231 Difference]: Finished difference. Result has 45 places, 51 transitions, 191 flow [2022-12-06 05:01:49,321 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=45, PETRI_TRANSITIONS=51} [2022-12-06 05:01:49,321 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2022-12-06 05:01:49,321 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:49,321 INFO L89 Accepts]: Start accepts. Operand has 45 places, 51 transitions, 191 flow [2022-12-06 05:01:49,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:49,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:49,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 51 transitions, 191 flow [2022-12-06 05:01:49,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 51 transitions, 191 flow [2022-12-06 05:01:49,333 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L81-1-->L81-1: Formula: (and (= (* v_~x6~0_46 2) v_~x6~0_45) (< (mod v_~x6~0_46 4294967296) (mod v_~n~0_58 4294967296))) InVars {~x6~0=v_~x6~0_46, ~n~0=v_~n~0_58} OutVars{~x6~0=v_~x6~0_45, ~n~0=v_~n~0_58} AuxVars[] AssignedVars[~x6~0][37], [Black: 177#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 147#L49-1true, Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 59#L57-1true, 32#L73-1true, 11#L41-1true, 93#L65-1true, 117#L108-4true, 36#L81-1true, 174#true]) [2022-12-06 05:01:49,333 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:01:49,333 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:01:49,333 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:01:49,333 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:01:49,334 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L81-1-->L81-1: Formula: (and (= (* v_~x6~0_46 2) v_~x6~0_45) (< (mod v_~x6~0_46 4294967296) (mod v_~n~0_58 4294967296))) InVars {~x6~0=v_~x6~0_46, ~n~0=v_~n~0_58} OutVars{~x6~0=v_~x6~0_45, ~n~0=v_~n~0_58} AuxVars[] AssignedVars[~x6~0][37], [Black: 177#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 147#L49-1true, Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 59#L57-1true, 32#L73-1true, 11#L41-1true, 93#L65-1true, 117#L108-4true, 36#L81-1true, Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 174#true]) [2022-12-06 05:01:49,334 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 05:01:49,334 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:01:49,335 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:01:49,335 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:01:49,343 INFO L130 PetriNetUnfolder]: 96/192 cut-off events. [2022-12-06 05:01:49,343 INFO L131 PetriNetUnfolder]: For 49/57 co-relation queries the response was YES. [2022-12-06 05:01:49,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 192 events. 96/192 cut-off events. For 49/57 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 453 event pairs, 1 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 292. Up to 71 conditions per place. [2022-12-06 05:01:49,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 51 transitions, 191 flow [2022-12-06 05:01:49,347 INFO L188 LiptonReduction]: Number of co-enabled transitions 764 [2022-12-06 05:01:49,348 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:49,349 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 05:01:49,349 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 51 transitions, 191 flow [2022-12-06 05:01:49,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:49,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:49,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:49,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:01:49,350 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 4 more)] === [2022-12-06 05:01:49,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:49,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1792923337, now seen corresponding path program 1 times [2022-12-06 05:01:49,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:49,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636521419] [2022-12-06 05:01:49,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:49,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:49,637 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:01:49,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:49,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636521419] [2022-12-06 05:01:49,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636521419] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:49,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442680583] [2022-12-06 05:01:49,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:49,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:49,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:49,644 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:01:49,654 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:01:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:49,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:01:49,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:49,973 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:01:49,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:01:49,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442680583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:49,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:01:49,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2022-12-06 05:01:49,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322534121] [2022-12-06 05:01:49,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:49,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:01:49,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:49,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:01:49,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:01:49,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:01:49,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 51 transitions, 191 flow. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:49,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:49,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:01:49,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:50,605 INFO L130 PetriNetUnfolder]: 6737/8223 cut-off events. [2022-12-06 05:01:50,606 INFO L131 PetriNetUnfolder]: For 5845/5845 co-relation queries the response was YES. [2022-12-06 05:01:50,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23188 conditions, 8223 events. 6737/8223 cut-off events. For 5845/5845 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 25321 event pairs, 2303 based on Foata normal form. 1/8224 useless extension candidates. Maximal degree in co-relation 11873. Up to 5314 conditions per place. [2022-12-06 05:01:50,659 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 71 selfloop transitions, 13 changer transitions 1/85 dead transitions. [2022-12-06 05:01:50,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 85 transitions, 456 flow [2022-12-06 05:01:50,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:01:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:01:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-06 05:01:50,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2022-12-06 05:01:50,662 INFO L175 Difference]: Start difference. First operand has 45 places, 51 transitions, 191 flow. Second operand 3 states and 72 transitions. [2022-12-06 05:01:50,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 85 transitions, 456 flow [2022-12-06 05:01:50,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 85 transitions, 456 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 05:01:50,671 INFO L231 Difference]: Finished difference. Result has 48 places, 55 transitions, 256 flow [2022-12-06 05:01:50,672 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=48, PETRI_TRANSITIONS=55} [2022-12-06 05:01:50,673 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2022-12-06 05:01:50,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:50,673 INFO L89 Accepts]: Start accepts. Operand has 48 places, 55 transitions, 256 flow [2022-12-06 05:01:50,675 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:50,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:50,675 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 55 transitions, 256 flow [2022-12-06 05:01:50,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 55 transitions, 256 flow [2022-12-06 05:01:50,685 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L81-1-->L81-1: Formula: (and (= (* v_~x6~0_46 2) v_~x6~0_45) (< (mod v_~x6~0_46 4294967296) (mod v_~n~0_58 4294967296))) InVars {~x6~0=v_~x6~0_46, ~n~0=v_~n~0_58} OutVars{~x6~0=v_~x6~0_45, ~n~0=v_~n~0_58} AuxVars[] AssignedVars[~x6~0][41], [172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 59#L57-1true, 32#L73-1true, 117#L108-4true, 36#L81-1true, 174#true, Black: 177#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 147#L49-1true, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 180#true, 11#L41-1true, 93#L65-1true]) [2022-12-06 05:01:50,685 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:01:50,685 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:01:50,685 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:01:50,685 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:01:50,693 INFO L130 PetriNetUnfolder]: 96/200 cut-off events. [2022-12-06 05:01:50,693 INFO L131 PetriNetUnfolder]: For 78/145 co-relation queries the response was YES. [2022-12-06 05:01:50,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 200 events. 96/200 cut-off events. For 78/145 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 525 event pairs, 5 based on Foata normal form. 1/166 useless extension candidates. Maximal degree in co-relation 382. Up to 63 conditions per place. [2022-12-06 05:01:50,696 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 55 transitions, 256 flow [2022-12-06 05:01:50,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 896 [2022-12-06 05:01:50,703 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:50,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 05:01:50,706 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 55 transitions, 256 flow [2022-12-06 05:01:50,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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:01:50,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:50,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:50,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 05:01:50,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:50,912 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 4 more)] === [2022-12-06 05:01:50,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:50,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1123309206, now seen corresponding path program 1 times [2022-12-06 05:01:50,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:50,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327535715] [2022-12-06 05:01:50,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:50,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:51,203 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:01:51,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:51,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327535715] [2022-12-06 05:01:51,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327535715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:51,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:01:51,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:01:51,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841437422] [2022-12-06 05:01:51,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:51,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:01:51,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:51,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:01:51,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:01:51,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:01:51,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 55 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:51,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:51,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:01:51,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:51,971 INFO L130 PetriNetUnfolder]: 6581/8067 cut-off events. [2022-12-06 05:01:51,972 INFO L131 PetriNetUnfolder]: For 10006/10006 co-relation queries the response was YES. [2022-12-06 05:01:51,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25610 conditions, 8067 events. 6581/8067 cut-off events. For 10006/10006 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 26093 event pairs, 1203 based on Foata normal form. 156/8223 useless extension candidates. Maximal degree in co-relation 13574. Up to 6853 conditions per place. [2022-12-06 05:01:52,009 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 80 selfloop transitions, 19 changer transitions 9/108 dead transitions. [2022-12-06 05:01:52,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 644 flow [2022-12-06 05:01:52,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:01:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:01:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-06 05:01:52,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6351351351351351 [2022-12-06 05:01:52,011 INFO L175 Difference]: Start difference. First operand has 48 places, 55 transitions, 256 flow. Second operand 4 states and 94 transitions. [2022-12-06 05:01:52,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 644 flow [2022-12-06 05:01:52,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 108 transitions, 619 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 05:01:52,022 INFO L231 Difference]: Finished difference. Result has 51 places, 63 transitions, 336 flow [2022-12-06 05:01:52,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=336, PETRI_PLACES=51, PETRI_TRANSITIONS=63} [2022-12-06 05:01:52,022 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2022-12-06 05:01:52,023 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:52,023 INFO L89 Accepts]: Start accepts. Operand has 51 places, 63 transitions, 336 flow [2022-12-06 05:01:52,024 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:52,024 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:52,024 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 63 transitions, 336 flow [2022-12-06 05:01:52,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 63 transitions, 336 flow [2022-12-06 05:01:52,037 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L81-1-->L81-1: Formula: (and (= (* v_~x6~0_46 2) v_~x6~0_45) (< (mod v_~x6~0_46 4294967296) (mod v_~n~0_58 4294967296))) InVars {~x6~0=v_~x6~0_46, ~n~0=v_~n~0_58} OutVars{~x6~0=v_~x6~0_45, ~n~0=v_~n~0_58} AuxVars[] AssignedVars[~x6~0][47], [172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 59#L57-1true, 32#L73-1true, 117#L108-4true, 36#L81-1true, 174#true, Black: 177#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 147#L49-1true, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 11#L41-1true, 93#L65-1true, Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 279#true]) [2022-12-06 05:01:52,038 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:01:52,038 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:01:52,038 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:01:52,038 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:01:52,041 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L81-1-->L81-1: Formula: (and (= (* v_~x6~0_46 2) v_~x6~0_45) (< (mod v_~x6~0_46 4294967296) (mod v_~n~0_58 4294967296))) InVars {~x6~0=v_~x6~0_46, ~n~0=v_~n~0_58} OutVars{~x6~0=v_~x6~0_45, ~n~0=v_~n~0_58} AuxVars[] AssignedVars[~x6~0][47], [59#L57-1true, 32#L73-1true, 36#L81-1true, 117#L108-4true, Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 174#true, 94#thread1EXITtrue, Black: 177#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 147#L49-1true, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 93#L65-1true, Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 279#true]) [2022-12-06 05:01:52,041 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-06 05:01:52,041 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:01:52,041 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:01:52,041 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:01:52,042 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L81-1-->L81-1: Formula: (and (= (* v_~x6~0_46 2) v_~x6~0_45) (< (mod v_~x6~0_46 4294967296) (mod v_~n~0_58 4294967296))) InVars {~x6~0=v_~x6~0_46, ~n~0=v_~n~0_58} OutVars{~x6~0=v_~x6~0_45, ~n~0=v_~n~0_58} AuxVars[] AssignedVars[~x6~0][47], [59#L57-1true, 44#thread2EXITtrue, 32#L73-1true, 36#L81-1true, 117#L108-4true, Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 174#true, Black: 177#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 11#L41-1true, Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 93#L65-1true, 279#true]) [2022-12-06 05:01:52,042 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-06 05:01:52,042 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:01:52,042 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:01:52,043 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:01:52,050 INFO L130 PetriNetUnfolder]: 227/400 cut-off events. [2022-12-06 05:01:52,050 INFO L131 PetriNetUnfolder]: For 199/232 co-relation queries the response was YES. [2022-12-06 05:01:52,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 400 events. 227/400 cut-off events. For 199/232 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1288 event pairs, 8 based on Foata normal form. 1/330 useless extension candidates. Maximal degree in co-relation 818. Up to 146 conditions per place. [2022-12-06 05:01:52,058 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 63 transitions, 336 flow [2022-12-06 05:01:52,058 INFO L188 LiptonReduction]: Number of co-enabled transitions 1006 [2022-12-06 05:01:52,059 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:52,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 05:01:52,060 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 63 transitions, 336 flow [2022-12-06 05:01:52,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:52,060 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:52,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:01:52,061 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 4 more)] === [2022-12-06 05:01:52,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:52,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1861717892, now seen corresponding path program 2 times [2022-12-06 05:01:52,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:52,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70805617] [2022-12-06 05:01:52,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:52,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:01:52,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:52,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70805617] [2022-12-06 05:01:52,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70805617] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:52,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717557729] [2022-12-06 05:01:52,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:01:52,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:52,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:52,268 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:01:52,271 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:01:52,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 05:01:52,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:01:52,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:01:52,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:01:52,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:01:52,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717557729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:52,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:01:52,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2022-12-06 05:01:52,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240595027] [2022-12-06 05:01:52,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:52,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:01:52,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:52,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:01:52,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:01:52,491 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:01:52,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 63 transitions, 336 flow. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:52,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:52,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:01:52,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:53,335 INFO L130 PetriNetUnfolder]: 9661/11781 cut-off events. [2022-12-06 05:01:53,335 INFO L131 PetriNetUnfolder]: For 13779/13779 co-relation queries the response was YES. [2022-12-06 05:01:53,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36266 conditions, 11781 events. 9661/11781 cut-off events. For 13779/13779 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 37948 event pairs, 3323 based on Foata normal form. 1/11782 useless extension candidates. Maximal degree in co-relation 17929. Up to 6938 conditions per place. [2022-12-06 05:01:53,399 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 77 selfloop transitions, 13 changer transitions 1/91 dead transitions. [2022-12-06 05:01:53,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 91 transitions, 613 flow [2022-12-06 05:01:53,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:01:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:01:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-06 05:01:53,401 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5765765765765766 [2022-12-06 05:01:53,401 INFO L175 Difference]: Start difference. First operand has 51 places, 63 transitions, 336 flow. Second operand 3 states and 64 transitions. [2022-12-06 05:01:53,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 91 transitions, 613 flow [2022-12-06 05:01:53,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 91 transitions, 596 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:01:53,414 INFO L231 Difference]: Finished difference. Result has 53 places, 65 transitions, 372 flow [2022-12-06 05:01:53,414 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=372, PETRI_PLACES=53, PETRI_TRANSITIONS=65} [2022-12-06 05:01:53,415 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2022-12-06 05:01:53,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:53,415 INFO L89 Accepts]: Start accepts. Operand has 53 places, 65 transitions, 372 flow [2022-12-06 05:01:53,417 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:53,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:53,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 65 transitions, 372 flow [2022-12-06 05:01:53,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 65 transitions, 372 flow [2022-12-06 05:01:53,446 INFO L130 PetriNetUnfolder]: 227/404 cut-off events. [2022-12-06 05:01:53,446 INFO L131 PetriNetUnfolder]: For 287/392 co-relation queries the response was YES. [2022-12-06 05:01:53,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 404 events. 227/404 cut-off events. For 287/392 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1333 event pairs, 8 based on Foata normal form. 1/337 useless extension candidates. Maximal degree in co-relation 916. Up to 134 conditions per place. [2022-12-06 05:01:53,454 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 65 transitions, 372 flow [2022-12-06 05:01:53,454 INFO L188 LiptonReduction]: Number of co-enabled transitions 1086 [2022-12-06 05:01:53,455 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:53,456 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 05:01:53,456 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 65 transitions, 372 flow [2022-12-06 05:01:53,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:53,456 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:53,457 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:53,465 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:01:53,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:53,662 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 4 more)] === [2022-12-06 05:01:53,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash -884258649, now seen corresponding path program 1 times [2022-12-06 05:01:53,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:53,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140331772] [2022-12-06 05:01:53,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:53,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:53,959 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:01:53,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:53,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140331772] [2022-12-06 05:01:53,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140331772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:53,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:01:53,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:01:53,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392613705] [2022-12-06 05:01:53,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:53,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:01:53,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:53,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:01:53,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:01:53,962 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:01:53,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 65 transitions, 372 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:53,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:53,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:01:53,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:54,861 INFO L130 PetriNetUnfolder]: 9535/11655 cut-off events. [2022-12-06 05:01:54,861 INFO L131 PetriNetUnfolder]: For 18618/18618 co-relation queries the response was YES. [2022-12-06 05:01:54,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37615 conditions, 11655 events. 9535/11655 cut-off events. For 18618/18618 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 38860 event pairs, 2759 based on Foata normal form. 126/11781 useless extension candidates. Maximal degree in co-relation 20673. Up to 10441 conditions per place. [2022-12-06 05:01:54,990 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 80 selfloop transitions, 27 changer transitions 15/122 dead transitions. [2022-12-06 05:01:54,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 122 transitions, 830 flow [2022-12-06 05:01:54,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:01:54,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:01:54,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-06 05:01:54,992 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6351351351351351 [2022-12-06 05:01:54,992 INFO L175 Difference]: Start difference. First operand has 53 places, 65 transitions, 372 flow. Second operand 4 states and 94 transitions. [2022-12-06 05:01:54,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 122 transitions, 830 flow [2022-12-06 05:01:55,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 122 transitions, 817 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:01:55,008 INFO L231 Difference]: Finished difference. Result has 56 places, 75 transitions, 510 flow [2022-12-06 05:01:55,009 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=510, PETRI_PLACES=56, PETRI_TRANSITIONS=75} [2022-12-06 05:01:55,009 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2022-12-06 05:01:55,009 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:55,009 INFO L89 Accepts]: Start accepts. Operand has 56 places, 75 transitions, 510 flow [2022-12-06 05:01:55,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:55,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:55,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 75 transitions, 510 flow [2022-12-06 05:01:55,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 75 transitions, 510 flow [2022-12-06 05:01:55,051 INFO L130 PetriNetUnfolder]: 367/663 cut-off events. [2022-12-06 05:01:55,051 INFO L131 PetriNetUnfolder]: For 565/677 co-relation queries the response was YES. [2022-12-06 05:01:55,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1670 conditions, 663 events. 367/663 cut-off events. For 565/677 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2832 event pairs, 31 based on Foata normal form. 1/556 useless extension candidates. Maximal degree in co-relation 1526. Up to 188 conditions per place. [2022-12-06 05:01:55,063 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 75 transitions, 510 flow [2022-12-06 05:01:55,063 INFO L188 LiptonReduction]: Number of co-enabled transitions 1216 [2022-12-06 05:01:55,065 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:55,065 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 05:01:55,065 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 75 transitions, 510 flow [2022-12-06 05:01:55,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:55,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:55,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:55,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:01:55,066 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 4 more)] === [2022-12-06 05:01:55,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:55,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1810715049, now seen corresponding path program 1 times [2022-12-06 05:01:55,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:55,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512739652] [2022-12-06 05:01:55,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:55,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:01:55,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:55,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512739652] [2022-12-06 05:01:55,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512739652] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:55,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448675603] [2022-12-06 05:01:55,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:55,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:55,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:55,254 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:01:55,304 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:01:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:55,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:01:55,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:55,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:01:55,465 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:01:55,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448675603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:55,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:01:55,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2022-12-06 05:01:55,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302027619] [2022-12-06 05:01:55,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:55,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:01:55,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:55,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:01:55,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:01:55,467 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:01:55,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 75 transitions, 510 flow. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:55,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:55,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:01:55,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:56,668 INFO L130 PetriNetUnfolder]: 12615/15369 cut-off events. [2022-12-06 05:01:56,668 INFO L131 PetriNetUnfolder]: For 25466/25466 co-relation queries the response was YES. [2022-12-06 05:01:56,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51055 conditions, 15369 events. 12615/15369 cut-off events. For 25466/25466 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 51483 event pairs, 5569 based on Foata normal form. 1/15370 useless extension candidates. Maximal degree in co-relation 24317. Up to 8756 conditions per place. [2022-12-06 05:01:56,809 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 89 selfloop transitions, 13 changer transitions 9/111 dead transitions. [2022-12-06 05:01:56,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 111 transitions, 855 flow [2022-12-06 05:01:56,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:01:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:01:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-06 05:01:56,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2022-12-06 05:01:56,812 INFO L175 Difference]: Start difference. First operand has 56 places, 75 transitions, 510 flow. Second operand 3 states and 72 transitions. [2022-12-06 05:01:56,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 111 transitions, 855 flow [2022-12-06 05:01:56,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 111 transitions, 830 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:01:56,839 INFO L231 Difference]: Finished difference. Result has 58 places, 77 transitions, 538 flow [2022-12-06 05:01:56,839 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=538, PETRI_PLACES=58, PETRI_TRANSITIONS=77} [2022-12-06 05:01:56,840 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2022-12-06 05:01:56,840 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:56,840 INFO L89 Accepts]: Start accepts. Operand has 58 places, 77 transitions, 538 flow [2022-12-06 05:01:56,842 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:56,842 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:56,842 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 77 transitions, 538 flow [2022-12-06 05:01:56,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 77 transitions, 538 flow [2022-12-06 05:01:56,883 INFO L130 PetriNetUnfolder]: 408/744 cut-off events. [2022-12-06 05:01:56,883 INFO L131 PetriNetUnfolder]: For 690/818 co-relation queries the response was YES. [2022-12-06 05:01:56,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1935 conditions, 744 events. 408/744 cut-off events. For 690/818 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3323 event pairs, 29 based on Foata normal form. 2/619 useless extension candidates. Maximal degree in co-relation 1762. Up to 250 conditions per place. [2022-12-06 05:01:56,898 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 77 transitions, 538 flow [2022-12-06 05:01:56,898 INFO L188 LiptonReduction]: Number of co-enabled transitions 1268 [2022-12-06 05:01:56,900 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:56,900 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 05:01:56,900 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 77 transitions, 538 flow [2022-12-06 05:01:56,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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:01:56,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:56,901 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:56,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 05:01:57,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:57,112 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 4 more)] === [2022-12-06 05:01:57,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:57,112 INFO L85 PathProgramCache]: Analyzing trace with hash -380031148, now seen corresponding path program 1 times [2022-12-06 05:01:57,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:57,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305287] [2022-12-06 05:01:57,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:57,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:01:57,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:57,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305287] [2022-12-06 05:01:57,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305287] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:57,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625273964] [2022-12-06 05:01:57,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:57,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:57,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:57,303 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:01:57,306 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:01:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:57,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:01:57,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:57,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:01:57,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:01:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:01:57,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625273964] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:01:57,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:01:57,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 05:01:57,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131194266] [2022-12-06 05:01:57,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:01:57,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:01:57,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:57,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:01:57,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:01:57,560 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:01:57,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 77 transitions, 538 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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:01:57,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:57,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:01:57,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:59,106 INFO L130 PetriNetUnfolder]: 17771/21680 cut-off events. [2022-12-06 05:01:59,107 INFO L131 PetriNetUnfolder]: For 39438/39438 co-relation queries the response was YES. [2022-12-06 05:01:59,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74238 conditions, 21680 events. 17771/21680 cut-off events. For 39438/39438 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 79348 event pairs, 3875 based on Foata normal form. 565/22245 useless extension candidates. Maximal degree in co-relation 39334. Up to 8936 conditions per place. [2022-12-06 05:01:59,186 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 127 selfloop transitions, 32 changer transitions 35/194 dead transitions. [2022-12-06 05:01:59,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 194 transitions, 1337 flow [2022-12-06 05:01:59,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:01:59,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:01:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2022-12-06 05:01:59,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2022-12-06 05:01:59,188 INFO L175 Difference]: Start difference. First operand has 58 places, 77 transitions, 538 flow. Second operand 6 states and 155 transitions. [2022-12-06 05:01:59,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 194 transitions, 1337 flow [2022-12-06 05:01:59,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 194 transitions, 1324 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:01:59,228 INFO L231 Difference]: Finished difference. Result has 64 places, 79 transitions, 620 flow [2022-12-06 05:01:59,228 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=620, PETRI_PLACES=64, PETRI_TRANSITIONS=79} [2022-12-06 05:01:59,229 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2022-12-06 05:01:59,229 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:59,229 INFO L89 Accepts]: Start accepts. Operand has 64 places, 79 transitions, 620 flow [2022-12-06 05:01:59,230 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:59,230 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:59,230 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 79 transitions, 620 flow [2022-12-06 05:01:59,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 79 transitions, 620 flow [2022-12-06 05:01:59,277 INFO L130 PetriNetUnfolder]: 432/929 cut-off events. [2022-12-06 05:01:59,278 INFO L131 PetriNetUnfolder]: For 1157/1298 co-relation queries the response was YES. [2022-12-06 05:01:59,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2478 conditions, 929 events. 432/929 cut-off events. For 1157/1298 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5064 event pairs, 31 based on Foata normal form. 0/797 useless extension candidates. Maximal degree in co-relation 2173. Up to 317 conditions per place. [2022-12-06 05:01:59,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 79 transitions, 620 flow [2022-12-06 05:01:59,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 05:01:59,293 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:59,294 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-06 05:01:59,294 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 79 transitions, 620 flow [2022-12-06 05:01:59,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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:01:59,294 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:59,294 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:59,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:01:59,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:59,495 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 4 more)] === [2022-12-06 05:01:59,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:59,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1566953028, now seen corresponding path program 1 times [2022-12-06 05:01:59,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:59,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539107399] [2022-12-06 05:01:59,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:59,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:01:59,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:59,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539107399] [2022-12-06 05:01:59,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539107399] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:59,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828604689] [2022-12-06 05:01:59,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:59,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:59,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:59,713 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:01:59,715 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:01:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:59,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:01:59,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:01:59,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:01:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:01:59,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828604689] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:01:59,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:01:59,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 05:01:59,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777644324] [2022-12-06 05:01:59,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:01:59,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:01:59,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:59,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:01:59,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:01:59,981 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:01:59,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 79 transitions, 620 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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:01:59,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:59,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:01:59,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:01,913 INFO L130 PetriNetUnfolder]: 23171/28330 cut-off events. [2022-12-06 05:02:01,913 INFO L131 PetriNetUnfolder]: For 66981/66981 co-relation queries the response was YES. [2022-12-06 05:02:01,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103779 conditions, 28330 events. 23171/28330 cut-off events. For 66981/66981 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 108717 event pairs, 3641 based on Foata normal form. 757/29087 useless extension candidates. Maximal degree in co-relation 59241. Up to 10010 conditions per place. [2022-12-06 05:02:02,030 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 142 selfloop transitions, 32 changer transitions 18/192 dead transitions. [2022-12-06 05:02:02,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 192 transitions, 1497 flow [2022-12-06 05:02:02,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:02:02,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:02:02,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2022-12-06 05:02:02,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6441441441441441 [2022-12-06 05:02:02,032 INFO L175 Difference]: Start difference. First operand has 64 places, 79 transitions, 620 flow. Second operand 6 states and 143 transitions. [2022-12-06 05:02:02,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 192 transitions, 1497 flow [2022-12-06 05:02:02,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 192 transitions, 1439 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 05:02:02,101 INFO L231 Difference]: Finished difference. Result has 69 places, 81 transitions, 673 flow [2022-12-06 05:02:02,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=673, PETRI_PLACES=69, PETRI_TRANSITIONS=81} [2022-12-06 05:02:02,102 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2022-12-06 05:02:02,102 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:02,102 INFO L89 Accepts]: Start accepts. Operand has 69 places, 81 transitions, 673 flow [2022-12-06 05:02:02,103 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:02,104 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:02,104 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 81 transitions, 673 flow [2022-12-06 05:02:02,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 81 transitions, 673 flow [2022-12-06 05:02:02,160 INFO L130 PetriNetUnfolder]: 426/1010 cut-off events. [2022-12-06 05:02:02,160 INFO L131 PetriNetUnfolder]: For 1338/1667 co-relation queries the response was YES. [2022-12-06 05:02:02,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2877 conditions, 1010 events. 426/1010 cut-off events. For 1338/1667 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6143 event pairs, 30 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 2497. Up to 358 conditions per place. [2022-12-06 05:02:02,173 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 81 transitions, 673 flow [2022-12-06 05:02:02,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 1392 [2022-12-06 05:02:02,176 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:02,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 05:02:02,177 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 81 transitions, 673 flow [2022-12-06 05:02:02,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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:02:02,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:02,177 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:02,185 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:02:02,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:02,386 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 4 more)] === [2022-12-06 05:02:02,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:02,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1775078782, now seen corresponding path program 1 times [2022-12-06 05:02:02,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:02,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706078272] [2022-12-06 05:02:02,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:02,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:02:02,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:02,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706078272] [2022-12-06 05:02:02,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706078272] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:02:02,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771598220] [2022-12-06 05:02:02,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:02,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:02,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:02:02,684 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:02:02,687 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:02:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:02,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:02:02,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:02:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:02:02,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:02:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:02:02,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771598220] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:02:02,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:02:02,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 05:02:02,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689465315] [2022-12-06 05:02:02,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:02:02,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:02:02,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:02,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:02:02,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:02:02,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:02:02,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 81 transitions, 673 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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:02:02,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:02,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:02:02,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:05,614 INFO L130 PetriNetUnfolder]: 32931/40393 cut-off events. [2022-12-06 05:02:05,615 INFO L131 PetriNetUnfolder]: For 118631/118631 co-relation queries the response was YES. [2022-12-06 05:02:05,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158874 conditions, 40393 events. 32931/40393 cut-off events. For 118631/118631 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 168110 event pairs, 4753 based on Foata normal form. 1321/41714 useless extension candidates. Maximal degree in co-relation 81011. Up to 17631 conditions per place. [2022-12-06 05:02:05,786 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 165 selfloop transitions, 30 changer transitions 25/220 dead transitions. [2022-12-06 05:02:05,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 220 transitions, 1816 flow [2022-12-06 05:02:05,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:02:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:02:05,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2022-12-06 05:02:05,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6801801801801802 [2022-12-06 05:02:05,787 INFO L175 Difference]: Start difference. First operand has 69 places, 81 transitions, 673 flow. Second operand 6 states and 151 transitions. [2022-12-06 05:02:05,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 220 transitions, 1816 flow [2022-12-06 05:02:05,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 220 transitions, 1752 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 05:02:05,971 INFO L231 Difference]: Finished difference. Result has 74 places, 83 transitions, 716 flow [2022-12-06 05:02:05,972 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=716, PETRI_PLACES=74, PETRI_TRANSITIONS=83} [2022-12-06 05:02:05,972 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 24 predicate places. [2022-12-06 05:02:05,972 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:05,972 INFO L89 Accepts]: Start accepts. Operand has 74 places, 83 transitions, 716 flow [2022-12-06 05:02:05,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:05,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:05,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 83 transitions, 716 flow [2022-12-06 05:02:05,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 83 transitions, 716 flow [2022-12-06 05:02:06,029 INFO L130 PetriNetUnfolder]: 420/1104 cut-off events. [2022-12-06 05:02:06,030 INFO L131 PetriNetUnfolder]: For 1256/1709 co-relation queries the response was YES. [2022-12-06 05:02:06,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3085 conditions, 1104 events. 420/1104 cut-off events. For 1256/1709 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7335 event pairs, 32 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 2615. Up to 361 conditions per place. [2022-12-06 05:02:06,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 83 transitions, 716 flow [2022-12-06 05:02:06,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 1540 [2022-12-06 05:02:06,049 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:06,050 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 05:02:06,050 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 83 transitions, 716 flow [2022-12-06 05:02:06,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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:02:06,050 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:06,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:06,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 05:02:06,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:06,260 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 4 more)] === [2022-12-06 05:02:06,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:06,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1899891782, now seen corresponding path program 1 times [2022-12-06 05:02:06,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:06,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413710863] [2022-12-06 05:02:06,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:06,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:02:06,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:06,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413710863] [2022-12-06 05:02:06,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413710863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:06,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:06,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:02:06,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267608751] [2022-12-06 05:02:06,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:06,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:02:06,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:06,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:02:06,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:02:06,442 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:02:06,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 83 transitions, 716 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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:02:06,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:06,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:02:06,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:09,658 INFO L130 PetriNetUnfolder]: 37866/46390 cut-off events. [2022-12-06 05:02:09,658 INFO L131 PetriNetUnfolder]: For 156657/156657 co-relation queries the response was YES. [2022-12-06 05:02:09,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197452 conditions, 46390 events. 37866/46390 cut-off events. For 156657/156657 co-relation queries the response was YES. Maximal size of possible extension queue 1196. Compared 191269 event pairs, 12238 based on Foata normal form. 1116/47506 useless extension candidates. Maximal degree in co-relation 102719. Up to 40691 conditions per place. [2022-12-06 05:02:09,854 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 100 selfloop transitions, 26 changer transitions 12/138 dead transitions. [2022-12-06 05:02:09,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 138 transitions, 1247 flow [2022-12-06 05:02:09,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:02:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:02:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-06 05:02:09,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2022-12-06 05:02:09,855 INFO L175 Difference]: Start difference. First operand has 74 places, 83 transitions, 716 flow. Second operand 4 states and 92 transitions. [2022-12-06 05:02:09,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 138 transitions, 1247 flow [2022-12-06 05:02:10,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 138 transitions, 1184 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 05:02:10,589 INFO L231 Difference]: Finished difference. Result has 75 places, 84 transitions, 730 flow [2022-12-06 05:02:10,590 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=730, PETRI_PLACES=75, PETRI_TRANSITIONS=84} [2022-12-06 05:02:10,590 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 25 predicate places. [2022-12-06 05:02:10,590 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:10,590 INFO L89 Accepts]: Start accepts. Operand has 75 places, 84 transitions, 730 flow [2022-12-06 05:02:10,591 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:10,591 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:10,591 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 84 transitions, 730 flow [2022-12-06 05:02:10,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 84 transitions, 730 flow [2022-12-06 05:02:10,679 INFO L130 PetriNetUnfolder]: 470/1215 cut-off events. [2022-12-06 05:02:10,679 INFO L131 PetriNetUnfolder]: For 1330/1808 co-relation queries the response was YES. [2022-12-06 05:02:10,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3519 conditions, 1215 events. 470/1215 cut-off events. For 1330/1808 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8253 event pairs, 43 based on Foata normal form. 0/1063 useless extension candidates. Maximal degree in co-relation 3024. Up to 419 conditions per place. [2022-12-06 05:02:10,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 84 transitions, 730 flow [2022-12-06 05:02:10,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 1584 [2022-12-06 05:02:10,708 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:10,708 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-06 05:02:10,709 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 84 transitions, 730 flow [2022-12-06 05:02:10,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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:02:10,709 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:10,709 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:10,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:02:10,709 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 4 more)] === [2022-12-06 05:02:10,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:10,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1181021440, now seen corresponding path program 2 times [2022-12-06 05:02:10,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:10,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83440904] [2022-12-06 05:02:10,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:10,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:10,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:02:10,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:10,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83440904] [2022-12-06 05:02:10,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83440904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:10,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:10,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:02:10,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852785157] [2022-12-06 05:02:10,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:10,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:02:10,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:10,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:02:10,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:02:10,913 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:02:10,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 84 transitions, 730 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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:02:10,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:10,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:02:10,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:14,574 INFO L130 PetriNetUnfolder]: 43850/53622 cut-off events. [2022-12-06 05:02:14,574 INFO L131 PetriNetUnfolder]: For 168551/168551 co-relation queries the response was YES. [2022-12-06 05:02:14,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229870 conditions, 53622 events. 43850/53622 cut-off events. For 168551/168551 co-relation queries the response was YES. Maximal size of possible extension queue 1370. Compared 224552 event pairs, 14414 based on Foata normal form. 1248/54870 useless extension candidates. Maximal degree in co-relation 125128. Up to 47075 conditions per place. [2022-12-06 05:02:14,836 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 105 selfloop transitions, 26 changer transitions 12/143 dead transitions. [2022-12-06 05:02:14,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 143 transitions, 1307 flow [2022-12-06 05:02:14,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:02:14,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:02:14,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-06 05:02:14,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2022-12-06 05:02:14,837 INFO L175 Difference]: Start difference. First operand has 75 places, 84 transitions, 730 flow. Second operand 4 states and 92 transitions. [2022-12-06 05:02:14,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 143 transitions, 1307 flow [2022-12-06 05:02:15,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 143 transitions, 1258 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 05:02:15,439 INFO L231 Difference]: Finished difference. Result has 77 places, 85 transitions, 746 flow [2022-12-06 05:02:15,439 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=746, PETRI_PLACES=77, PETRI_TRANSITIONS=85} [2022-12-06 05:02:15,440 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 27 predicate places. [2022-12-06 05:02:15,440 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:15,440 INFO L89 Accepts]: Start accepts. Operand has 77 places, 85 transitions, 746 flow [2022-12-06 05:02:15,441 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:15,441 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:15,441 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 85 transitions, 746 flow [2022-12-06 05:02:15,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 85 transitions, 746 flow [2022-12-06 05:02:15,534 INFO L130 PetriNetUnfolder]: 493/1223 cut-off events. [2022-12-06 05:02:15,534 INFO L131 PetriNetUnfolder]: For 1428/1953 co-relation queries the response was YES. [2022-12-06 05:02:15,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3641 conditions, 1223 events. 493/1223 cut-off events. For 1428/1953 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 8106 event pairs, 42 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 3169. Up to 432 conditions per place. [2022-12-06 05:02:15,563 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 85 transitions, 746 flow [2022-12-06 05:02:15,563 INFO L188 LiptonReduction]: Number of co-enabled transitions 1648 [2022-12-06 05:02:15,569 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [498] L65-1-->L65-1: Formula: (and (< (mod v_~x4~0_28 4294967296) (mod v_~n~0_46 4294967296)) (= v_~x4~0_27 (* v_~x4~0_28 2))) InVars {~x4~0=v_~x4~0_28, ~n~0=v_~n~0_46} OutVars{~x4~0=v_~x4~0_27, ~n~0=v_~n~0_46} AuxVars[] AssignedVars[~x4~0] and [500] L57-1-->L57-1: Formula: (and (< (mod v_~x3~0_28 4294967296) (mod v_~n~0_48 4294967296)) (= v_~x3~0_27 (* v_~x3~0_28 2))) InVars {~x3~0=v_~x3~0_28, ~n~0=v_~n~0_48} OutVars{~x3~0=v_~x3~0_27, ~n~0=v_~n~0_48} AuxVars[] AssignedVars[~x3~0] [2022-12-06 05:02:15,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [498] L65-1-->L65-1: Formula: (and (< (mod v_~x4~0_28 4294967296) (mod v_~n~0_46 4294967296)) (= v_~x4~0_27 (* v_~x4~0_28 2))) InVars {~x4~0=v_~x4~0_28, ~n~0=v_~n~0_46} OutVars{~x4~0=v_~x4~0_27, ~n~0=v_~n~0_46} AuxVars[] AssignedVars[~x4~0] and [500] L57-1-->L57-1: Formula: (and (< (mod v_~x3~0_28 4294967296) (mod v_~n~0_48 4294967296)) (= v_~x3~0_27 (* v_~x3~0_28 2))) InVars {~x3~0=v_~x3~0_28, ~n~0=v_~n~0_48} OutVars{~x3~0=v_~x3~0_27, ~n~0=v_~n~0_48} AuxVars[] AssignedVars[~x3~0] [2022-12-06 05:02:15,632 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:02:15,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:02:15,633 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 85 transitions, 752 flow [2022-12-06 05:02:15,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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:02:15,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:15,633 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:15,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:02:15,633 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 4 more)] === [2022-12-06 05:02:15,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:15,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1278856560, now seen corresponding path program 3 times [2022-12-06 05:02:15,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:15,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866844975] [2022-12-06 05:02:15,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:15,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:15,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:02:15,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:15,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866844975] [2022-12-06 05:02:15,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866844975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:15,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:15,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:02:15,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028118315] [2022-12-06 05:02:15,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:15,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:02:15,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:15,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:02:15,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:02:15,801 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:02:15,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 85 transitions, 752 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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:02:15,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:15,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:02:15,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:19,843 INFO L130 PetriNetUnfolder]: 49282/60261 cut-off events. [2022-12-06 05:02:19,843 INFO L131 PetriNetUnfolder]: For 201902/201902 co-relation queries the response was YES. [2022-12-06 05:02:20,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264461 conditions, 60261 events. 49282/60261 cut-off events. For 201902/201902 co-relation queries the response was YES. Maximal size of possible extension queue 1564. Compared 256461 event pairs, 15740 based on Foata normal form. 837/61098 useless extension candidates. Maximal degree in co-relation 159885. Up to 54137 conditions per place. [2022-12-06 05:02:20,118 INFO L137 encePairwiseOnDemand]: 30/39 looper letters, 107 selfloop transitions, 29 changer transitions 22/158 dead transitions. [2022-12-06 05:02:20,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 158 transitions, 1403 flow [2022-12-06 05:02:20,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:02:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:02:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-12-06 05:02:20,119 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6794871794871795 [2022-12-06 05:02:20,119 INFO L175 Difference]: Start difference. First operand has 77 places, 85 transitions, 752 flow. Second operand 4 states and 106 transitions. [2022-12-06 05:02:20,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 158 transitions, 1403 flow [2022-12-06 05:02:20,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 158 transitions, 1348 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 05:02:20,945 INFO L231 Difference]: Finished difference. Result has 80 places, 91 transitions, 851 flow [2022-12-06 05:02:20,945 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=851, PETRI_PLACES=80, PETRI_TRANSITIONS=91} [2022-12-06 05:02:20,946 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 30 predicate places. [2022-12-06 05:02:20,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:20,946 INFO L89 Accepts]: Start accepts. Operand has 80 places, 91 transitions, 851 flow [2022-12-06 05:02:20,947 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:20,947 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:20,948 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 91 transitions, 851 flow [2022-12-06 05:02:20,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 91 transitions, 851 flow [2022-12-06 05:02:21,079 INFO L130 PetriNetUnfolder]: 620/1437 cut-off events. [2022-12-06 05:02:21,080 INFO L131 PetriNetUnfolder]: For 2019/3010 co-relation queries the response was YES. [2022-12-06 05:02:21,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4632 conditions, 1437 events. 620/1437 cut-off events. For 2019/3010 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 9417 event pairs, 54 based on Foata normal form. 0/1239 useless extension candidates. Maximal degree in co-relation 4138. Up to 513 conditions per place. [2022-12-06 05:02:21,118 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 91 transitions, 851 flow [2022-12-06 05:02:21,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 1786 [2022-12-06 05:02:21,122 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [487] L49-1-->L49-1: Formula: (and (= v_~x2~0_23 (* v_~x2~0_24 2)) (< (mod v_~x2~0_24 4294967296) (mod v_~n~0_42 4294967296))) InVars {~x2~0=v_~x2~0_24, ~n~0=v_~n~0_42} OutVars{~x2~0=v_~x2~0_23, ~n~0=v_~n~0_42} AuxVars[] AssignedVars[~x2~0] and [427] L41-1-->L41-1: Formula: (and (= v_~x1~0_9 (* v_~x1~0_10 2)) (< (mod v_~x1~0_10 4294967296) (mod v_~n~0_16 4294967296))) InVars {~n~0=v_~n~0_16, ~x1~0=v_~x1~0_10} OutVars{~n~0=v_~n~0_16, ~x1~0=v_~x1~0_9} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:02:21,147 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [487] L49-1-->L49-1: Formula: (and (= v_~x2~0_23 (* v_~x2~0_24 2)) (< (mod v_~x2~0_24 4294967296) (mod v_~n~0_42 4294967296))) InVars {~x2~0=v_~x2~0_24, ~n~0=v_~n~0_42} OutVars{~x2~0=v_~x2~0_23, ~n~0=v_~n~0_42} AuxVars[] AssignedVars[~x2~0] and [427] L41-1-->L41-1: Formula: (and (= v_~x1~0_9 (* v_~x1~0_10 2)) (< (mod v_~x1~0_10 4294967296) (mod v_~n~0_16 4294967296))) InVars {~n~0=v_~n~0_16, ~x1~0=v_~x1~0_10} OutVars{~n~0=v_~n~0_16, ~x1~0=v_~x1~0_9} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:02:21,179 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:02:21,180 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-06 05:02:21,180 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 91 transitions, 857 flow [2022-12-06 05:02:21,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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:02:21,180 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:21,180 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:21,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:02:21,181 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 4 more)] === [2022-12-06 05:02:21,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:21,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2137424200, now seen corresponding path program 1 times [2022-12-06 05:02:21,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:21,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599247726] [2022-12-06 05:02:21,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:21,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:02:21,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:21,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599247726] [2022-12-06 05:02:21,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599247726] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:02:21,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010329762] [2022-12-06 05:02:21,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:21,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:21,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:02:21,412 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:02:21,419 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:02:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:21,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:02:21,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:02:21,615 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:02:21,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:02:21,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010329762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:21,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:02:21,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-12-06 05:02:21,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883420138] [2022-12-06 05:02:21,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:21,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:02:21,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:21,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:02:21,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:02:21,617 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:02:21,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 91 transitions, 857 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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:02:21,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:21,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:02:21,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:25,124 INFO L130 PetriNetUnfolder]: 43628/53419 cut-off events. [2022-12-06 05:02:25,124 INFO L131 PetriNetUnfolder]: For 205646/205646 co-relation queries the response was YES. [2022-12-06 05:02:25,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243590 conditions, 53419 events. 43628/53419 cut-off events. For 205646/205646 co-relation queries the response was YES. Maximal size of possible extension queue 1385. Compared 225978 event pairs, 4442 based on Foata normal form. 1198/54617 useless extension candidates. Maximal degree in co-relation 184394. Up to 24839 conditions per place. [2022-12-06 05:02:25,529 INFO L137 encePairwiseOnDemand]: 36/41 looper letters, 126 selfloop transitions, 14 changer transitions 53/193 dead transitions. [2022-12-06 05:02:25,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 193 transitions, 1818 flow [2022-12-06 05:02:25,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:02:25,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:02:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-06 05:02:25,530 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5414634146341464 [2022-12-06 05:02:25,530 INFO L175 Difference]: Start difference. First operand has 80 places, 91 transitions, 857 flow. Second operand 5 states and 111 transitions. [2022-12-06 05:02:25,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 193 transitions, 1818 flow [2022-12-06 05:02:26,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 193 transitions, 1784 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 05:02:26,182 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 687 flow [2022-12-06 05:02:26,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=687, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2022-12-06 05:02:26,182 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 34 predicate places. [2022-12-06 05:02:26,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:26,183 INFO L89 Accepts]: Start accepts. Operand has 84 places, 77 transitions, 687 flow [2022-12-06 05:02:26,183 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:26,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:26,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 77 transitions, 687 flow [2022-12-06 05:02:26,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 687 flow [2022-12-06 05:02:26,242 INFO L130 PetriNetUnfolder]: 447/1029 cut-off events. [2022-12-06 05:02:26,242 INFO L131 PetriNetUnfolder]: For 1804/2567 co-relation queries the response was YES. [2022-12-06 05:02:26,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3486 conditions, 1029 events. 447/1029 cut-off events. For 1804/2567 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6120 event pairs, 39 based on Foata normal form. 1/897 useless extension candidates. Maximal degree in co-relation 3128. Up to 353 conditions per place. [2022-12-06 05:02:26,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 687 flow [2022-12-06 05:02:26,261 INFO L188 LiptonReduction]: Number of co-enabled transitions 1534 [2022-12-06 05:02:26,262 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:26,263 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 05:02:26,263 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 687 flow [2022-12-06 05:02:26,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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:02:26,263 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:26,263 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:26,271 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:02:26,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:26,468 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 4 more)] === [2022-12-06 05:02:26,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:26,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1181230417, now seen corresponding path program 1 times [2022-12-06 05:02:26,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:26,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336619576] [2022-12-06 05:02:26,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:26,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:02:26,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:26,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336619576] [2022-12-06 05:02:26,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336619576] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:02:26,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821030312] [2022-12-06 05:02:26,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:26,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:26,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:02:26,688 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:02:26,692 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:02:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:26,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:02:26,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:02:26,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:02:26,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:02:26,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821030312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:26,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:02:26,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-06 05:02:26,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936221544] [2022-12-06 05:02:26,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:26,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:02:26,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:26,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:02:26,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:02:26,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 05:02:26,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 687 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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:02:26,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:26,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 05:02:26,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:29,374 INFO L130 PetriNetUnfolder]: 29234/35628 cut-off events. [2022-12-06 05:02:29,374 INFO L131 PetriNetUnfolder]: For 146823/146823 co-relation queries the response was YES. [2022-12-06 05:02:29,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167184 conditions, 35628 events. 29234/35628 cut-off events. For 146823/146823 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 143055 event pairs, 2118 based on Foata normal form. 994/36622 useless extension candidates. Maximal degree in co-relation 139156. Up to 16275 conditions per place. [2022-12-06 05:02:29,552 INFO L137 encePairwiseOnDemand]: 33/38 looper letters, 131 selfloop transitions, 8 changer transitions 50/189 dead transitions. [2022-12-06 05:02:29,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 189 transitions, 1757 flow [2022-12-06 05:02:29,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:02:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:02:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-06 05:02:29,553 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5894736842105263 [2022-12-06 05:02:29,553 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 687 flow. Second operand 5 states and 112 transitions. [2022-12-06 05:02:29,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 189 transitions, 1757 flow [2022-12-06 05:02:29,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 189 transitions, 1686 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 05:02:29,975 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 551 flow [2022-12-06 05:02:29,976 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=551, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2022-12-06 05:02:29,976 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 34 predicate places. [2022-12-06 05:02:29,976 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:29,976 INFO L89 Accepts]: Start accepts. Operand has 84 places, 70 transitions, 551 flow [2022-12-06 05:02:29,977 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:29,977 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:29,977 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 70 transitions, 551 flow [2022-12-06 05:02:29,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 70 transitions, 551 flow [2022-12-06 05:02:30,017 INFO L130 PetriNetUnfolder]: 334/710 cut-off events. [2022-12-06 05:02:30,018 INFO L131 PetriNetUnfolder]: For 1133/1809 co-relation queries the response was YES. [2022-12-06 05:02:30,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2650 conditions, 710 events. 334/710 cut-off events. For 1133/1809 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3559 event pairs, 32 based on Foata normal form. 2/622 useless extension candidates. Maximal degree in co-relation 2438. Up to 269 conditions per place. [2022-12-06 05:02:30,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 70 transitions, 551 flow [2022-12-06 05:02:30,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 1406 [2022-12-06 05:02:30,032 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:30,033 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 05:02:30,033 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 70 transitions, 551 flow [2022-12-06 05:02:30,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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:02:30,033 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:30,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:30,039 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:02:30,238 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,SelfDestructingSolverStorable14 [2022-12-06 05:02:30,238 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 4 more)] === [2022-12-06 05:02:30,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:30,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1088195874, now seen corresponding path program 1 times [2022-12-06 05:02:30,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:30,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188175517] [2022-12-06 05:02:30,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:30,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:02:30,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:30,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188175517] [2022-12-06 05:02:30,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188175517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:30,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:02:30,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:02:30,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723159165] [2022-12-06 05:02:30,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:30,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:02:30,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:30,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:02:30,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:02:30,466 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:02:30,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 70 transitions, 551 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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:02:30,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:30,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:02:30,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:32,595 INFO L130 PetriNetUnfolder]: 24226/29333 cut-off events. [2022-12-06 05:02:32,595 INFO L131 PetriNetUnfolder]: For 127942/127942 co-relation queries the response was YES. [2022-12-06 05:02:32,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141891 conditions, 29333 events. 24226/29333 cut-off events. For 127942/127942 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 110323 event pairs, 3754 based on Foata normal form. 376/29709 useless extension candidates. Maximal degree in co-relation 94464. Up to 16899 conditions per place. [2022-12-06 05:02:32,745 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 102 selfloop transitions, 8 changer transitions 27/137 dead transitions. [2022-12-06 05:02:32,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 137 transitions, 1167 flow [2022-12-06 05:02:32,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:02:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:02:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-06 05:02:32,746 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5297297297297298 [2022-12-06 05:02:32,746 INFO L175 Difference]: Start difference. First operand has 82 places, 70 transitions, 551 flow. Second operand 5 states and 98 transitions. [2022-12-06 05:02:32,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 137 transitions, 1167 flow [2022-12-06 05:02:33,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 137 transitions, 1137 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:02:33,161 INFO L231 Difference]: Finished difference. Result has 85 places, 65 transitions, 481 flow [2022-12-06 05:02:33,161 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=481, PETRI_PLACES=85, PETRI_TRANSITIONS=65} [2022-12-06 05:02:33,161 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2022-12-06 05:02:33,161 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:33,161 INFO L89 Accepts]: Start accepts. Operand has 85 places, 65 transitions, 481 flow [2022-12-06 05:02:33,163 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:33,163 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:33,163 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 65 transitions, 481 flow [2022-12-06 05:02:33,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 65 transitions, 481 flow [2022-12-06 05:02:33,199 INFO L130 PetriNetUnfolder]: 278/648 cut-off events. [2022-12-06 05:02:33,199 INFO L131 PetriNetUnfolder]: For 1051/1462 co-relation queries the response was YES. [2022-12-06 05:02:33,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2256 conditions, 648 events. 278/648 cut-off events. For 1051/1462 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3358 event pairs, 31 based on Foata normal form. 3/565 useless extension candidates. Maximal degree in co-relation 2013. Up to 236 conditions per place. [2022-12-06 05:02:33,210 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 65 transitions, 481 flow [2022-12-06 05:02:33,210 INFO L188 LiptonReduction]: Number of co-enabled transitions 1312 [2022-12-06 05:02:33,211 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:33,212 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 05:02:33,212 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 481 flow [2022-12-06 05:02:33,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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:02:33,212 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:33,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:33,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:02:33,212 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 4 more)] === [2022-12-06 05:02:33,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:33,212 INFO L85 PathProgramCache]: Analyzing trace with hash 769146017, now seen corresponding path program 1 times [2022-12-06 05:02:33,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:33,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775335453] [2022-12-06 05:02:33,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:33,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:02:33,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:33,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775335453] [2022-12-06 05:02:33,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775335453] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:02:33,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203536945] [2022-12-06 05:02:33,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:33,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:33,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:02:33,380 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:02:33,403 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:02:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:33,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:02:33,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:02:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:02:33,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:02:33,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:02:33,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203536945] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:02:33,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:02:33,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-12-06 05:02:33,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199137485] [2022-12-06 05:02:33,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:02:33,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:02:33,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:33,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:02:33,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:02:33,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:02:33,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 481 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 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:02:33,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:33,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:02:33,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:36,948 INFO L130 PetriNetUnfolder]: 31652/38211 cut-off events. [2022-12-06 05:02:36,948 INFO L131 PetriNetUnfolder]: For 171224/171224 co-relation queries the response was YES. [2022-12-06 05:02:37,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185332 conditions, 38211 events. 31652/38211 cut-off events. For 171224/171224 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 146549 event pairs, 872 based on Foata normal form. 1952/40163 useless extension candidates. Maximal degree in co-relation 142995. Up to 15773 conditions per place. [2022-12-06 05:02:37,308 INFO L137 encePairwiseOnDemand]: 26/37 looper letters, 366 selfloop transitions, 69 changer transitions 0/435 dead transitions. [2022-12-06 05:02:37,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 435 transitions, 3655 flow [2022-12-06 05:02:37,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 05:02:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 05:02:37,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 311 transitions. [2022-12-06 05:02:37,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.466966966966967 [2022-12-06 05:02:37,310 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 481 flow. Second operand 18 states and 311 transitions. [2022-12-06 05:02:37,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 435 transitions, 3655 flow [2022-12-06 05:02:37,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 435 transitions, 3602 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-06 05:02:37,910 INFO L231 Difference]: Finished difference. Result has 110 places, 125 transitions, 1244 flow [2022-12-06 05:02:37,910 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1244, PETRI_PLACES=110, PETRI_TRANSITIONS=125} [2022-12-06 05:02:37,911 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 60 predicate places. [2022-12-06 05:02:37,911 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:37,911 INFO L89 Accepts]: Start accepts. Operand has 110 places, 125 transitions, 1244 flow [2022-12-06 05:02:37,912 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:37,912 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:37,912 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 125 transitions, 1244 flow [2022-12-06 05:02:37,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 125 transitions, 1244 flow [2022-12-06 05:02:37,991 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([438] L73-1-->L73-1: Formula: (and (< (mod v_~x5~0_12 4294967296) (mod v_~n~0_22 4294967296)) (= v_~x5~0_11 (* v_~x5~0_12 2))) InVars {~x5~0=v_~x5~0_12, ~n~0=v_~n~0_22} OutVars{~x5~0=v_~x5~0_11, ~n~0=v_~n~0_22} AuxVars[] AssignedVars[~x5~0][84], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), 493#true, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 32#L73-1true, Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), 59#L57-1true, Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, 36#L81-1true, Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 1133#true, Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), 1242#true, Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 93#L65-1true, Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 1350#true]) [2022-12-06 05:02:37,992 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-06 05:02:37,992 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 05:02:37,992 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 05:02:37,992 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 05:02:38,011 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([544] L81-1-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (not (< (mod v_~x6~0_In_8 4294967296) (mod v_~n~0_In_10 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_10, ~x6~0=v_~x6~0_In_8} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_8, ~n~0=v_~n~0_In_10} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset][101], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 2#thread4EXITtrue, 44#thread2EXITtrue, 32#L73-1true, Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 1354#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), 15#thread3EXITtrue, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 16#thread6EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 11#L41-1true, Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,011 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,012 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,012 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:02:38,012 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,016 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([438] L73-1-->L73-1: Formula: (and (< (mod v_~x5~0_12 4294967296) (mod v_~n~0_22 4294967296)) (= v_~x5~0_11 (* v_~x5~0_12 2))) InVars {~x5~0=v_~x5~0_12, ~n~0=v_~n~0_22} OutVars{~x5~0=v_~x5~0_11, ~n~0=v_~n~0_22} AuxVars[] AssignedVars[~x5~0][84], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), 493#true, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 2#thread4EXITtrue, 32#L73-1true, Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), 59#L57-1true, Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 36#L81-1true, 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 1133#true, Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 11#L41-1true, Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 1350#true]) [2022-12-06 05:02:38,016 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 05:02:38,016 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 05:02:38,016 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 05:02:38,016 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 05:02:38,033 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([544] L81-1-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (not (< (mod v_~x6~0_In_8 4294967296) (mod v_~n~0_In_10 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_10, ~x6~0=v_~x6~0_In_8} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_8, ~n~0=v_~n~0_In_10} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset][101], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 2#thread4EXITtrue, 44#thread2EXITtrue, Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 1354#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), 15#thread3EXITtrue, 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, 16#thread6EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 11#L41-1true, Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,033 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 05:02:38,033 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:02:38,033 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 05:02:38,033 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:02:38,036 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([544] L81-1-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (not (< (mod v_~x6~0_In_8 4294967296) (mod v_~n~0_In_10 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_10, ~x6~0=v_~x6~0_In_8} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_8, ~n~0=v_~n~0_In_10} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset][101], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), 493#true, 2#thread4EXITtrue, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 32#L73-1true, Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, 15#thread3EXITtrue, 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 16#thread6EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), 1350#true, Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,037 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 05:02:38,037 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:02:38,037 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:02:38,037 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,046 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([539] L73-1-->thread5EXIT: Formula: (and (not (< (mod v_~x5~0_In_6 4294967296) (mod v_~n~0_In_2 4294967296))) (= |v_thread5Thread1of1ForFork5_#res.offset_Out_4| 0) (= |v_thread5Thread1of1ForFork5_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_2, ~x5~0=v_~x5~0_In_6} OutVars{~x5~0=v_~x5~0_In_6, thread5Thread1of1ForFork5_#res.offset=|v_thread5Thread1of1ForFork5_#res.offset_Out_4|, ~n~0=v_~n~0_In_2, thread5Thread1of1ForFork5_#res.base=|v_thread5Thread1of1ForFork5_#res.base_Out_4|} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_#res.offset, thread5Thread1of1ForFork5_#res.base][112], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 2#thread4EXITtrue, 44#thread2EXITtrue, Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 1354#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), 15#thread3EXITtrue, 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 36#L81-1true, 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1133#true, Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 11#L41-1true, Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,046 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,046 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:02:38,046 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,046 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,046 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([544] L81-1-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (not (< (mod v_~x6~0_In_8 4294967296) (mod v_~n~0_In_10 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_10, ~x6~0=v_~x6~0_In_8} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_8, ~n~0=v_~n~0_In_10} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset][101], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 2#thread4EXITtrue, 44#thread2EXITtrue, 32#L73-1true, Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 1354#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), 15#thread3EXITtrue, 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 16#thread6EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 11#L41-1true, Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,046 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,046 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,046 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:02:38,047 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,047 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,047 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base][58], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 2#thread4EXITtrue, 44#thread2EXITtrue, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 1354#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), 59#L57-1true, Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, 16#thread6EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,047 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,048 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,048 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,048 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,048 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([542] L57-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x3~0_In_8 4294967296) (mod v_~n~0_In_8 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_8, ~n~0=v_~n~0_In_8} OutVars{~x3~0=v_~x3~0_In_8, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_8, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][61], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 44#thread2EXITtrue, Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 1354#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), 15#thread3EXITtrue, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, 16#thread6EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 1242#true, 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), 93#L65-1true, Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,048 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,048 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,048 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,048 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,049 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([539] L73-1-->thread5EXIT: Formula: (and (not (< (mod v_~x5~0_In_6 4294967296) (mod v_~n~0_In_2 4294967296))) (= |v_thread5Thread1of1ForFork5_#res.offset_Out_4| 0) (= |v_thread5Thread1of1ForFork5_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_2, ~x5~0=v_~x5~0_In_6} OutVars{~x5~0=v_~x5~0_In_6, thread5Thread1of1ForFork5_#res.offset=|v_thread5Thread1of1ForFork5_#res.offset_Out_4|, ~n~0=v_~n~0_In_2, thread5Thread1of1ForFork5_#res.base=|v_thread5Thread1of1ForFork5_#res.base_Out_4|} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_#res.offset, thread5Thread1of1ForFork5_#res.base][112], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 493#true, 2#thread4EXITtrue, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, 15#thread3EXITtrue, 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 36#L81-1true, 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 1133#true, Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), 1350#true, Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,049 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 05:02:38,049 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:38,049 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:02:38,049 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:38,049 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([544] L81-1-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (not (< (mod v_~x6~0_In_8 4294967296) (mod v_~n~0_In_10 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_10, ~x6~0=v_~x6~0_In_8} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_8, ~n~0=v_~n~0_In_10} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset][101], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 493#true, 2#thread4EXITtrue, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, 15#thread3EXITtrue, 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, 16#thread6EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), 1350#true, Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,049 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,050 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,050 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:38,050 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:02:38,050 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base][58], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), 493#true, 2#thread4EXITtrue, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), 59#L57-1true, Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 16#thread6EXITtrue, 14#thread5EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), 1350#true, Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,050 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 05:02:38,050 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:02:38,050 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:38,050 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:38,050 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([542] L57-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x3~0_In_8 4294967296) (mod v_~n~0_In_8 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_8, ~n~0=v_~n~0_In_8} OutVars{~x3~0=v_~x3~0_In_8, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_8, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][61], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), 493#true, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, 15#thread3EXITtrue, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 16#thread6EXITtrue, 14#thread5EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), 1242#true, Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), 93#L65-1true, Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), 1350#true, Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,050 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 05:02:38,050 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:02:38,051 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:38,051 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:38,057 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([539] L73-1-->thread5EXIT: Formula: (and (not (< (mod v_~x5~0_In_6 4294967296) (mod v_~n~0_In_2 4294967296))) (= |v_thread5Thread1of1ForFork5_#res.offset_Out_4| 0) (= |v_thread5Thread1of1ForFork5_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_2, ~x5~0=v_~x5~0_In_6} OutVars{~x5~0=v_~x5~0_In_6, thread5Thread1of1ForFork5_#res.offset=|v_thread5Thread1of1ForFork5_#res.offset_Out_4|, ~n~0=v_~n~0_In_2, thread5Thread1of1ForFork5_#res.base=|v_thread5Thread1of1ForFork5_#res.base_Out_4|} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_#res.offset, thread5Thread1of1ForFork5_#res.base][112], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), 2#thread4EXITtrue, 44#thread2EXITtrue, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 1354#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), 15#thread3EXITtrue, 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 36#L81-1true, 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1133#true, Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 11#L41-1true, Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,057 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-06 05:02:38,057 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:02:38,057 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 05:02:38,057 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:02:38,057 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:02:38,057 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([544] L81-1-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (not (< (mod v_~x6~0_In_8 4294967296) (mod v_~n~0_In_10 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_10, ~x6~0=v_~x6~0_In_8} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_8, ~n~0=v_~n~0_In_10} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset][101], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), 2#thread4EXITtrue, 44#thread2EXITtrue, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 1354#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), 15#thread3EXITtrue, 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, 16#thread6EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 11#L41-1true, Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,057 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 05:02:38,057 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:02:38,057 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 05:02:38,057 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:02:38,057 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:02:38,057 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base][58], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), 44#thread2EXITtrue, 2#thread4EXITtrue, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 1354#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), 59#L57-1true, Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 16#thread6EXITtrue, 14#thread5EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 11#L41-1true, 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,057 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-06 05:02:38,057 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:02:38,058 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:02:38,058 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:02:38,058 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:02:38,058 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([542] L57-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x3~0_In_8 4294967296) (mod v_~n~0_In_8 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_8, ~n~0=v_~n~0_In_8} OutVars{~x3~0=v_~x3~0_In_8, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_8, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][61], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), 44#thread2EXITtrue, 2#thread4EXITtrue, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 1354#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), 15#thread3EXITtrue, 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 16#thread6EXITtrue, 14#thread5EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 11#L41-1true, 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,058 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 05:02:38,058 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:02:38,058 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:02:38,058 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:02:38,058 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([542] L57-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x3~0_In_8 4294967296) (mod v_~n~0_In_8 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_8, ~n~0=v_~n~0_In_8} OutVars{~x3~0=v_~x3~0_In_8, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_8, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][61], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), 44#thread2EXITtrue, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 1354#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), 15#thread3EXITtrue, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 16#thread6EXITtrue, 14#thread5EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), 1242#true, Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), 93#L65-1true, Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,058 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-06 05:02:38,058 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:02:38,058 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:02:38,058 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:02:38,058 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:02:38,059 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base][58], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 493#true, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 2#thread4EXITtrue, Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 94#thread1EXITtrue, 701#true, 147#L49-1true, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), 59#L57-1true, Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 16#thread6EXITtrue, 14#thread5EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), 1350#true, Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,059 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2022-12-06 05:02:38,059 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 05:02:38,060 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 05:02:38,060 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 05:02:38,060 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([542] L57-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x3~0_In_8 4294967296) (mod v_~n~0_In_8 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_8, ~n~0=v_~n~0_In_8} OutVars{~x3~0=v_~x3~0_In_8, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_8, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][61], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 493#true, 2#thread4EXITtrue, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 94#thread1EXITtrue, 701#true, 147#L49-1true, 15#thread3EXITtrue, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 16#thread6EXITtrue, 14#thread5EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), 1350#true, Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,060 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-06 05:02:38,060 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 05:02:38,060 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 05:02:38,060 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 05:02:38,060 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([542] L57-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x3~0_In_8 4294967296) (mod v_~n~0_In_8 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_8, ~n~0=v_~n~0_In_8} OutVars{~x3~0=v_~x3~0_In_8, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_8, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][61], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 493#true, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 94#thread1EXITtrue, 701#true, 147#L49-1true, 15#thread3EXITtrue, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 16#thread6EXITtrue, 14#thread5EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 1242#true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), 93#L65-1true, Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), 1350#true, Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,060 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2022-12-06 05:02:38,060 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 05:02:38,060 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 05:02:38,060 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 05:02:38,068 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([420] thread3EXIT-->L111-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|} AuxVars[] AssignedVars[][117], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), 493#true, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 2#thread4EXITtrue, 32#L73-1true, Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), 109#L111-2true, Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 1354#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 36#L81-1true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 1133#true, Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 1581#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:38,068 INFO L382 tUnfolder$Statistics]: this new event has 27 ancestors and is not cut-off event [2022-12-06 05:02:38,068 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-12-06 05:02:38,068 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2022-12-06 05:02:38,068 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-12-06 05:02:38,076 INFO L130 PetriNetUnfolder]: 1275/2057 cut-off events. [2022-12-06 05:02:38,076 INFO L131 PetriNetUnfolder]: For 23322/25312 co-relation queries the response was YES. [2022-12-06 05:02:38,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12208 conditions, 2057 events. 1275/2057 cut-off events. For 23322/25312 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 10670 event pairs, 90 based on Foata normal form. 31/1772 useless extension candidates. Maximal degree in co-relation 11856. Up to 783 conditions per place. [2022-12-06 05:02:38,124 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 125 transitions, 1244 flow [2022-12-06 05:02:38,124 INFO L188 LiptonReduction]: Number of co-enabled transitions 2896 [2022-12-06 05:02:38,165 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [544] L81-1-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (not (< (mod v_~x6~0_In_8 4294967296) (mod v_~n~0_In_10 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_10, ~x6~0=v_~x6~0_In_8} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_8, ~n~0=v_~n~0_In_10} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [500] L57-1-->L57-1: Formula: (and (< (mod v_~x3~0_28 4294967296) (mod v_~n~0_48 4294967296)) (= v_~x3~0_27 (* v_~x3~0_28 2))) InVars {~x3~0=v_~x3~0_28, ~n~0=v_~n~0_48} OutVars{~x3~0=v_~x3~0_27, ~n~0=v_~n~0_48} AuxVars[] AssignedVars[~x3~0] [2022-12-06 05:02:38,217 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [544] L81-1-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (not (< (mod v_~x6~0_In_8 4294967296) (mod v_~n~0_In_10 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_10, ~x6~0=v_~x6~0_In_8} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_8, ~n~0=v_~n~0_In_10} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [498] L65-1-->L65-1: Formula: (and (< (mod v_~x4~0_28 4294967296) (mod v_~n~0_46 4294967296)) (= v_~x4~0_27 (* v_~x4~0_28 2))) InVars {~x4~0=v_~x4~0_28, ~n~0=v_~n~0_46} OutVars{~x4~0=v_~x4~0_27, ~n~0=v_~n~0_46} AuxVars[] AssignedVars[~x4~0] [2022-12-06 05:02:38,266 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [544] L81-1-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (not (< (mod v_~x6~0_In_8 4294967296) (mod v_~n~0_In_10 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_10, ~x6~0=v_~x6~0_In_8} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_8, ~n~0=v_~n~0_In_10} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [438] L73-1-->L73-1: Formula: (and (< (mod v_~x5~0_12 4294967296) (mod v_~n~0_22 4294967296)) (= v_~x5~0_11 (* v_~x5~0_12 2))) InVars {~x5~0=v_~x5~0_12, ~n~0=v_~n~0_22} OutVars{~x5~0=v_~x5~0_11, ~n~0=v_~n~0_22} AuxVars[] AssignedVars[~x5~0] [2022-12-06 05:02:38,318 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [544] L81-1-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork1_#res.offset_Out_4| 0) (not (< (mod v_~x6~0_In_8 4294967296) (mod v_~n~0_In_10 4294967296))) (= |v_thread6Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_10, ~x6~0=v_~x6~0_In_8} OutVars{thread6Thread1of1ForFork1_#res.base=|v_thread6Thread1of1ForFork1_#res.base_Out_4|, thread6Thread1of1ForFork1_#res.offset=|v_thread6Thread1of1ForFork1_#res.offset_Out_4|, ~x6~0=v_~x6~0_In_8, ~n~0=v_~n~0_In_10} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_#res.base, thread6Thread1of1ForFork1_#res.offset] and [438] L73-1-->L73-1: Formula: (and (< (mod v_~x5~0_12 4294967296) (mod v_~n~0_22 4294967296)) (= v_~x5~0_11 (* v_~x5~0_12 2))) InVars {~x5~0=v_~x5~0_12, ~n~0=v_~n~0_22} OutVars{~x5~0=v_~x5~0_11, ~n~0=v_~n~0_22} AuxVars[] AssignedVars[~x5~0] [2022-12-06 05:02:38,404 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [500] L57-1-->L57-1: Formula: (and (< (mod v_~x3~0_28 4294967296) (mod v_~n~0_48 4294967296)) (= v_~x3~0_27 (* v_~x3~0_28 2))) InVars {~x3~0=v_~x3~0_28, ~n~0=v_~n~0_48} OutVars{~x3~0=v_~x3~0_27, ~n~0=v_~n~0_48} AuxVars[] AssignedVars[~x3~0] [2022-12-06 05:02:38,455 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [438] L73-1-->L73-1: Formula: (and (< (mod v_~x5~0_12 4294967296) (mod v_~n~0_22 4294967296)) (= v_~x5~0_11 (* v_~x5~0_12 2))) InVars {~x5~0=v_~x5~0_12, ~n~0=v_~n~0_22} OutVars{~x5~0=v_~x5~0_11, ~n~0=v_~n~0_22} AuxVars[] AssignedVars[~x5~0] [2022-12-06 05:02:38,506 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [438] L73-1-->L73-1: Formula: (and (< (mod v_~x5~0_12 4294967296) (mod v_~n~0_22 4294967296)) (= v_~x5~0_11 (* v_~x5~0_12 2))) InVars {~x5~0=v_~x5~0_12, ~n~0=v_~n~0_22} OutVars{~x5~0=v_~x5~0_11, ~n~0=v_~n~0_22} AuxVars[] AssignedVars[~x5~0] [2022-12-06 05:02:38,672 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [500] L57-1-->L57-1: Formula: (and (< (mod v_~x3~0_28 4294967296) (mod v_~n~0_48 4294967296)) (= v_~x3~0_27 (* v_~x3~0_28 2))) InVars {~x3~0=v_~x3~0_28, ~n~0=v_~n~0_48} OutVars{~x3~0=v_~x3~0_27, ~n~0=v_~n~0_48} AuxVars[] AssignedVars[~x3~0] [2022-12-06 05:02:38,724 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [522] L81-1-->L81-1: Formula: (and (= (* v_~x6~0_46 2) v_~x6~0_45) (< (mod v_~x6~0_46 4294967296) (mod v_~n~0_58 4294967296))) InVars {~x6~0=v_~x6~0_46, ~n~0=v_~n~0_58} OutVars{~x6~0=v_~x6~0_45, ~n~0=v_~n~0_58} AuxVars[] AssignedVars[~x6~0] [2022-12-06 05:02:38,777 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [522] L81-1-->L81-1: Formula: (and (= (* v_~x6~0_46 2) v_~x6~0_45) (< (mod v_~x6~0_46 4294967296) (mod v_~n~0_58 4294967296))) InVars {~x6~0=v_~x6~0_46, ~n~0=v_~n~0_58} OutVars{~x6~0=v_~x6~0_45, ~n~0=v_~n~0_58} AuxVars[] AssignedVars[~x6~0] [2022-12-06 05:02:38,833 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:02:38,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 923 [2022-12-06 05:02:38,834 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 124 transitions, 1350 flow [2022-12-06 05:02:38,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 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:02:38,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:38,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:38,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 05:02:39,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 05:02:39,040 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 4 more)] === [2022-12-06 05:02:39,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2081224798, now seen corresponding path program 1 times [2022-12-06 05:02:39,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:39,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401317279] [2022-12-06 05:02:39,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:39,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:02:39,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:39,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401317279] [2022-12-06 05:02:39,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401317279] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:02:39,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321141260] [2022-12-06 05:02:39,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:39,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:39,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:02:39,276 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:02:39,289 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:02:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:39,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:02:39,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:02:39,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 05:02:39,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:02:39,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321141260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:39,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:02:39,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-06 05:02:39,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115283422] [2022-12-06 05:02:39,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:39,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:02:39,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:39,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:02:39,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:02:39,505 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:02:39,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 124 transitions, 1350 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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:02:39,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:39,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:02:39,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:42,158 INFO L130 PetriNetUnfolder]: 26210/31592 cut-off events. [2022-12-06 05:02:42,159 INFO L131 PetriNetUnfolder]: For 379036/379036 co-relation queries the response was YES. [2022-12-06 05:02:42,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193316 conditions, 31592 events. 26210/31592 cut-off events. For 379036/379036 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 119301 event pairs, 1589 based on Foata normal form. 802/32394 useless extension candidates. Maximal degree in co-relation 155697. Up to 13065 conditions per place. [2022-12-06 05:02:42,400 INFO L137 encePairwiseOnDemand]: 42/47 looper letters, 274 selfloop transitions, 8 changer transitions 92/374 dead transitions. [2022-12-06 05:02:42,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 374 transitions, 4725 flow [2022-12-06 05:02:42,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:02:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:02:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2022-12-06 05:02:42,401 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5914893617021276 [2022-12-06 05:02:42,402 INFO L175 Difference]: Start difference. First operand has 109 places, 124 transitions, 1350 flow. Second operand 5 states and 139 transitions. [2022-12-06 05:02:42,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 374 transitions, 4725 flow [2022-12-06 05:02:43,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 374 transitions, 3972 flow, removed 341 selfloop flow, removed 4 redundant places. [2022-12-06 05:02:43,616 INFO L231 Difference]: Finished difference. Result has 110 places, 123 transitions, 1130 flow [2022-12-06 05:02:43,616 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1130, PETRI_PLACES=110, PETRI_TRANSITIONS=123} [2022-12-06 05:02:43,616 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 60 predicate places. [2022-12-06 05:02:43,616 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:43,617 INFO L89 Accepts]: Start accepts. Operand has 110 places, 123 transitions, 1130 flow [2022-12-06 05:02:43,618 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:43,618 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:43,618 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 123 transitions, 1130 flow [2022-12-06 05:02:43,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 123 transitions, 1130 flow [2022-12-06 05:02:43,718 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base][35], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 2#thread4EXITtrue, Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), 59#L57-1true, Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 16#thread6EXITtrue, 14#thread5EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 1611#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 500#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), 1350#true, Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:43,719 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 05:02:43,719 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 05:02:43,719 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 05:02:43,719 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 05:02:43,719 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([542] L57-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x3~0_In_8 4294967296) (mod v_~n~0_In_8 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_8, ~n~0=v_~n~0_In_8} OutVars{~x3~0=v_~x3~0_In_8, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_8, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][36], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, 15#thread3EXITtrue, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 16#thread6EXITtrue, 14#thread5EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 1611#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 500#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), 1242#true, Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 93#L65-1true, 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), 1350#true, Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:43,719 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2022-12-06 05:02:43,719 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 05:02:43,719 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 05:02:43,719 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 05:02:43,723 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base][35], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 2#thread4EXITtrue, 1603#true, Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), 59#L57-1true, Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, 16#thread6EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1611#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), 1350#true, Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:43,723 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 05:02:43,723 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:02:43,723 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:02:43,723 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 05:02:43,723 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([542] L57-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x3~0_In_8 4294967296) (mod v_~n~0_In_8 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_8, ~n~0=v_~n~0_In_8} OutVars{~x3~0=v_~x3~0_In_8, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_8, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][36], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 1603#true, Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, 15#thread3EXITtrue, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, 16#thread6EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1611#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 1242#true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 11#L41-1true, Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), 93#L65-1true, 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 1350#true]) [2022-12-06 05:02:43,723 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 05:02:43,723 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:43,723 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:43,723 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:43,726 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base][35], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), 493#true, 2#thread4EXITtrue, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 1603#true, 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), 59#L57-1true, Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, 16#thread6EXITtrue, 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1611#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), 1350#true, Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:43,726 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 05:02:43,726 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:02:43,726 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:02:43,726 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 05:02:43,726 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([542] L57-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x3~0_In_8 4294967296) (mod v_~n~0_In_8 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_8, ~n~0=v_~n~0_In_8} OutVars{~x3~0=v_~x3~0_In_8, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_8, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][36], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 493#true, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 1603#true, 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, 15#thread3EXITtrue, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, 16#thread6EXITtrue, 117#L108-4true, Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1611#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 1242#true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 11#L41-1true, Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 93#L65-1true, 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 1350#true]) [2022-12-06 05:02:43,726 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 05:02:43,726 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:43,726 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:43,726 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:43,728 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base][35], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 493#true, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 2#thread4EXITtrue, 1603#true, Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), 59#L57-1true, Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, 16#thread6EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1611#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), 1350#true, Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:43,728 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 05:02:43,728 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:02:43,728 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:02:43,728 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 05:02:43,729 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([542] L57-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x3~0_In_8 4294967296) (mod v_~n~0_In_8 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_8, ~n~0=v_~n~0_In_8} OutVars{~x3~0=v_~x3~0_In_8, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_8, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][36], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 493#true, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 1603#true, Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, 15#thread3EXITtrue, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 16#thread6EXITtrue, 14#thread5EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1611#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 1242#true, 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), 93#L65-1true, Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 1350#true]) [2022-12-06 05:02:43,729 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 05:02:43,729 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:43,729 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:43,729 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:43,729 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base][35], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 493#true, 2#thread4EXITtrue, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 1603#true, Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, 15#thread3EXITtrue, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, 16#thread6EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1611#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1573#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), 1350#true, Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:43,729 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 05:02:43,729 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:02:43,729 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:43,729 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:02:43,744 INFO L130 PetriNetUnfolder]: 1045/1646 cut-off events. [2022-12-06 05:02:43,744 INFO L131 PetriNetUnfolder]: For 14209/15922 co-relation queries the response was YES. [2022-12-06 05:02:43,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8957 conditions, 1646 events. 1045/1646 cut-off events. For 14209/15922 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 7816 event pairs, 48 based on Foata normal form. 33/1493 useless extension candidates. Maximal degree in co-relation 8715. Up to 728 conditions per place. [2022-12-06 05:02:43,776 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 123 transitions, 1130 flow [2022-12-06 05:02:43,776 INFO L188 LiptonReduction]: Number of co-enabled transitions 2728 [2022-12-06 05:02:43,778 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:43,778 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 05:02:43,779 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 123 transitions, 1130 flow [2022-12-06 05:02:43,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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:02:43,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:43,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:43,786 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:02:43,983 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,SelfDestructingSolverStorable17 [2022-12-06 05:02:43,984 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 4 more)] === [2022-12-06 05:02:43,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:43,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1833989103, now seen corresponding path program 1 times [2022-12-06 05:02:43,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:43,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487959284] [2022-12-06 05:02:43,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:43,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:02:44,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:44,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487959284] [2022-12-06 05:02:44,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487959284] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:02:44,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754777934] [2022-12-06 05:02:44,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:44,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:44,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:02:44,169 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:02:44,171 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:02:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:44,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:02:44,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:02:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:02:44,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:02:44,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754777934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:02:44,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:02:44,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-06 05:02:44,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070575108] [2022-12-06 05:02:44,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:02:44,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:02:44,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:44,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:02:44,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:02:44,386 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:02:44,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 123 transitions, 1130 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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:02:44,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:44,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:02:44,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:46,563 INFO L130 PetriNetUnfolder]: 21874/26107 cut-off events. [2022-12-06 05:02:46,563 INFO L131 PetriNetUnfolder]: For 239423/239423 co-relation queries the response was YES. [2022-12-06 05:02:46,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153244 conditions, 26107 events. 21874/26107 cut-off events. For 239423/239423 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 90065 event pairs, 3990 based on Foata normal form. 576/26683 useless extension candidates. Maximal degree in co-relation 134530. Up to 18973 conditions per place. [2022-12-06 05:02:46,765 INFO L137 encePairwiseOnDemand]: 43/47 looper letters, 271 selfloop transitions, 9 changer transitions 0/280 dead transitions. [2022-12-06 05:02:46,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 280 transitions, 3043 flow [2022-12-06 05:02:46,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:02:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:02:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2022-12-06 05:02:46,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5372340425531915 [2022-12-06 05:02:46,766 INFO L175 Difference]: Start difference. First operand has 108 places, 123 transitions, 1130 flow. Second operand 4 states and 101 transitions. [2022-12-06 05:02:46,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 280 transitions, 3043 flow [2022-12-06 05:02:47,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 280 transitions, 3011 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 05:02:47,775 INFO L231 Difference]: Finished difference. Result has 109 places, 124 transitions, 1138 flow [2022-12-06 05:02:47,775 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1138, PETRI_PLACES=109, PETRI_TRANSITIONS=124} [2022-12-06 05:02:47,775 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 59 predicate places. [2022-12-06 05:02:47,775 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:47,776 INFO L89 Accepts]: Start accepts. Operand has 109 places, 124 transitions, 1138 flow [2022-12-06 05:02:47,777 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:47,777 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:47,777 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 124 transitions, 1138 flow [2022-12-06 05:02:47,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 124 transitions, 1138 flow [2022-12-06 05:02:47,875 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base][36], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 1725#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 2#thread4EXITtrue, Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1721#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 59#L57-1true, Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, 16#thread6EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 500#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:47,875 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 05:02:47,875 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 05:02:47,875 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 05:02:47,875 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 05:02:47,875 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([542] L57-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x3~0_In_8 4294967296) (mod v_~n~0_In_8 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_8, ~n~0=v_~n~0_In_8} OutVars{~x3~0=v_~x3~0_In_8, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_8, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][37], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 1725#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, 15#thread3EXITtrue, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1721#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 16#thread6EXITtrue, 14#thread5EXITtrue, 117#L108-4true, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 500#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 1242#true, 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 93#L65-1true, Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:47,875 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2022-12-06 05:02:47,875 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 05:02:47,875 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 05:02:47,876 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 05:02:47,881 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base][36], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 2#thread4EXITtrue, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 1603#true, Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1717#true, 1356#true, 909#true, Black: 1721#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), 59#L57-1true, Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, 16#thread6EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1611#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:47,881 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 05:02:47,881 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:02:47,881 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:02:47,881 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 05:02:47,881 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([542] L57-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x3~0_In_8 4294967296) (mod v_~n~0_In_8 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_8, ~n~0=v_~n~0_In_8} OutVars{~x3~0=v_~x3~0_In_8, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_8, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][37], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 1603#true, Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, 15#thread3EXITtrue, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1717#true, 1356#true, 909#true, Black: 1721#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 16#thread6EXITtrue, 14#thread5EXITtrue, 117#L108-4true, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1611#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 1242#true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 11#L41-1true, 93#L65-1true, 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:47,882 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 05:02:47,882 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:47,882 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:47,882 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:47,884 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base][36], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 493#true, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 2#thread4EXITtrue, 1603#true, 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), 59#L57-1true, Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, 16#thread6EXITtrue, 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 1721#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 1611#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:47,884 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 05:02:47,884 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 05:02:47,884 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:02:47,884 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:02:47,885 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([542] L57-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x3~0_In_8 4294967296) (mod v_~n~0_In_8 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_8, ~n~0=v_~n~0_In_8} OutVars{~x3~0=v_~x3~0_In_8, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_8, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][37], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 493#true, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 1603#true, 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, 15#thread3EXITtrue, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, 16#thread6EXITtrue, 117#L108-4true, Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 1721#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 1611#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 1242#true, 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), 93#L65-1true, Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:47,885 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 05:02:47,885 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:47,885 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:47,885 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:47,886 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base][36], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 493#true, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 2#thread4EXITtrue, 1603#true, Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), 59#L57-1true, Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, 16#thread6EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 1721#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 1611#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:47,886 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 05:02:47,886 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:02:47,886 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:02:47,886 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 05:02:47,886 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([542] L57-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x3~0_In_8 4294967296) (mod v_~n~0_In_8 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_8, ~n~0=v_~n~0_In_8} OutVars{~x3~0=v_~x3~0_In_8, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_8, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][37], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 493#true, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), 1603#true, Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, 15#thread3EXITtrue, Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 16#thread6EXITtrue, 14#thread5EXITtrue, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 117#L108-4true, Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 1721#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 1611#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 1242#true, 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), 93#L65-1true, Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:47,886 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 05:02:47,886 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:47,886 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:47,887 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:02:47,887 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_14 4294967296)))) InVars {~n~0=v_~n~0_In_14, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_14, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base][36], [Black: 1589#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1587#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 291#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), 493#true, 2#thread4EXITtrue, Black: 1250#(= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)), Black: 388#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 1603#true, Black: 704#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 906#(and (<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)) (< ~x6~0 (+ (* (div ~x6~0 4294967296) 4294967296) 1 (mod ~x5~0 4294967296)))), 174#true, 701#true, 147#L49-1true, 15#thread3EXITtrue, 1246#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 187#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1141#(= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296)), Black: 1114#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1))), Black: 281#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 912#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 1356#true, 909#true, Black: 1120#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1125#(<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))), 14#thread5EXITtrue, 16#thread6EXITtrue, 117#L108-4true, Black: 1130#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 1129#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 398#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 172#(= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 176#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 1721#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 1611#(= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)), Black: 1575#(and (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1360#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1585#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x3~0 4294967296) (+ (mod ~x4~0 4294967296) 1))), Black: 1577#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))))), 11#L41-1true, Black: 1571#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 1175#(<= (mod ~n~0 4294967296) (+ (mod ~x6~0 4294967296) (* (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) 4294967296))), Black: 698#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 1413#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), Black: 496#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1583#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1579#(and (<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))]) [2022-12-06 05:02:47,887 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 05:02:47,887 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:02:47,887 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:02:47,887 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:02:47,900 INFO L130 PetriNetUnfolder]: 1259/1891 cut-off events. [2022-12-06 05:02:47,901 INFO L131 PetriNetUnfolder]: For 16094/17856 co-relation queries the response was YES. [2022-12-06 05:02:47,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10747 conditions, 1891 events. 1259/1891 cut-off events. For 16094/17856 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8747 event pairs, 73 based on Foata normal form. 45/1723 useless extension candidates. Maximal degree in co-relation 10549. Up to 898 conditions per place. [2022-12-06 05:02:47,938 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 124 transitions, 1138 flow [2022-12-06 05:02:47,938 INFO L188 LiptonReduction]: Number of co-enabled transitions 2822 [2022-12-06 05:02:47,940 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:02:47,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:02:47,941 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 124 transitions, 1138 flow [2022-12-06 05:02:47,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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:02:47,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:47,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:02:47,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 05:02:48,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:48,150 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 4 more)] === [2022-12-06 05:02:48,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:48,150 INFO L85 PathProgramCache]: Analyzing trace with hash 875740399, now seen corresponding path program 1 times [2022-12-06 05:02:48,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:48,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655836580] [2022-12-06 05:02:48,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:48,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:49,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:02:49,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:49,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655836580] [2022-12-06 05:02:49,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655836580] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:02:49,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013751934] [2022-12-06 05:02:49,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:49,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:49,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:02:49,040 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:02:49,069 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:02:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:51,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 05:02:51,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:03:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:03:04,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:04:04,732 WARN L233 SmtUtils]: Spent 48.91s on a formula simplification. DAG size of input: 7848 DAG size of output: 7841 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2022-12-06 05:15:46,822 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:15:46,822 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:15:47,200 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 05:15:47,202 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 05:15:47,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 05:15:47,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:15:47,402 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 37 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 22 for 650ms.. [2022-12-06 05:15:47,404 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2022-12-06 05:15:47,404 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 05:15:47,404 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 05:15:47,404 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 05:15:47,404 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 05:15:47,404 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2022-12-06 05:15:47,404 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:47,407 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:15:47,407 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:15:47,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:15:47 BasicIcfg [2022-12-06 05:15:47,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:15:47,410 INFO L158 Benchmark]: Toolchain (without parser) took 847210.11ms. Allocated memory was 196.1MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 162.3MB in the beginning and 802.0MB in the end (delta: -639.7MB). Peak memory consumption was 7.0GB. Max. memory is 8.0GB. [2022-12-06 05:15:47,410 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 196.1MB. Free memory is still 172.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:15:47,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.13ms. Allocated memory is still 196.1MB. Free memory was 161.8MB in the beginning and 150.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-06 05:15:47,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.56ms. Allocated memory is still 196.1MB. Free memory was 150.3MB in the beginning and 148.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:15:47,410 INFO L158 Benchmark]: Boogie Preprocessor took 39.34ms. Allocated memory is still 196.1MB. Free memory was 148.2MB in the beginning and 146.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:15:47,411 INFO L158 Benchmark]: RCFGBuilder took 503.64ms. Allocated memory is still 196.1MB. Free memory was 146.6MB in the beginning and 128.8MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-06 05:15:47,411 INFO L158 Benchmark]: TraceAbstraction took 846370.16ms. Allocated memory was 196.1MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 128.3MB in the beginning and 802.0MB in the end (delta: -673.7MB). Peak memory consumption was 6.9GB. Max. memory is 8.0GB. [2022-12-06 05:15:47,412 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.09ms. Allocated memory is still 196.1MB. Free memory is still 172.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.13ms. Allocated memory is still 196.1MB. Free memory was 161.8MB in the beginning and 150.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.56ms. Allocated memory is still 196.1MB. Free memory was 150.3MB in the beginning and 148.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.34ms. Allocated memory is still 196.1MB. Free memory was 148.2MB in the beginning and 146.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 503.64ms. Allocated memory is still 196.1MB. Free memory was 146.6MB in the beginning and 128.8MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 846370.16ms. Allocated memory was 196.1MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 128.3MB in the beginning and 802.0MB in the end (delta: -673.7MB). Peak memory consumption was 6.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 145 PlacesBefore, 50 PlacesAfterwards, 140 TransitionsBefore, 37 TransitionsAfterwards, 2916 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 50 TrivialYvCompositions, 45 ConcurrentYvCompositions, 8 ChoiceCompositions, 103 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1584, independent: 1584, independent conditional: 1584, 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: 1584, independent: 1584, independent conditional: 0, independent unconditional: 1584, 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: 1584, independent: 1584, independent conditional: 0, independent unconditional: 1584, 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: 1584, independent: 1584, independent conditional: 0, independent unconditional: 1584, 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: 1584, independent: 1584, independent conditional: 0, independent unconditional: 1584, 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: 1584, independent: 1584, independent conditional: 0, independent unconditional: 1584, 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: 1584, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1584, unknown conditional: 0, unknown unconditional: 1584] , Statistics on independence cache: Total cache size (in pairs): 2588, Positive cache size: 2588, Positive conditional cache size: 0, Positive unconditional cache size: 2588, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 41 PlacesBefore, 41 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 462 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 45 PlacesBefore, 45 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 764 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 48 PlacesBefore, 48 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 896 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 63 TransitionsBefore, 63 TransitionsAfterwards, 1006 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 53 PlacesBefore, 53 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 1086 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 56 PlacesBefore, 56 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 1216 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 58 PlacesBefore, 58 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 1268 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 64 PlacesBefore, 64 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1320 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 69 PlacesBefore, 69 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 1392 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 74 PlacesBefore, 74 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 1540 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 75 PlacesBefore, 75 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 1584 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 77 PlacesBefore, 77 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 1648 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 64, independent conditional: 64, 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: 64, independent: 64, independent conditional: 64, 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: 64, independent: 64, independent conditional: 64, 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: 64, independent: 64, independent conditional: 64, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 64, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 18, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 80 PlacesBefore, 80 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 1786 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 44, independent conditional: 44, 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: 44, independent: 44, independent conditional: 44, 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: 44, independent: 44, independent conditional: 44, 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: 44, independent: 44, independent conditional: 44, 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: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 44, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 37, Positive conditional cache size: 37, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 82 PlacesBefore, 82 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 1534 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): 37, Positive cache size: 37, Positive conditional cache size: 37, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 82 PlacesBefore, 82 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 1406 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): 37, Positive cache size: 37, Positive conditional cache size: 37, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 83 PlacesBefore, 83 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 1312 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): 37, Positive cache size: 37, Positive conditional cache size: 37, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.7s, 110 PlacesBefore, 109 PlacesAfterwards, 125 TransitionsBefore, 124 TransitionsAfterwards, 2896 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 174, independent: 174, independent conditional: 174, 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: 174, independent: 174, independent conditional: 174, 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: 174, independent: 174, independent conditional: 174, 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: 174, independent: 174, independent conditional: 174, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 174, independent: 150, independent conditional: 150, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 71, Positive conditional cache size: 71, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 108 PlacesBefore, 108 PlacesAfterwards, 123 TransitionsBefore, 123 TransitionsAfterwards, 2728 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): 71, Positive cache size: 71, Positive conditional cache size: 71, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 109 PlacesBefore, 109 PlacesAfterwards, 124 TransitionsBefore, 124 TransitionsAfterwards, 2822 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): 71, Positive cache size: 71, Positive conditional cache size: 71, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 37 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 22 for 650ms.. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 37 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 22 for 650ms.. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 37 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 22 for 650ms.. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 37 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 22 for 650ms.. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 37 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 22 for 650ms.. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 37 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 22 for 650ms.. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 37 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 22 for 650ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 185 locations, 7 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: 846.2s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 48.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 964 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 964 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3559 IncrementalHoareTripleChecker+Invalid, 3589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 0 mSDtfsCounter, 3559 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 574 GetRequests, 488 SyntacticMatches, 9 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1350occurred in iteration=17, InterpolantAutomatonStates: 96, 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.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1014 NumberOfCodeBlocks, 1012 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1117 ConstructedInterpolants, 0 QuantifiedInterpolants, 18620 SizeOfPredicates, 77 NumberOfNonLiveVariables, 3567 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 34 InterpolantComputations, 15 PerfectInterpolantSequences, 77/97 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