/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-RepeatedSemanticLbeWithDisjunctivePredicates.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 07:11:08,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:11:08,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:11:08,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:11:08,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:11:08,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:11:08,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:11:08,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:11:08,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:11:08,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:11:08,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:11:08,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:11:08,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:11:08,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:11:08,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:11:08,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:11:08,234 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:11:08,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:11:08,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:11:08,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:11:08,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:11:08,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:11:08,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:11:08,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:11:08,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:11:08,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:11:08,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:11:08,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:11:08,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:11:08,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:11:08,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:11:08,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:11:08,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:11:08,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:11:08,255 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:11:08,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:11:08,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:11:08,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:11:08,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:11:08,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:11:08,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:11:08,263 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:11:08,288 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:11:08,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:11:08,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:11:08,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:11:08,290 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:11:08,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:11:08,291 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:11:08,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:11:08,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:11:08,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:11:08,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:11:08,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:11:08,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:11:08,292 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:11:08,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:11:08,293 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:11:08,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:11:08,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:11:08,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:11:08,293 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:11:08,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:11:08,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:11:08,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:11:08,294 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:11:08,294 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:11:08,294 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:11:08,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:11:08,294 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:11:08,295 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 07:11:08,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:11:08,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:11:08,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:11:08,614 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:11:08,615 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:11:08,616 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 07:11:09,849 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:11:10,041 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:11:10,042 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2022-12-06 07:11:10,046 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cfa54012/7eb3575236ee4596a2cc59a860e333ea/FLAGa16c53984 [2022-12-06 07:11:10,059 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cfa54012/7eb3575236ee4596a2cc59a860e333ea [2022-12-06 07:11:10,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:11:10,062 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:11:10,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:11:10,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:11:10,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:11:10,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:11:10" (1/1) ... [2022-12-06 07:11:10,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c73ecad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:10, skipping insertion in model container [2022-12-06 07:11:10,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:11:10" (1/1) ... [2022-12-06 07:11:10,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:11:10,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:11:10,239 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 07:11:10,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:11:10,262 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:11:10,307 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 07:11:10,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:11:10,319 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:11:10,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:10 WrapperNode [2022-12-06 07:11:10,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:11:10,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:11:10,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:11:10,321 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:11:10,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:10" (1/1) ... [2022-12-06 07:11:10,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:10" (1/1) ... [2022-12-06 07:11:10,372 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2022-12-06 07:11:10,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:11:10,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:11:10,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:11:10,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:11:10,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:10" (1/1) ... [2022-12-06 07:11:10,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:10" (1/1) ... [2022-12-06 07:11:10,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:10" (1/1) ... [2022-12-06 07:11:10,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:10" (1/1) ... [2022-12-06 07:11:10,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:10" (1/1) ... [2022-12-06 07:11:10,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:10" (1/1) ... [2022-12-06 07:11:10,415 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:10" (1/1) ... [2022-12-06 07:11:10,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:10" (1/1) ... [2022-12-06 07:11:10,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:11:10,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:11:10,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:11:10,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:11:10,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:10" (1/1) ... [2022-12-06 07:11:10,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:11:10,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:11:10,453 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 07:11:10,460 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 07:11:10,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:11:10,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:11:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:11:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:11:10,498 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:11:10,498 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:11:10,498 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:11:10,498 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:11:10,498 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:11:10,498 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:11:10,498 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 07:11:10,498 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 07:11:10,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:11:10,499 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-06 07:11:10,499 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-06 07:11:10,499 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-12-06 07:11:10,499 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-12-06 07:11:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:11:10,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:11:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:11:10,501 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 07:11:10,644 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:11:10,646 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:11:10,908 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:11:10,916 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:11:10,916 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 07:11:10,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:11:10 BoogieIcfgContainer [2022-12-06 07:11:10,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:11:10,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:11:10,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:11:10,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:11:10,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:11:10" (1/3) ... [2022-12-06 07:11:10,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f568a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:11:10, skipping insertion in model container [2022-12-06 07:11:10,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:11:10" (2/3) ... [2022-12-06 07:11:10,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f568a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:11:10, skipping insertion in model container [2022-12-06 07:11:10,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:11:10" (3/3) ... [2022-12-06 07:11:10,938 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2022-12-06 07:11:10,976 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:11:10,976 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:11:10,976 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:11:11,094 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-12-06 07:11:11,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 162 transitions, 372 flow [2022-12-06 07:11:11,207 INFO L130 PetriNetUnfolder]: 14/156 cut-off events. [2022-12-06 07:11:11,207 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 07:11:11,214 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 07:11:11,214 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 162 transitions, 372 flow [2022-12-06 07:11:11,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 140 transitions, 316 flow [2022-12-06 07:11:11,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:11,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 140 transitions, 316 flow [2022-12-06 07:11:11,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 140 transitions, 316 flow [2022-12-06 07:11:11,280 INFO L130 PetriNetUnfolder]: 14/140 cut-off events. [2022-12-06 07:11:11,280 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 07:11:11,281 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 07:11:11,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 140 transitions, 316 flow [2022-12-06 07:11:11,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 2916 [2022-12-06 07:11:16,701 INFO L203 LiptonReduction]: Total number of compositions: 103 [2022-12-06 07:11:16,715 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:11:16,720 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;@35ef7969, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:11:16,721 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 07:11:16,729 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2022-12-06 07:11:16,729 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 07:11:16,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:16,730 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 07:11:16,730 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 07:11:16,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:16,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1155012049, now seen corresponding path program 1 times [2022-12-06 07:11:16,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:16,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167026665] [2022-12-06 07:11:16,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:16,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:17,611 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 07:11:17,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:17,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167026665] [2022-12-06 07:11:17,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167026665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:11:17,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:11:17,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:11:17,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429159897] [2022-12-06 07:11:17,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:11:17,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:11:17,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:17,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:11:17,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:11:17,643 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:17,644 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 07:11:17,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:17,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:17,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:18,068 INFO L130 PetriNetUnfolder]: 3453/4197 cut-off events. [2022-12-06 07:11:18,069 INFO L131 PetriNetUnfolder]: For 305/305 co-relation queries the response was YES. [2022-12-06 07:11:18,079 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 07:11:18,100 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 59 selfloop transitions, 3 changer transitions 5/67 dead transitions. [2022-12-06 07:11:18,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 331 flow [2022-12-06 07:11:18,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:11:18,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:11:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-06 07:11:18,111 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2022-12-06 07:11:18,112 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 110 flow. Second operand 3 states and 68 transitions. [2022-12-06 07:11:18,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 331 flow [2022-12-06 07:11:18,123 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 07:11:18,125 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 105 flow [2022-12-06 07:11:18,127 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 07:11:18,130 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2022-12-06 07:11:18,130 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:18,131 INFO L89 Accepts]: Start accepts. Operand has 41 places, 39 transitions, 105 flow [2022-12-06 07:11:18,134 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:18,134 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:18,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 39 transitions, 105 flow [2022-12-06 07:11:18,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 39 transitions, 105 flow [2022-12-06 07:11:18,145 INFO L130 PetriNetUnfolder]: 9/51 cut-off events. [2022-12-06 07:11:18,145 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:11:18,146 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 07:11:18,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 39 transitions, 105 flow [2022-12-06 07:11:18,147 INFO L188 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-06 07:11:18,149 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:18,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 07:11:18,152 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 105 flow [2022-12-06 07:11:18,152 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 07:11:18,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:18,152 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 07:11:18,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:11:18,156 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 07:11:18,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:18,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1438143645, now seen corresponding path program 1 times [2022-12-06 07:11:18,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:18,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812595631] [2022-12-06 07:11:18,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:18,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:18,498 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 07:11:18,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:18,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812595631] [2022-12-06 07:11:18,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812595631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:11:18,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:11:18,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:11:18,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015857001] [2022-12-06 07:11:18,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:11:18,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:11:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:18,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:11:18,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:11:18,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:18,501 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 07:11:18,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:18,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:18,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:19,047 INFO L130 PetriNetUnfolder]: 5021/6142 cut-off events. [2022-12-06 07:11:19,047 INFO L131 PetriNetUnfolder]: For 981/981 co-relation queries the response was YES. [2022-12-06 07:11:19,054 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 07:11:19,077 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 74 selfloop transitions, 13 changer transitions 7/94 dead transitions. [2022-12-06 07:11:19,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 94 transitions, 425 flow [2022-12-06 07:11:19,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:11:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:11:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-06 07:11:19,082 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6351351351351351 [2022-12-06 07:11:19,082 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 105 flow. Second operand 4 states and 94 transitions. [2022-12-06 07:11:19,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 94 transitions, 425 flow [2022-12-06 07:11:19,084 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 07:11:19,086 INFO L231 Difference]: Finished difference. Result has 45 places, 51 transitions, 191 flow [2022-12-06 07:11:19,086 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 07:11:19,087 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2022-12-06 07:11:19,087 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:19,087 INFO L89 Accepts]: Start accepts. Operand has 45 places, 51 transitions, 191 flow [2022-12-06 07:11:19,090 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:19,090 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:19,090 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 51 transitions, 191 flow [2022-12-06 07:11:19,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 51 transitions, 191 flow [2022-12-06 07:11:19,102 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 07:11:19,102 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:11:19,102 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:19,103 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:19,103 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:19,103 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 07:11:19,103 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 07:11:19,104 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:19,104 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 07:11:19,104 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:19,113 INFO L130 PetriNetUnfolder]: 96/192 cut-off events. [2022-12-06 07:11:19,113 INFO L131 PetriNetUnfolder]: For 49/57 co-relation queries the response was YES. [2022-12-06 07:11:19,114 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 07:11:19,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 51 transitions, 191 flow [2022-12-06 07:11:19,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 764 [2022-12-06 07:11:19,120 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:19,121 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 07:11:19,122 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 51 transitions, 191 flow [2022-12-06 07:11:19,122 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 07:11:19,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:19,123 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 07:11:19,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:11:19,123 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 07:11:19,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1792923337, now seen corresponding path program 1 times [2022-12-06 07:11:19,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:19,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12529474] [2022-12-06 07:11:19,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:19,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:19,427 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 07:11:19,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:19,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12529474] [2022-12-06 07:11:19,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12529474] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:11:19,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625556654] [2022-12-06 07:11:19,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:19,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:11:19,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:11:19,435 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 07:11:19,494 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 07:11:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:19,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 07:11:19,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:11:19,774 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 07:11:19,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:11:19,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625556654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:11:19,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:11:19,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2022-12-06 07:11:19,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870220577] [2022-12-06 07:11:19,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:11:19,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:11:19,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:19,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:11:19,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:11:19,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:19,776 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 07:11:19,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:19,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:19,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:20,414 INFO L130 PetriNetUnfolder]: 6737/8223 cut-off events. [2022-12-06 07:11:20,414 INFO L131 PetriNetUnfolder]: For 5845/5845 co-relation queries the response was YES. [2022-12-06 07:11:20,428 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 07:11:20,479 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 71 selfloop transitions, 13 changer transitions 1/85 dead transitions. [2022-12-06 07:11:20,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 85 transitions, 456 flow [2022-12-06 07:11:20,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:11:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:11:20,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-06 07:11:20,481 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2022-12-06 07:11:20,481 INFO L175 Difference]: Start difference. First operand has 45 places, 51 transitions, 191 flow. Second operand 3 states and 72 transitions. [2022-12-06 07:11:20,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 85 transitions, 456 flow [2022-12-06 07:11:20,489 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 07:11:20,490 INFO L231 Difference]: Finished difference. Result has 48 places, 55 transitions, 256 flow [2022-12-06 07:11:20,491 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 07:11:20,492 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2022-12-06 07:11:20,492 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:20,492 INFO L89 Accepts]: Start accepts. Operand has 48 places, 55 transitions, 256 flow [2022-12-06 07:11:20,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:20,494 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:20,494 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 55 transitions, 256 flow [2022-12-06 07:11:20,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 55 transitions, 256 flow [2022-12-06 07:11:20,503 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 07:11:20,503 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:11:20,503 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:20,503 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:20,506 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:20,514 INFO L130 PetriNetUnfolder]: 96/200 cut-off events. [2022-12-06 07:11:20,515 INFO L131 PetriNetUnfolder]: For 78/145 co-relation queries the response was YES. [2022-12-06 07:11:20,516 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 07:11:20,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 55 transitions, 256 flow [2022-12-06 07:11:20,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 896 [2022-12-06 07:11:20,525 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:20,529 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 07:11:20,529 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 55 transitions, 256 flow [2022-12-06 07:11:20,529 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 07:11:20,529 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:20,529 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 07:11:20,537 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 07:11:20,735 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 07:11:20,735 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 07:11:20,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1123309206, now seen corresponding path program 1 times [2022-12-06 07:11:20,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:20,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637563596] [2022-12-06 07:11:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:20,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:21,050 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 07:11:21,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:21,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637563596] [2022-12-06 07:11:21,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637563596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:11:21,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:11:21,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:11:21,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574529659] [2022-12-06 07:11:21,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:11:21,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:11:21,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:21,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:11:21,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:11:21,056 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:21,057 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 07:11:21,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:21,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:21,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:21,725 INFO L130 PetriNetUnfolder]: 6581/8067 cut-off events. [2022-12-06 07:11:21,725 INFO L131 PetriNetUnfolder]: For 10006/10006 co-relation queries the response was YES. [2022-12-06 07:11:21,735 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 07:11:21,768 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 80 selfloop transitions, 19 changer transitions 9/108 dead transitions. [2022-12-06 07:11:21,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 644 flow [2022-12-06 07:11:21,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:11:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:11:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-06 07:11:21,771 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6351351351351351 [2022-12-06 07:11:21,771 INFO L175 Difference]: Start difference. First operand has 48 places, 55 transitions, 256 flow. Second operand 4 states and 94 transitions. [2022-12-06 07:11:21,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 644 flow [2022-12-06 07:11:21,784 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 07:11:21,787 INFO L231 Difference]: Finished difference. Result has 51 places, 63 transitions, 336 flow [2022-12-06 07:11:21,787 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 07:11:21,788 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2022-12-06 07:11:21,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:21,788 INFO L89 Accepts]: Start accepts. Operand has 51 places, 63 transitions, 336 flow [2022-12-06 07:11:21,791 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:21,791 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:21,791 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 63 transitions, 336 flow [2022-12-06 07:11:21,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 63 transitions, 336 flow [2022-12-06 07:11:21,805 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 07:11:21,806 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 07:11:21,806 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:21,806 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:21,806 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 07:11:21,817 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 07:11:21,817 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-06 07:11:21,817 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 07:11:21,818 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 07:11:21,818 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 07:11:21,819 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 07:11:21,819 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-06 07:11:21,819 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 07:11:21,819 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 07:11:21,819 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 07:11:21,828 INFO L130 PetriNetUnfolder]: 227/400 cut-off events. [2022-12-06 07:11:21,829 INFO L131 PetriNetUnfolder]: For 199/232 co-relation queries the response was YES. [2022-12-06 07:11:21,830 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 07:11:21,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 63 transitions, 336 flow [2022-12-06 07:11:21,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 1006 [2022-12-06 07:11:21,839 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:21,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 07:11:21,842 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 63 transitions, 336 flow [2022-12-06 07:11:21,842 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 07:11:21,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:21,843 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 07:11:21,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:11:21,843 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 07:11:21,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:21,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1861717892, now seen corresponding path program 2 times [2022-12-06 07:11:21,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:21,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238717405] [2022-12-06 07:11:21,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:21,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:22,066 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 07:11:22,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:22,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238717405] [2022-12-06 07:11:22,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238717405] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:11:22,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400933198] [2022-12-06 07:11:22,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:11:22,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:11:22,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:11:22,069 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 07:11:22,079 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 07:11:22,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 07:11:22,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:11:22,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 07:11:22,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:11:22,263 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 07:11:22,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:11:22,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400933198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:11:22,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:11:22,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2022-12-06 07:11:22,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6382942] [2022-12-06 07:11:22,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:11:22,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:11:22,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:22,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:11:22,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:11:22,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:22,266 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 07:11:22,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:22,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:22,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:23,090 INFO L130 PetriNetUnfolder]: 9661/11781 cut-off events. [2022-12-06 07:11:23,090 INFO L131 PetriNetUnfolder]: For 13779/13779 co-relation queries the response was YES. [2022-12-06 07:11:23,102 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 07:11:23,143 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 77 selfloop transitions, 13 changer transitions 1/91 dead transitions. [2022-12-06 07:11:23,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 91 transitions, 613 flow [2022-12-06 07:11:23,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:11:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:11:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-06 07:11:23,147 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5765765765765766 [2022-12-06 07:11:23,148 INFO L175 Difference]: Start difference. First operand has 51 places, 63 transitions, 336 flow. Second operand 3 states and 64 transitions. [2022-12-06 07:11:23,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 91 transitions, 613 flow [2022-12-06 07:11:23,161 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 07:11:23,162 INFO L231 Difference]: Finished difference. Result has 53 places, 65 transitions, 372 flow [2022-12-06 07:11:23,162 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 07:11:23,164 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2022-12-06 07:11:23,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:23,165 INFO L89 Accepts]: Start accepts. Operand has 53 places, 65 transitions, 372 flow [2022-12-06 07:11:23,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:23,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:23,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 65 transitions, 372 flow [2022-12-06 07:11:23,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 65 transitions, 372 flow [2022-12-06 07:11:23,194 INFO L130 PetriNetUnfolder]: 227/404 cut-off events. [2022-12-06 07:11:23,194 INFO L131 PetriNetUnfolder]: For 287/392 co-relation queries the response was YES. [2022-12-06 07:11:23,196 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 07:11:23,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 65 transitions, 372 flow [2022-12-06 07:11:23,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 1086 [2022-12-06 07:11:23,202 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:23,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 07:11:23,203 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 65 transitions, 372 flow [2022-12-06 07:11:23,203 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 07:11:23,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:23,203 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 07:11:23,212 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 07:11:23,409 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 07:11:23,409 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 07:11:23,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:23,410 INFO L85 PathProgramCache]: Analyzing trace with hash -884258649, now seen corresponding path program 1 times [2022-12-06 07:11:23,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:23,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610623671] [2022-12-06 07:11:23,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:23,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:23,868 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 07:11:23,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:23,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610623671] [2022-12-06 07:11:23,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610623671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:11:23,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:11:23,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:11:23,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228443080] [2022-12-06 07:11:23,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:11:23,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:11:23,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:23,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:11:23,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:11:23,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:23,870 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 07:11:23,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:23,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:23,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:24,890 INFO L130 PetriNetUnfolder]: 9535/11655 cut-off events. [2022-12-06 07:11:24,890 INFO L131 PetriNetUnfolder]: For 18618/18618 co-relation queries the response was YES. [2022-12-06 07:11:24,902 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 07:11:24,936 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 80 selfloop transitions, 27 changer transitions 15/122 dead transitions. [2022-12-06 07:11:24,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 122 transitions, 830 flow [2022-12-06 07:11:24,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:11:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:11:24,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-06 07:11:24,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6351351351351351 [2022-12-06 07:11:24,938 INFO L175 Difference]: Start difference. First operand has 53 places, 65 transitions, 372 flow. Second operand 4 states and 94 transitions. [2022-12-06 07:11:24,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 122 transitions, 830 flow [2022-12-06 07:11:24,956 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 07:11:24,959 INFO L231 Difference]: Finished difference. Result has 56 places, 75 transitions, 510 flow [2022-12-06 07:11:24,959 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 07:11:24,962 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2022-12-06 07:11:24,962 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:24,962 INFO L89 Accepts]: Start accepts. Operand has 56 places, 75 transitions, 510 flow [2022-12-06 07:11:24,964 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:24,964 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:24,964 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 75 transitions, 510 flow [2022-12-06 07:11:24,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 75 transitions, 510 flow [2022-12-06 07:11:25,005 INFO L130 PetriNetUnfolder]: 367/663 cut-off events. [2022-12-06 07:11:25,005 INFO L131 PetriNetUnfolder]: For 565/677 co-relation queries the response was YES. [2022-12-06 07:11:25,008 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 07:11:25,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 75 transitions, 510 flow [2022-12-06 07:11:25,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 1216 [2022-12-06 07:11:25,019 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:25,019 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 07:11:25,019 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 75 transitions, 510 flow [2022-12-06 07:11:25,020 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 07:11:25,020 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:25,020 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 07:11:25,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:11:25,020 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 07:11:25,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1810715049, now seen corresponding path program 1 times [2022-12-06 07:11:25,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:25,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136562794] [2022-12-06 07:11:25,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:25,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:25,268 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 07:11:25,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:25,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136562794] [2022-12-06 07:11:25,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136562794] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:11:25,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820521323] [2022-12-06 07:11:25,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:25,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:11:25,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:11:25,270 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 07:11:25,272 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 07:11:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:25,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 07:11:25,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:11:25,498 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 07:11:25,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:11:25,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820521323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:11:25,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:11:25,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2022-12-06 07:11:25,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486198947] [2022-12-06 07:11:25,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:11:25,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:11:25,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:25,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:11:25,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:11:25,500 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:25,500 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 07:11:25,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:25,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:25,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:26,683 INFO L130 PetriNetUnfolder]: 12615/15369 cut-off events. [2022-12-06 07:11:26,683 INFO L131 PetriNetUnfolder]: For 25466/25466 co-relation queries the response was YES. [2022-12-06 07:11:26,707 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 07:11:26,755 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 89 selfloop transitions, 13 changer transitions 9/111 dead transitions. [2022-12-06 07:11:26,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 111 transitions, 855 flow [2022-12-06 07:11:26,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:11:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:11:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-06 07:11:26,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2022-12-06 07:11:26,757 INFO L175 Difference]: Start difference. First operand has 56 places, 75 transitions, 510 flow. Second operand 3 states and 72 transitions. [2022-12-06 07:11:26,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 111 transitions, 855 flow [2022-12-06 07:11:26,782 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 07:11:26,784 INFO L231 Difference]: Finished difference. Result has 58 places, 77 transitions, 538 flow [2022-12-06 07:11:26,784 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 07:11:26,785 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2022-12-06 07:11:26,785 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:26,785 INFO L89 Accepts]: Start accepts. Operand has 58 places, 77 transitions, 538 flow [2022-12-06 07:11:26,787 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:26,788 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:26,788 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 77 transitions, 538 flow [2022-12-06 07:11:26,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 77 transitions, 538 flow [2022-12-06 07:11:26,948 INFO L130 PetriNetUnfolder]: 408/744 cut-off events. [2022-12-06 07:11:26,948 INFO L131 PetriNetUnfolder]: For 690/818 co-relation queries the response was YES. [2022-12-06 07:11:26,951 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 07:11:26,960 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 77 transitions, 538 flow [2022-12-06 07:11:26,961 INFO L188 LiptonReduction]: Number of co-enabled transitions 1268 [2022-12-06 07:11:26,962 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:26,963 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:11:26,963 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 77 transitions, 538 flow [2022-12-06 07:11:26,963 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 07:11:26,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:26,964 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 07:11:26,972 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 07:11:27,170 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 07:11:27,170 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 07:11:27,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash -380031148, now seen corresponding path program 1 times [2022-12-06 07:11:27,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:27,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402975826] [2022-12-06 07:11:27,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:27,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:27,378 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 07:11:27,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:27,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402975826] [2022-12-06 07:11:27,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402975826] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:11:27,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158456811] [2022-12-06 07:11:27,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:27,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:11:27,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:11:27,380 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 07:11:27,383 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 07:11:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:27,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:11:27,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:11:27,590 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 07:11:27,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:11:27,644 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 07:11:27,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158456811] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:11:27,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:11:27,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 07:11:27,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101294447] [2022-12-06 07:11:27,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:11:27,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:11:27,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:27,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:11:27,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:11:27,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:27,646 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 07:11:27,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:27,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:27,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:29,520 INFO L130 PetriNetUnfolder]: 17771/21680 cut-off events. [2022-12-06 07:11:29,520 INFO L131 PetriNetUnfolder]: For 39438/39438 co-relation queries the response was YES. [2022-12-06 07:11:29,552 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 07:11:29,607 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 127 selfloop transitions, 32 changer transitions 35/194 dead transitions. [2022-12-06 07:11:29,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 194 transitions, 1337 flow [2022-12-06 07:11:29,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:11:29,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:11:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2022-12-06 07:11:29,609 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2022-12-06 07:11:29,609 INFO L175 Difference]: Start difference. First operand has 58 places, 77 transitions, 538 flow. Second operand 6 states and 155 transitions. [2022-12-06 07:11:29,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 194 transitions, 1337 flow [2022-12-06 07:11:29,642 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 07:11:29,647 INFO L231 Difference]: Finished difference. Result has 64 places, 79 transitions, 620 flow [2022-12-06 07:11:29,647 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 07:11:29,649 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2022-12-06 07:11:29,649 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:29,649 INFO L89 Accepts]: Start accepts. Operand has 64 places, 79 transitions, 620 flow [2022-12-06 07:11:29,651 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:29,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:29,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 79 transitions, 620 flow [2022-12-06 07:11:29,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 79 transitions, 620 flow [2022-12-06 07:11:29,713 INFO L130 PetriNetUnfolder]: 432/929 cut-off events. [2022-12-06 07:11:29,714 INFO L131 PetriNetUnfolder]: For 1157/1298 co-relation queries the response was YES. [2022-12-06 07:11:29,718 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 07:11:29,733 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 79 transitions, 620 flow [2022-12-06 07:11:29,733 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 07:11:29,735 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:29,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:11:29,737 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 79 transitions, 620 flow [2022-12-06 07:11:29,737 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 07:11:29,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:29,737 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 07:11:29,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 07:11:29,943 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 07:11:29,943 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 07:11:29,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:29,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1566953028, now seen corresponding path program 1 times [2022-12-06 07:11:29,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:29,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057916523] [2022-12-06 07:11:29,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:29,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:30,188 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 07:11:30,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:30,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057916523] [2022-12-06 07:11:30,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057916523] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:11:30,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636241765] [2022-12-06 07:11:30,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:30,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:11:30,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:11:30,190 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 07:11:30,212 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 07:11:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:30,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:11:30,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:11:30,409 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 07:11:30,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:11:30,543 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 07:11:30,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636241765] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:11:30,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:11:30,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 07:11:30,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678325942] [2022-12-06 07:11:30,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:11:30,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:11:30,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:30,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:11:30,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:11:30,546 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:30,546 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 07:11:30,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:30,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:30,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:32,627 INFO L130 PetriNetUnfolder]: 23171/28330 cut-off events. [2022-12-06 07:11:32,627 INFO L131 PetriNetUnfolder]: For 66981/66981 co-relation queries the response was YES. [2022-12-06 07:11:32,683 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 07:11:32,743 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 142 selfloop transitions, 32 changer transitions 18/192 dead transitions. [2022-12-06 07:11:32,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 192 transitions, 1497 flow [2022-12-06 07:11:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:11:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:11:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2022-12-06 07:11:32,744 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6441441441441441 [2022-12-06 07:11:32,744 INFO L175 Difference]: Start difference. First operand has 64 places, 79 transitions, 620 flow. Second operand 6 states and 143 transitions. [2022-12-06 07:11:32,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 192 transitions, 1497 flow [2022-12-06 07:11:32,818 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 07:11:32,820 INFO L231 Difference]: Finished difference. Result has 69 places, 81 transitions, 673 flow [2022-12-06 07:11:32,820 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 07:11:32,821 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2022-12-06 07:11:32,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:32,821 INFO L89 Accepts]: Start accepts. Operand has 69 places, 81 transitions, 673 flow [2022-12-06 07:11:32,822 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:32,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:32,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 81 transitions, 673 flow [2022-12-06 07:11:32,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 81 transitions, 673 flow [2022-12-06 07:11:32,896 INFO L130 PetriNetUnfolder]: 426/1010 cut-off events. [2022-12-06 07:11:32,896 INFO L131 PetriNetUnfolder]: For 1338/1667 co-relation queries the response was YES. [2022-12-06 07:11:32,902 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 07:11:32,915 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 81 transitions, 673 flow [2022-12-06 07:11:32,915 INFO L188 LiptonReduction]: Number of co-enabled transitions 1392 [2022-12-06 07:11:32,917 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:32,918 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 07:11:32,918 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 81 transitions, 673 flow [2022-12-06 07:11:32,918 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 07:11:32,918 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:32,918 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 07:11:32,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 07:11:33,124 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 07:11:33,124 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 07:11:33,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:33,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1775078782, now seen corresponding path program 1 times [2022-12-06 07:11:33,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:33,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440864950] [2022-12-06 07:11:33,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:33,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:33,420 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 07:11:33,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:33,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440864950] [2022-12-06 07:11:33,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440864950] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:11:33,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558990357] [2022-12-06 07:11:33,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:33,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:11:33,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:11:33,424 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 07:11:33,426 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 07:11:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:33,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:11:33,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:11:33,630 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 07:11:33,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:11:33,686 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 07:11:33,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558990357] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:11:33,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:11:33,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 07:11:33,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453055052] [2022-12-06 07:11:33,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:11:33,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:11:33,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:33,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:11:33,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:11:33,690 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:33,690 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 07:11:33,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:33,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:33,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:36,412 INFO L130 PetriNetUnfolder]: 32931/40393 cut-off events. [2022-12-06 07:11:36,413 INFO L131 PetriNetUnfolder]: For 118631/118631 co-relation queries the response was YES. [2022-12-06 07:11:36,477 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 07:11:36,556 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 165 selfloop transitions, 30 changer transitions 25/220 dead transitions. [2022-12-06 07:11:36,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 220 transitions, 1816 flow [2022-12-06 07:11:36,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:11:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:11:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2022-12-06 07:11:36,557 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6801801801801802 [2022-12-06 07:11:36,557 INFO L175 Difference]: Start difference. First operand has 69 places, 81 transitions, 673 flow. Second operand 6 states and 151 transitions. [2022-12-06 07:11:36,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 220 transitions, 1816 flow [2022-12-06 07:11:36,721 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 07:11:36,724 INFO L231 Difference]: Finished difference. Result has 74 places, 83 transitions, 716 flow [2022-12-06 07:11:36,724 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 07:11:36,725 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 24 predicate places. [2022-12-06 07:11:36,725 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:36,725 INFO L89 Accepts]: Start accepts. Operand has 74 places, 83 transitions, 716 flow [2022-12-06 07:11:36,727 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:36,727 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:36,727 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 83 transitions, 716 flow [2022-12-06 07:11:36,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 83 transitions, 716 flow [2022-12-06 07:11:36,785 INFO L130 PetriNetUnfolder]: 420/1104 cut-off events. [2022-12-06 07:11:36,785 INFO L131 PetriNetUnfolder]: For 1256/1709 co-relation queries the response was YES. [2022-12-06 07:11:36,790 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 07:11:36,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 83 transitions, 716 flow [2022-12-06 07:11:36,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 1540 [2022-12-06 07:11:36,805 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:36,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 07:11:36,806 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 83 transitions, 716 flow [2022-12-06 07:11:36,806 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 07:11:36,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:36,806 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 07:11:36,815 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 07:11:37,011 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 07:11:37,012 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 07:11:37,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:37,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1899891782, now seen corresponding path program 1 times [2022-12-06 07:11:37,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:37,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386433561] [2022-12-06 07:11:37,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:37,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:37,308 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 07:11:37,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:37,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386433561] [2022-12-06 07:11:37,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386433561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:11:37,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:11:37,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:11:37,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310865209] [2022-12-06 07:11:37,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:11:37,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:11:37,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:37,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:11:37,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:11:37,312 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:37,312 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 07:11:37,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:37,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:37,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:40,302 INFO L130 PetriNetUnfolder]: 37866/46390 cut-off events. [2022-12-06 07:11:40,302 INFO L131 PetriNetUnfolder]: For 156657/156657 co-relation queries the response was YES. [2022-12-06 07:11:40,380 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 07:11:40,462 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 100 selfloop transitions, 26 changer transitions 12/138 dead transitions. [2022-12-06 07:11:40,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 138 transitions, 1247 flow [2022-12-06 07:11:40,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:11:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:11:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-06 07:11:40,463 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2022-12-06 07:11:40,463 INFO L175 Difference]: Start difference. First operand has 74 places, 83 transitions, 716 flow. Second operand 4 states and 92 transitions. [2022-12-06 07:11:40,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 138 transitions, 1247 flow [2022-12-06 07:11:41,063 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 07:11:41,065 INFO L231 Difference]: Finished difference. Result has 75 places, 84 transitions, 730 flow [2022-12-06 07:11:41,066 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 07:11:41,066 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 25 predicate places. [2022-12-06 07:11:41,066 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:41,066 INFO L89 Accepts]: Start accepts. Operand has 75 places, 84 transitions, 730 flow [2022-12-06 07:11:41,080 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:41,080 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:41,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 84 transitions, 730 flow [2022-12-06 07:11:41,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 84 transitions, 730 flow [2022-12-06 07:11:41,161 INFO L130 PetriNetUnfolder]: 470/1215 cut-off events. [2022-12-06 07:11:41,161 INFO L131 PetriNetUnfolder]: For 1330/1808 co-relation queries the response was YES. [2022-12-06 07:11:41,167 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 07:11:41,184 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 84 transitions, 730 flow [2022-12-06 07:11:41,184 INFO L188 LiptonReduction]: Number of co-enabled transitions 1584 [2022-12-06 07:11:41,187 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:41,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-06 07:11:41,188 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 84 transitions, 730 flow [2022-12-06 07:11:41,188 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 07:11:41,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:41,188 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 07:11:41,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:11:41,188 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 07:11:41,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:41,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1181021440, now seen corresponding path program 2 times [2022-12-06 07:11:41,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:41,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355268306] [2022-12-06 07:11:41,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:41,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:41,464 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 07:11:41,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:41,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355268306] [2022-12-06 07:11:41,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355268306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:11:41,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:11:41,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:11:41,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793462856] [2022-12-06 07:11:41,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:11:41,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:11:41,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:41,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:11:41,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:11:41,466 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:11:41,466 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 07:11:41,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:41,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:11:41,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:45,174 INFO L130 PetriNetUnfolder]: 43850/53622 cut-off events. [2022-12-06 07:11:45,174 INFO L131 PetriNetUnfolder]: For 168551/168551 co-relation queries the response was YES. [2022-12-06 07:11:45,259 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 07:11:45,345 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 105 selfloop transitions, 26 changer transitions 12/143 dead transitions. [2022-12-06 07:11:45,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 143 transitions, 1307 flow [2022-12-06 07:11:45,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:11:45,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:11:45,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-06 07:11:45,346 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2022-12-06 07:11:45,346 INFO L175 Difference]: Start difference. First operand has 75 places, 84 transitions, 730 flow. Second operand 4 states and 92 transitions. [2022-12-06 07:11:45,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 143 transitions, 1307 flow [2022-12-06 07:11:45,746 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 07:11:45,748 INFO L231 Difference]: Finished difference. Result has 77 places, 85 transitions, 746 flow [2022-12-06 07:11:45,748 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 07:11:45,748 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 27 predicate places. [2022-12-06 07:11:45,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:45,749 INFO L89 Accepts]: Start accepts. Operand has 77 places, 85 transitions, 746 flow [2022-12-06 07:11:45,750 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:45,750 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:45,750 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 85 transitions, 746 flow [2022-12-06 07:11:45,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 85 transitions, 746 flow [2022-12-06 07:11:45,833 INFO L130 PetriNetUnfolder]: 493/1223 cut-off events. [2022-12-06 07:11:45,833 INFO L131 PetriNetUnfolder]: For 1428/1953 co-relation queries the response was YES. [2022-12-06 07:11:45,838 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 07:11:45,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 85 transitions, 746 flow [2022-12-06 07:11:45,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 1648 [2022-12-06 07:11:45,857 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 07:11:45,885 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 07:11:45,917 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:11:45,917 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:11:45,917 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 85 transitions, 752 flow [2022-12-06 07:11:45,918 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 07:11:45,918 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:45,918 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 07:11:45,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:11:45,918 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 07:11:45,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:45,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1278856560, now seen corresponding path program 3 times [2022-12-06 07:11:45,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:45,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805394019] [2022-12-06 07:11:45,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:45,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:46,073 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 07:11:46,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:46,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805394019] [2022-12-06 07:11:46,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805394019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:11:46,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:11:46,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:11:46,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993170194] [2022-12-06 07:11:46,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:11:46,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:11:46,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:46,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:11:46,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:11:46,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:11:46,076 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 07:11:46,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:46,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:11:46,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:50,285 INFO L130 PetriNetUnfolder]: 49282/60261 cut-off events. [2022-12-06 07:11:50,285 INFO L131 PetriNetUnfolder]: For 201902/201902 co-relation queries the response was YES. [2022-12-06 07:11:50,398 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 07:11:50,496 INFO L137 encePairwiseOnDemand]: 30/39 looper letters, 107 selfloop transitions, 29 changer transitions 22/158 dead transitions. [2022-12-06 07:11:50,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 158 transitions, 1403 flow [2022-12-06 07:11:50,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:11:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:11:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-12-06 07:11:50,497 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6794871794871795 [2022-12-06 07:11:50,498 INFO L175 Difference]: Start difference. First operand has 77 places, 85 transitions, 752 flow. Second operand 4 states and 106 transitions. [2022-12-06 07:11:50,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 158 transitions, 1403 flow [2022-12-06 07:11:51,182 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 07:11:51,184 INFO L231 Difference]: Finished difference. Result has 80 places, 91 transitions, 851 flow [2022-12-06 07:11:51,184 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 07:11:51,185 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 30 predicate places. [2022-12-06 07:11:51,185 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:51,185 INFO L89 Accepts]: Start accepts. Operand has 80 places, 91 transitions, 851 flow [2022-12-06 07:11:51,186 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:51,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:51,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 91 transitions, 851 flow [2022-12-06 07:11:51,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 91 transitions, 851 flow [2022-12-06 07:11:51,283 INFO L130 PetriNetUnfolder]: 620/1437 cut-off events. [2022-12-06 07:11:51,283 INFO L131 PetriNetUnfolder]: For 2019/3010 co-relation queries the response was YES. [2022-12-06 07:11:51,290 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 07:11:51,305 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 91 transitions, 851 flow [2022-12-06 07:11:51,305 INFO L188 LiptonReduction]: Number of co-enabled transitions 1786 [2022-12-06 07:11:51,308 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 07:11:51,336 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 07:11:51,371 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:11:51,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 07:11:51,372 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 91 transitions, 857 flow [2022-12-06 07:11:51,372 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 07:11:51,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:51,372 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 07:11:51,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 07:11:51,372 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 07:11:51,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:51,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2137424200, now seen corresponding path program 1 times [2022-12-06 07:11:51,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:51,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534843975] [2022-12-06 07:11:51,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:51,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:51,581 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 07:11:51,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:51,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534843975] [2022-12-06 07:11:51,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534843975] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:11:51,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254936860] [2022-12-06 07:11:51,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:51,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:11:51,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:11:51,584 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 07:11:51,616 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 07:11:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:51,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:11:51,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:11:51,803 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 07:11:51,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:11:51,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254936860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:11:51,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:11:51,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-12-06 07:11:51,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124200324] [2022-12-06 07:11:51,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:11:51,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:11:51,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:51,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:11:51,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:11:51,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 07:11:51,806 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 07:11:51,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:51,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 07:11:51,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:55,231 INFO L130 PetriNetUnfolder]: 43628/53419 cut-off events. [2022-12-06 07:11:55,231 INFO L131 PetriNetUnfolder]: For 205646/205646 co-relation queries the response was YES. [2022-12-06 07:11:55,348 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 07:11:55,438 INFO L137 encePairwiseOnDemand]: 36/41 looper letters, 126 selfloop transitions, 14 changer transitions 53/193 dead transitions. [2022-12-06 07:11:55,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 193 transitions, 1818 flow [2022-12-06 07:11:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:11:55,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:11:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-06 07:11:55,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5414634146341464 [2022-12-06 07:11:55,440 INFO L175 Difference]: Start difference. First operand has 80 places, 91 transitions, 857 flow. Second operand 5 states and 111 transitions. [2022-12-06 07:11:55,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 193 transitions, 1818 flow [2022-12-06 07:11:56,141 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 07:11:56,143 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 687 flow [2022-12-06 07:11:56,143 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 07:11:56,143 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 34 predicate places. [2022-12-06 07:11:56,143 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:56,143 INFO L89 Accepts]: Start accepts. Operand has 84 places, 77 transitions, 687 flow [2022-12-06 07:11:56,144 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:56,144 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:56,144 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 77 transitions, 687 flow [2022-12-06 07:11:56,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 687 flow [2022-12-06 07:11:56,199 INFO L130 PetriNetUnfolder]: 447/1029 cut-off events. [2022-12-06 07:11:56,199 INFO L131 PetriNetUnfolder]: For 1804/2567 co-relation queries the response was YES. [2022-12-06 07:11:56,205 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 07:11:56,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 687 flow [2022-12-06 07:11:56,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 1534 [2022-12-06 07:11:56,218 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:56,218 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:11:56,218 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 687 flow [2022-12-06 07:11:56,219 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 07:11:56,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:56,219 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 07:11:56,225 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 07:11:56,420 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 07:11:56,420 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 07:11:56,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:11:56,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1181230417, now seen corresponding path program 1 times [2022-12-06 07:11:56,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:11:56,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52323095] [2022-12-06 07:11:56,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:56,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:11:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:56,623 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 07:11:56,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:11:56,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52323095] [2022-12-06 07:11:56,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52323095] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:11:56,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768332105] [2022-12-06 07:11:56,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:11:56,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:11:56,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:11:56,625 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 07:11:56,628 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 07:11:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:11:56,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:11:56,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:11:56,839 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 07:11:56,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:11:56,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768332105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:11:56,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:11:56,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-06 07:11:56,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051309557] [2022-12-06 07:11:56,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:11:56,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:11:56,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:56,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:11:56,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:11:56,840 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 07:11:56,840 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 07:11:56,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:56,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 07:11:56,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:59,332 INFO L130 PetriNetUnfolder]: 29234/35628 cut-off events. [2022-12-06 07:11:59,333 INFO L131 PetriNetUnfolder]: For 146823/146823 co-relation queries the response was YES. [2022-12-06 07:11:59,398 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 07:11:59,467 INFO L137 encePairwiseOnDemand]: 33/38 looper letters, 131 selfloop transitions, 8 changer transitions 50/189 dead transitions. [2022-12-06 07:11:59,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 189 transitions, 1757 flow [2022-12-06 07:11:59,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:11:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:11:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-06 07:11:59,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5894736842105263 [2022-12-06 07:11:59,468 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 687 flow. Second operand 5 states and 112 transitions. [2022-12-06 07:11:59,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 189 transitions, 1757 flow [2022-12-06 07:11:59,842 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 07:11:59,843 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 551 flow [2022-12-06 07:11:59,843 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 07:11:59,844 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 34 predicate places. [2022-12-06 07:11:59,844 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:11:59,844 INFO L89 Accepts]: Start accepts. Operand has 84 places, 70 transitions, 551 flow [2022-12-06 07:11:59,846 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:11:59,846 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:11:59,846 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 70 transitions, 551 flow [2022-12-06 07:11:59,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 70 transitions, 551 flow [2022-12-06 07:11:59,887 INFO L130 PetriNetUnfolder]: 334/710 cut-off events. [2022-12-06 07:11:59,887 INFO L131 PetriNetUnfolder]: For 1133/1809 co-relation queries the response was YES. [2022-12-06 07:11:59,892 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 07:11:59,899 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 70 transitions, 551 flow [2022-12-06 07:11:59,899 INFO L188 LiptonReduction]: Number of co-enabled transitions 1406 [2022-12-06 07:11:59,901 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:11:59,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 07:11:59,901 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 70 transitions, 551 flow [2022-12-06 07:11:59,901 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 07:11:59,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:11:59,902 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 07:11:59,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 07:12:00,104 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 07:12:00,104 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 07:12:00,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:00,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1088195874, now seen corresponding path program 1 times [2022-12-06 07:12:00,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:00,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522125380] [2022-12-06 07:12:00,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:00,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:00,426 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 07:12:00,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:00,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522125380] [2022-12-06 07:12:00,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522125380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:12:00,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:12:00,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:12:00,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541023163] [2022-12-06 07:12:00,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:12:00,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:12:00,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:00,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:12:00,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:12:00,429 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:12:00,429 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 07:12:00,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:00,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:12:00,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:02,509 INFO L130 PetriNetUnfolder]: 24226/29333 cut-off events. [2022-12-06 07:12:02,509 INFO L131 PetriNetUnfolder]: For 127942/127942 co-relation queries the response was YES. [2022-12-06 07:12:02,559 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 07:12:02,626 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 102 selfloop transitions, 8 changer transitions 27/137 dead transitions. [2022-12-06 07:12:02,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 137 transitions, 1167 flow [2022-12-06 07:12:02,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:12:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:12:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-06 07:12:02,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5297297297297298 [2022-12-06 07:12:02,627 INFO L175 Difference]: Start difference. First operand has 82 places, 70 transitions, 551 flow. Second operand 5 states and 98 transitions. [2022-12-06 07:12:02,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 137 transitions, 1167 flow [2022-12-06 07:12:02,876 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 07:12:02,878 INFO L231 Difference]: Finished difference. Result has 85 places, 65 transitions, 481 flow [2022-12-06 07:12:02,878 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 07:12:02,879 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2022-12-06 07:12:02,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:02,879 INFO L89 Accepts]: Start accepts. Operand has 85 places, 65 transitions, 481 flow [2022-12-06 07:12:02,880 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:02,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:02,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 65 transitions, 481 flow [2022-12-06 07:12:02,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 65 transitions, 481 flow [2022-12-06 07:12:02,916 INFO L130 PetriNetUnfolder]: 278/648 cut-off events. [2022-12-06 07:12:02,916 INFO L131 PetriNetUnfolder]: For 1051/1462 co-relation queries the response was YES. [2022-12-06 07:12:02,919 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 07:12:02,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 65 transitions, 481 flow [2022-12-06 07:12:02,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 1312 [2022-12-06 07:12:02,927 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:12:02,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 07:12:02,928 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 481 flow [2022-12-06 07:12:02,928 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 07:12:02,928 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:02,928 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 07:12:02,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 07:12:02,928 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 07:12:02,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash 769146017, now seen corresponding path program 1 times [2022-12-06 07:12:02,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:02,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694094488] [2022-12-06 07:12:02,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:02,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:03,098 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 07:12:03,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:03,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694094488] [2022-12-06 07:12:03,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694094488] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:12:03,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903784095] [2022-12-06 07:12:03,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:03,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:12:03,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:12:03,100 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 07:12:03,102 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 07:12:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:03,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:12:03,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:12:03,287 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 07:12:03,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:12:03,336 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 07:12:03,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903784095] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:12:03,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:12:03,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-12-06 07:12:03,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989404528] [2022-12-06 07:12:03,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:12:03,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:12:03,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:03,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:12:03,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:12:03,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:12:03,338 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 07:12:03,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:03,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:12:03,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:06,686 INFO L130 PetriNetUnfolder]: 31652/38211 cut-off events. [2022-12-06 07:12:06,686 INFO L131 PetriNetUnfolder]: For 171224/171224 co-relation queries the response was YES. [2022-12-06 07:12:06,796 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 07:12:06,892 INFO L137 encePairwiseOnDemand]: 26/37 looper letters, 366 selfloop transitions, 69 changer transitions 0/435 dead transitions. [2022-12-06 07:12:06,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 435 transitions, 3655 flow [2022-12-06 07:12:06,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 07:12:06,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 07:12:06,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 311 transitions. [2022-12-06 07:12:06,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.466966966966967 [2022-12-06 07:12:06,894 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 481 flow. Second operand 18 states and 311 transitions. [2022-12-06 07:12:06,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 435 transitions, 3655 flow [2022-12-06 07:12:07,420 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 07:12:07,424 INFO L231 Difference]: Finished difference. Result has 110 places, 125 transitions, 1244 flow [2022-12-06 07:12:07,424 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 07:12:07,424 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 60 predicate places. [2022-12-06 07:12:07,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:07,425 INFO L89 Accepts]: Start accepts. Operand has 110 places, 125 transitions, 1244 flow [2022-12-06 07:12:07,426 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:07,426 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:07,426 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 125 transitions, 1244 flow [2022-12-06 07:12:07,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 125 transitions, 1244 flow [2022-12-06 07:12:07,507 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 07:12:07,507 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-06 07:12:07,507 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 07:12:07,507 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 07:12:07,507 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 07:12:07,527 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 07:12:07,528 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,528 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,528 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 07:12:07,528 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,532 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 07:12:07,532 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 07:12:07,532 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 07:12:07,532 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 07:12:07,532 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 07:12:07,641 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 07:12:07,641 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 07:12:07,641 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 07:12:07,641 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 07:12:07,641 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 07:12:07,644 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 07:12:07,644 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 07:12:07,644 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 07:12:07,644 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 07:12:07,644 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,653 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 07:12:07,653 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,653 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 07:12:07,653 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,653 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,653 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 07:12:07,653 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,653 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,653 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 07:12:07,653 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,654 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,654 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 07:12:07,654 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,654 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,654 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,654 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,654 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 07:12:07,655 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,655 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,655 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,655 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,656 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 07:12:07,656 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 07:12:07,656 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:07,656 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:12:07,656 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:07,657 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 07:12:07,657 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,657 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,657 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:12:07,657 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 07:12:07,657 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 07:12:07,657 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 07:12:07,657 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:12:07,657 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:07,657 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:07,658 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 07:12:07,658 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 07:12:07,658 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:12:07,658 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:07,658 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:07,663 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 07:12:07,664 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-06 07:12:07,664 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:12:07,664 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 07:12:07,664 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:12:07,664 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:12:07,664 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 07:12:07,664 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 07:12:07,664 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 07:12:07,664 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 07:12:07,664 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 07:12:07,664 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 07:12:07,664 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 07:12:07,664 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-06 07:12:07,664 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:12:07,664 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:12:07,665 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:12:07,665 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:12:07,665 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 07:12:07,665 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 07:12:07,665 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 07:12:07,665 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 07:12:07,665 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 07:12:07,665 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 07:12:07,665 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-06 07:12:07,665 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:12:07,665 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:12:07,665 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:12:07,665 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:12:07,666 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 07:12:07,666 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2022-12-06 07:12:07,666 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 07:12:07,666 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 07:12:07,667 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 07:12:07,667 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 07:12:07,667 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-06 07:12:07,667 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 07:12:07,667 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 07:12:07,667 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 07:12:07,667 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 07:12:07,667 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2022-12-06 07:12:07,667 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 07:12:07,667 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 07:12:07,667 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 07:12:07,674 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 07:12:07,675 INFO L382 tUnfolder$Statistics]: this new event has 27 ancestors and is not cut-off event [2022-12-06 07:12:07,675 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-12-06 07:12:07,675 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2022-12-06 07:12:07,675 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-12-06 07:12:07,682 INFO L130 PetriNetUnfolder]: 1275/2057 cut-off events. [2022-12-06 07:12:07,682 INFO L131 PetriNetUnfolder]: For 23322/25312 co-relation queries the response was YES. [2022-12-06 07:12:07,698 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 07:12:07,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 125 transitions, 1244 flow [2022-12-06 07:12:07,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 2896 [2022-12-06 07:12:07,770 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 07:12:07,823 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 07:12:07,874 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 07:12:07,926 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 07:12:08,016 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 07:12:08,070 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 07:12:08,122 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 07:12:08,173 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 07:12:08,224 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 07:12:08,276 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 07:12:08,332 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:12:08,333 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 909 [2022-12-06 07:12:08,333 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 124 transitions, 1350 flow [2022-12-06 07:12:08,333 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 07:12:08,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:08,333 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 07:12:08,340 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 07:12:08,534 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 07:12:08,534 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 07:12:08,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:08,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2081224798, now seen corresponding path program 1 times [2022-12-06 07:12:08,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:08,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197116612] [2022-12-06 07:12:08,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:08,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:08,735 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 07:12:08,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:08,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197116612] [2022-12-06 07:12:08,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197116612] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:12:08,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533610661] [2022-12-06 07:12:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:08,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:12:08,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:12:08,737 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 07:12:08,739 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 07:12:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:08,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:12:08,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:12:08,960 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 07:12:08,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:12:08,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533610661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:12:08,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:12:08,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-06 07:12:08,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693784656] [2022-12-06 07:12:08,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:12:08,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:12:08,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:08,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:12:08,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:12:08,962 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:12:08,962 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 07:12:08,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:08,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:12:08,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:11,658 INFO L130 PetriNetUnfolder]: 26210/31592 cut-off events. [2022-12-06 07:12:11,658 INFO L131 PetriNetUnfolder]: For 379036/379036 co-relation queries the response was YES. [2022-12-06 07:12:11,742 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 07:12:11,833 INFO L137 encePairwiseOnDemand]: 42/47 looper letters, 274 selfloop transitions, 8 changer transitions 92/374 dead transitions. [2022-12-06 07:12:11,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 374 transitions, 4725 flow [2022-12-06 07:12:11,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:12:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:12:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2022-12-06 07:12:11,843 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5914893617021276 [2022-12-06 07:12:11,843 INFO L175 Difference]: Start difference. First operand has 109 places, 124 transitions, 1350 flow. Second operand 5 states and 139 transitions. [2022-12-06 07:12:11,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 374 transitions, 4725 flow [2022-12-06 07:12:12,875 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 07:12:12,878 INFO L231 Difference]: Finished difference. Result has 110 places, 123 transitions, 1130 flow [2022-12-06 07:12:12,878 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 07:12:12,879 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 60 predicate places. [2022-12-06 07:12:12,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:12,879 INFO L89 Accepts]: Start accepts. Operand has 110 places, 123 transitions, 1130 flow [2022-12-06 07:12:12,880 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:12,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:12,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 123 transitions, 1130 flow [2022-12-06 07:12:12,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 123 transitions, 1130 flow [2022-12-06 07:12:12,964 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 07:12:12,964 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 07:12:12,964 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 07:12:12,964 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 07:12:12,964 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 07:12:12,964 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 07:12:12,965 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2022-12-06 07:12:12,965 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 07:12:12,965 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 07:12:12,965 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 07:12:12,968 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 07:12:12,968 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 07:12:12,968 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 07:12:12,968 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 07:12:12,968 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 07:12:12,968 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 07:12:12,968 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 07:12:12,969 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:12,969 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:12,969 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:12,971 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 07:12:12,971 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 07:12:12,971 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 07:12:12,971 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 07:12:12,971 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 07:12:12,971 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 07:12:12,971 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 07:12:12,971 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:12,971 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:12,971 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:12,973 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 07:12:12,973 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 07:12:12,973 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 07:12:12,974 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 07:12:12,974 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 07:12:12,974 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 07:12:12,974 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 07:12:12,974 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:12,974 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:12,974 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:12,974 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 07:12:12,974 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 07:12:12,974 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 07:12:12,974 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:12:12,974 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 07:12:12,989 INFO L130 PetriNetUnfolder]: 1045/1646 cut-off events. [2022-12-06 07:12:12,989 INFO L131 PetriNetUnfolder]: For 14209/15922 co-relation queries the response was YES. [2022-12-06 07:12:12,998 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 07:12:13,018 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 123 transitions, 1130 flow [2022-12-06 07:12:13,018 INFO L188 LiptonReduction]: Number of co-enabled transitions 2728 [2022-12-06 07:12:13,020 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:12:13,021 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-06 07:12:13,021 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 123 transitions, 1130 flow [2022-12-06 07:12:13,021 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 07:12:13,021 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:13,021 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 07:12:13,028 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 07:12:13,227 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 07:12:13,228 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 07:12:13,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:13,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1833989103, now seen corresponding path program 1 times [2022-12-06 07:12:13,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:13,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718599480] [2022-12-06 07:12:13,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:13,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:13,414 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 07:12:13,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:13,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718599480] [2022-12-06 07:12:13,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718599480] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:12:13,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444768116] [2022-12-06 07:12:13,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:13,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:12:13,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:12:13,420 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 07:12:13,422 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 07:12:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:13,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:12:13,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:12:13,635 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 07:12:13,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:12:13,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444768116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:12:13,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:12:13,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-06 07:12:13,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230358163] [2022-12-06 07:12:13,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:12:13,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:12:13,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:13,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:12:13,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:12:13,636 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:12:13,637 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 07:12:13,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:13,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:12:13,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:15,739 INFO L130 PetriNetUnfolder]: 21874/26107 cut-off events. [2022-12-06 07:12:15,739 INFO L131 PetriNetUnfolder]: For 239423/239423 co-relation queries the response was YES. [2022-12-06 07:12:15,967 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 07:12:16,060 INFO L137 encePairwiseOnDemand]: 43/47 looper letters, 271 selfloop transitions, 9 changer transitions 0/280 dead transitions. [2022-12-06 07:12:16,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 280 transitions, 3043 flow [2022-12-06 07:12:16,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:12:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:12:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2022-12-06 07:12:16,061 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5372340425531915 [2022-12-06 07:12:16,061 INFO L175 Difference]: Start difference. First operand has 108 places, 123 transitions, 1130 flow. Second operand 4 states and 101 transitions. [2022-12-06 07:12:16,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 280 transitions, 3043 flow [2022-12-06 07:12:16,785 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 07:12:16,788 INFO L231 Difference]: Finished difference. Result has 109 places, 124 transitions, 1138 flow [2022-12-06 07:12:16,788 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 07:12:16,788 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 59 predicate places. [2022-12-06 07:12:16,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:16,789 INFO L89 Accepts]: Start accepts. Operand has 109 places, 124 transitions, 1138 flow [2022-12-06 07:12:16,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:16,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:16,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 124 transitions, 1138 flow [2022-12-06 07:12:16,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 124 transitions, 1138 flow [2022-12-06 07:12:16,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: 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 07:12:16,887 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 07:12:16,887 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 07:12:16,887 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 07:12:16,887 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 07:12:16,888 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 07:12:16,888 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2022-12-06 07:12:16,888 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 07:12:16,888 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 07:12:16,888 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 07:12:16,893 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 07:12:16,893 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 07:12:16,893 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 07:12:16,893 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 07:12:16,893 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 07:12:16,894 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 07:12:16,894 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 07:12:16,894 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:16,894 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:16,894 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:16,896 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 07:12:16,896 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 07:12:16,897 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 07:12:16,897 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 07:12:16,897 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 07:12:16,897 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 07:12:16,897 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 07:12:16,897 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:16,897 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:16,897 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:16,898 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 07:12:16,898 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 07:12:16,898 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 07:12:16,898 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 07:12:16,898 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 07:12:16,899 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 07:12:16,899 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 07:12:16,899 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:16,899 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:16,899 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:12:16,899 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 07:12:16,899 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 07:12:16,899 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 07:12:16,899 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:12:16,899 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 07:12:17,005 INFO L130 PetriNetUnfolder]: 1259/1891 cut-off events. [2022-12-06 07:12:17,005 INFO L131 PetriNetUnfolder]: For 16094/17856 co-relation queries the response was YES. [2022-12-06 07:12:17,016 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 07:12:17,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 124 transitions, 1138 flow [2022-12-06 07:12:17,042 INFO L188 LiptonReduction]: Number of co-enabled transitions 2822 [2022-12-06 07:12:17,045 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:12:17,045 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 257 [2022-12-06 07:12:17,045 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 124 transitions, 1138 flow [2022-12-06 07:12:17,046 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 07:12:17,046 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:17,046 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 07:12:17,050 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 07:12:17,250 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 07:12:17,251 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 07:12:17,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:17,251 INFO L85 PathProgramCache]: Analyzing trace with hash 875740399, now seen corresponding path program 1 times [2022-12-06 07:12:17,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:17,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820873798] [2022-12-06 07:12:17,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:17,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:18,094 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 07:12:18,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:18,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820873798] [2022-12-06 07:12:18,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820873798] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:12:18,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910711024] [2022-12-06 07:12:18,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:18,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:12:18,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:12:18,100 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 07:12:18,103 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 07:12:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:20,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 07:12:20,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:12:39,440 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 07:12:39,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:13:41,375 WARN L233 SmtUtils]: Spent 47.89s 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 07:25:10,267 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 07:25:10,267 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 07:25:11,277 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 07:25:11,473 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-06 07:25:11,481 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-12-06 07:25:11,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 07:25:11,482 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:800) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:282) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 07:25:11,484 INFO L158 Benchmark]: Toolchain (without parser) took 841422.04ms. Allocated memory was 216.0MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 174.8MB in the beginning and 4.2GB in the end (delta: -4.0GB). Peak memory consumption was 7.0GB. Max. memory is 8.0GB. [2022-12-06 07:25:11,484 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 216.0MB. Free memory is still 192.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:25:11,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.90ms. Allocated memory is still 216.0MB. Free memory was 174.8MB in the beginning and 163.1MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 07:25:11,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.85ms. Allocated memory is still 216.0MB. Free memory was 163.1MB in the beginning and 161.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:25:11,485 INFO L158 Benchmark]: Boogie Preprocessor took 45.11ms. Allocated memory is still 216.0MB. Free memory was 161.1MB in the beginning and 159.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:25:11,485 INFO L158 Benchmark]: RCFGBuilder took 499.19ms. Allocated memory is still 216.0MB. Free memory was 159.6MB in the beginning and 141.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-06 07:25:11,486 INFO L158 Benchmark]: TraceAbstraction took 840563.94ms. Allocated memory was 216.0MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 141.2MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 7.0GB. Max. memory is 8.0GB. [2022-12-06 07:25:11,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-12-06 07:25:11,488 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.11ms. Allocated memory is still 216.0MB. Free memory is still 192.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.90ms. Allocated memory is still 216.0MB. Free memory was 174.8MB in the beginning and 163.1MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.85ms. Allocated memory is still 216.0MB. Free memory was 163.1MB in the beginning and 161.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.11ms. Allocated memory is still 216.0MB. Free memory was 161.1MB in the beginning and 159.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 499.19ms. Allocated memory is still 216.0MB. Free memory was 159.6MB in the beginning and 141.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 840563.94ms. Allocated memory was 216.0MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 141.2MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 7.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 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.6s, 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 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown