/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 06:51:21,548 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 06:51:21,550 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 06:51:21,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 06:51:21,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 06:51:21,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 06:51:21,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 06:51:21,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 06:51:21,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 06:51:21,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 06:51:21,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 06:51:21,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 06:51:21,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 06:51:21,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 06:51:21,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 06:51:21,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 06:51:21,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 06:51:21,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 06:51:21,613 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 06:51:21,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 06:51:21,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 06:51:21,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 06:51:21,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 06:51:21,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 06:51:21,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 06:51:21,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 06:51:21,626 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 06:51:21,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 06:51:21,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 06:51:21,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 06:51:21,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 06:51:21,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 06:51:21,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 06:51:21,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 06:51:21,629 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 06:51:21,629 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 06:51:21,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 06:51:21,630 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 06:51:21,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 06:51:21,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 06:51:21,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 06:51:21,636 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-NoLbe-Before.epf [2022-01-19 06:51:21,664 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 06:51:21,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 06:51:21,666 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 06:51:21,666 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 06:51:21,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 06:51:21,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 06:51:21,666 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 06:51:21,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 06:51:21,667 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 06:51:21,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 06:51:21,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 06:51:21,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 06:51:21,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 06:51:21,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 06:51:21,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 06:51:21,668 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 06:51:21,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 06:51:21,668 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 06:51:21,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 06:51:21,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 06:51:21,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 06:51:21,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 06:51:21,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 06:51:21,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:51:21,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 06:51:21,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 06:51:21,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 06:51:21,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 06:51:21,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 06:51:21,669 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 06:51:21,669 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 06:51:21,669 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 06:51:21,669 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-01-19 06:51:21,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 06:51:21,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 06:51:21,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 06:51:21,873 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 06:51:21,873 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 06:51:21,874 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2022-01-19 06:51:21,936 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5715c5ebe/d2fd4ff57bab45b98278e651e479a641/FLAGe5f6f0beb [2022-01-19 06:51:22,278 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 06:51:22,279 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2022-01-19 06:51:22,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5715c5ebe/d2fd4ff57bab45b98278e651e479a641/FLAGe5f6f0beb [2022-01-19 06:51:22,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5715c5ebe/d2fd4ff57bab45b98278e651e479a641 [2022-01-19 06:51:22,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 06:51:22,301 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 06:51:22,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 06:51:22,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 06:51:22,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 06:51:22,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:51:22" (1/1) ... [2022-01-19 06:51:22,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c85a420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:51:22, skipping insertion in model container [2022-01-19 06:51:22,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:51:22" (1/1) ... [2022-01-19 06:51:22,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 06:51:22,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 06:51:22,512 WARN L230 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.wvr.c[2625,2638] [2022-01-19 06:51:22,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:51:22,520 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 06:51:22,540 WARN L230 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.wvr.c[2625,2638] [2022-01-19 06:51:22,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:51:22,552 INFO L208 MainTranslator]: Completed translation [2022-01-19 06:51:22,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:51:22 WrapperNode [2022-01-19 06:51:22,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 06:51:22,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 06:51:22,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 06:51:22,553 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 06:51:22,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:51:22" (1/1) ... [2022-01-19 06:51:22,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:51:22" (1/1) ... [2022-01-19 06:51:22,589 INFO L137 Inliner]: procedures = 22, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2022-01-19 06:51:22,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 06:51:22,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 06:51:22,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 06:51:22,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 06:51:22,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:51:22" (1/1) ... [2022-01-19 06:51:22,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:51:22" (1/1) ... [2022-01-19 06:51:22,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:51:22" (1/1) ... [2022-01-19 06:51:22,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:51:22" (1/1) ... [2022-01-19 06:51:22,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:51:22" (1/1) ... [2022-01-19 06:51:22,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:51:22" (1/1) ... [2022-01-19 06:51:22,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:51:22" (1/1) ... [2022-01-19 06:51:22,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 06:51:22,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 06:51:22,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 06:51:22,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 06:51:22,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:51:22" (1/1) ... [2022-01-19 06:51:22,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:51:22,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:51:22,638 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-01-19 06:51:22,696 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-01-19 06:51:22,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 06:51:22,725 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 06:51:22,725 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 06:51:22,725 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 06:51:22,725 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 06:51:22,725 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 06:51:22,725 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 06:51:22,726 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-19 06:51:22,726 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-19 06:51:22,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 06:51:22,728 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-01-19 06:51:22,728 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-01-19 06:51:22,729 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-01-19 06:51:22,729 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-01-19 06:51:22,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 06:51:22,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 06:51:22,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 06:51:22,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 06:51:22,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 06:51:22,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 06:51:22,730 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 06:51:22,799 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 06:51:22,800 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 06:51:22,986 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 06:51:22,992 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 06:51:22,992 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-19 06:51:22,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:51:22 BoogieIcfgContainer [2022-01-19 06:51:22,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 06:51:22,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 06:51:22,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 06:51:22,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 06:51:22,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 06:51:22" (1/3) ... [2022-01-19 06:51:22,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681a40f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:51:22, skipping insertion in model container [2022-01-19 06:51:22,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:51:22" (2/3) ... [2022-01-19 06:51:22,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681a40f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:51:22, skipping insertion in model container [2022-01-19 06:51:22,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:51:22" (3/3) ... [2022-01-19 06:51:22,999 INFO L111 eAbstractionObserver]: Analyzing ICFG bench-exp3x3.wvr.c [2022-01-19 06:51:23,003 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 06:51:23,003 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 06:51:23,003 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 06:51:23,097 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,098 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,098 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,098 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,099 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,099 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,099 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,099 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,100 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,100 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,101 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,101 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,102 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,102 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,102 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,102 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,103 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,103 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,103 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,103 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,104 WARN L322 ript$VariableManager]: TermVariabe |thread6Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,104 WARN L322 ript$VariableManager]: TermVariabe |thread6Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,105 WARN L322 ript$VariableManager]: TermVariabe |thread6Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,105 WARN L322 ript$VariableManager]: TermVariabe |thread6Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,107 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,107 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,109 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,109 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,109 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,110 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,110 WARN L322 ript$VariableManager]: TermVariabe |thread6Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,110 WARN L322 ript$VariableManager]: TermVariabe |thread6Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,111 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,112 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:51:23,117 INFO L148 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-01-19 06:51:23,168 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:51:23,172 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:51:23,173 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 06:51:23,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 174 places, 169 transitions, 386 flow [2022-01-19 06:51:23,265 INFO L129 PetriNetUnfolder]: 14/163 cut-off events. [2022-01-19 06:51:23,265 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-01-19 06:51:23,269 INFO L84 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 163 events. 14/163 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-01-19 06:51:23,270 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 169 transitions, 386 flow [2022-01-19 06:51:23,277 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 146 transitions, 328 flow [2022-01-19 06:51:23,318 INFO L129 PetriNetUnfolder]: 14/145 cut-off events. [2022-01-19 06:51:23,319 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-01-19 06:51:23,319 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:51:23,320 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 06:51:23,320 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 06:51:23,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:51:23,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1565365569, now seen corresponding path program 1 times [2022-01-19 06:51:23,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:51:23,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599082830] [2022-01-19 06:51:23,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:51:23,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:51:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:51:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:51:23,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:51:23,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599082830] [2022-01-19 06:51:23,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599082830] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:51:23,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:51:23,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 06:51:23,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271764997] [2022-01-19 06:51:23,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:51:23,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 06:51:23,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:51:23,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 06:51:23,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 06:51:23,634 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 169 [2022-01-19 06:51:23,636 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 146 transitions, 328 flow. Second operand has 2 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 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-01-19 06:51:23,636 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:51:23,636 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 169 [2022-01-19 06:51:23,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:51:23,671 INFO L129 PetriNetUnfolder]: 6/138 cut-off events. [2022-01-19 06:51:23,671 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-01-19 06:51:23,672 INFO L84 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 138 events. 6/138 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 38/168 useless extension candidates. Maximal degree in co-relation 119. Up to 13 conditions per place. [2022-01-19 06:51:23,674 INFO L132 encePairwiseOnDemand]: 161/169 looper letters, 12 selfloop transitions, 0 changer transitions 2/138 dead transitions. [2022-01-19 06:51:23,674 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 138 transitions, 336 flow [2022-01-19 06:51:23,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 06:51:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 06:51:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 316 transitions. [2022-01-19 06:51:23,683 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9349112426035503 [2022-01-19 06:51:23,683 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 316 transitions. [2022-01-19 06:51:23,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 316 transitions. [2022-01-19 06:51:23,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:51:23,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 316 transitions. [2022-01-19 06:51:23,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 158.0) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 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-01-19 06:51:23,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:51:23,692 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:51:23,694 INFO L186 Difference]: Start difference. First operand has 151 places, 146 transitions, 328 flow. Second operand 2 states and 316 transitions. [2022-01-19 06:51:23,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 138 transitions, 336 flow [2022-01-19 06:51:23,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 138 transitions, 312 flow, removed 0 selfloop flow, removed 12 redundant places. [2022-01-19 06:51:23,699 INFO L242 Difference]: Finished difference. Result has 140 places, 136 transitions, 284 flow [2022-01-19 06:51:23,700 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=284, PETRI_PLACES=140, PETRI_TRANSITIONS=136} [2022-01-19 06:51:23,702 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, -11 predicate places. [2022-01-19 06:51:23,702 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 136 transitions, 284 flow [2022-01-19 06:51:23,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 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-01-19 06:51:23,703 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:51:23,703 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 06:51:23,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 06:51:23,703 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 06:51:23,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:51:23,704 INFO L85 PathProgramCache]: Analyzing trace with hash -616084000, now seen corresponding path program 1 times [2022-01-19 06:51:23,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:51:23,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104349446] [2022-01-19 06:51:23,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:51:23,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:51:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:51:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:51:24,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:51:24,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104349446] [2022-01-19 06:51:24,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104349446] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:51:24,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:51:24,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 06:51:24,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18727682] [2022-01-19 06:51:24,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:51:24,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 06:51:24,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:51:24,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 06:51:24,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-19 06:51:24,148 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 169 [2022-01-19 06:51:24,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 136 transitions, 284 flow. Second operand has 7 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 0 states have call successors, (0), 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-01-19 06:51:24,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:51:24,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 169 [2022-01-19 06:51:24,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:51:25,884 INFO L129 PetriNetUnfolder]: 13855/19795 cut-off events. [2022-01-19 06:51:25,884 INFO L130 PetriNetUnfolder]: For 728/910 co-relation queries the response was YES. [2022-01-19 06:51:25,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37315 conditions, 19795 events. 13855/19795 cut-off events. For 728/910 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 113714 event pairs, 8389 based on Foata normal form. 1/13760 useless extension candidates. Maximal degree in co-relation 37312. Up to 10952 conditions per place. [2022-01-19 06:51:26,068 INFO L132 encePairwiseOnDemand]: 157/169 looper letters, 69 selfloop transitions, 9 changer transitions 4/168 dead transitions. [2022-01-19 06:51:26,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 168 transitions, 523 flow [2022-01-19 06:51:26,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 06:51:26,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 06:51:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 839 transitions. [2022-01-19 06:51:26,076 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7092138630600169 [2022-01-19 06:51:26,076 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 839 transitions. [2022-01-19 06:51:26,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 839 transitions. [2022-01-19 06:51:26,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:51:26,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 839 transitions. [2022-01-19 06:51:26,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 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-01-19 06:51:26,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-01-19 06:51:26,084 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-01-19 06:51:26,085 INFO L186 Difference]: Start difference. First operand has 140 places, 136 transitions, 284 flow. Second operand 7 states and 839 transitions. [2022-01-19 06:51:26,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 168 transitions, 523 flow [2022-01-19 06:51:26,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 168 transitions, 523 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:51:26,092 INFO L242 Difference]: Finished difference. Result has 147 places, 142 transitions, 339 flow [2022-01-19 06:51:26,093 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=339, PETRI_PLACES=147, PETRI_TRANSITIONS=142} [2022-01-19 06:51:26,093 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, -4 predicate places. [2022-01-19 06:51:26,094 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 142 transitions, 339 flow [2022-01-19 06:51:26,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 0 states have call successors, (0), 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-01-19 06:51:26,094 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:51:26,095 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 06:51:26,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 06:51:26,095 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 06:51:26,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:51:26,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1758121540, now seen corresponding path program 1 times [2022-01-19 06:51:26,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:51:26,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229463359] [2022-01-19 06:51:26,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:51:26,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:51:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:51:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:51:26,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:51:26,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229463359] [2022-01-19 06:51:26,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229463359] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:51:26,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:51:26,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 06:51:26,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839045989] [2022-01-19 06:51:26,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:51:26,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 06:51:26,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:51:26,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 06:51:26,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:51:26,421 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-01-19 06:51:26,422 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 142 transitions, 339 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-01-19 06:51:26,422 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:51:26,422 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-01-19 06:51:26,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:51:27,979 INFO L129 PetriNetUnfolder]: 13532/20062 cut-off events. [2022-01-19 06:51:27,979 INFO L130 PetriNetUnfolder]: For 4486/4730 co-relation queries the response was YES. [2022-01-19 06:51:28,008 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44924 conditions, 20062 events. 13532/20062 cut-off events. For 4486/4730 co-relation queries the response was YES. Maximal size of possible extension queue 965. Compared 124546 event pairs, 1500 based on Foata normal form. 2/14619 useless extension candidates. Maximal degree in co-relation 44917. Up to 10954 conditions per place. [2022-01-19 06:51:28,073 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 84 selfloop transitions, 17 changer transitions 1/186 dead transitions. [2022-01-19 06:51:28,073 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 186 transitions, 665 flow [2022-01-19 06:51:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 06:51:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 06:51:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions. [2022-01-19 06:51:28,075 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7297830374753451 [2022-01-19 06:51:28,075 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 740 transitions. [2022-01-19 06:51:28,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions. [2022-01-19 06:51:28,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:51:28,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions. [2022-01-19 06:51:28,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 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-01-19 06:51:28,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 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-01-19 06:51:28,078 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 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-01-19 06:51:28,078 INFO L186 Difference]: Start difference. First operand has 147 places, 142 transitions, 339 flow. Second operand 6 states and 740 transitions. [2022-01-19 06:51:28,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 186 transitions, 665 flow [2022-01-19 06:51:28,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 186 transitions, 644 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-01-19 06:51:28,083 INFO L242 Difference]: Finished difference. Result has 147 places, 150 transitions, 411 flow [2022-01-19 06:51:28,084 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=411, PETRI_PLACES=147, PETRI_TRANSITIONS=150} [2022-01-19 06:51:28,084 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, -4 predicate places. [2022-01-19 06:51:28,084 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 150 transitions, 411 flow [2022-01-19 06:51:28,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-01-19 06:51:28,085 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:51:28,085 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 06:51:28,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 06:51:28,085 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 06:51:28,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:51:28,086 INFO L85 PathProgramCache]: Analyzing trace with hash 793584122, now seen corresponding path program 2 times [2022-01-19 06:51:28,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:51:28,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829909852] [2022-01-19 06:51:28,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:51:28,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:51:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:51:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:51:28,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:51:28,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829909852] [2022-01-19 06:51:28,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829909852] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:51:28,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:51:28,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 06:51:28,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217069331] [2022-01-19 06:51:28,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:51:28,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 06:51:28,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:51:28,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 06:51:28,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:51:28,198 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2022-01-19 06:51:28,199 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 150 transitions, 411 flow. Second operand has 6 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 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-01-19 06:51:28,199 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:51:28,199 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2022-01-19 06:51:28,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:51:30,454 INFO L129 PetriNetUnfolder]: 20952/31681 cut-off events. [2022-01-19 06:51:30,454 INFO L130 PetriNetUnfolder]: For 12684/12915 co-relation queries the response was YES. [2022-01-19 06:51:30,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69906 conditions, 31681 events. 20952/31681 cut-off events. For 12684/12915 co-relation queries the response was YES. Maximal size of possible extension queue 1730. Compared 220714 event pairs, 11477 based on Foata normal form. 634/24236 useless extension candidates. Maximal degree in co-relation 69899. Up to 6711 conditions per place. [2022-01-19 06:51:30,660 INFO L132 encePairwiseOnDemand]: 158/169 looper letters, 104 selfloop transitions, 15 changer transitions 0/223 dead transitions. [2022-01-19 06:51:30,661 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 223 transitions, 852 flow [2022-01-19 06:51:30,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 06:51:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 06:51:30,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 941 transitions. [2022-01-19 06:51:30,663 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7954353338968724 [2022-01-19 06:51:30,663 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 941 transitions. [2022-01-19 06:51:30,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 941 transitions. [2022-01-19 06:51:30,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:51:30,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 941 transitions. [2022-01-19 06:51:30,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.42857142857142) internal successors, (941), 7 states have internal predecessors, (941), 0 states have call successors, (0), 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-01-19 06:51:30,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-01-19 06:51:30,667 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-01-19 06:51:30,667 INFO L186 Difference]: Start difference. First operand has 147 places, 150 transitions, 411 flow. Second operand 7 states and 941 transitions. [2022-01-19 06:51:30,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 223 transitions, 852 flow [2022-01-19 06:51:30,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 223 transitions, 824 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 06:51:30,677 INFO L242 Difference]: Finished difference. Result has 153 places, 155 transitions, 472 flow [2022-01-19 06:51:30,677 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=472, PETRI_PLACES=153, PETRI_TRANSITIONS=155} [2022-01-19 06:51:30,678 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 2 predicate places. [2022-01-19 06:51:30,678 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 155 transitions, 472 flow [2022-01-19 06:51:30,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 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-01-19 06:51:30,679 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:51:30,680 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 06:51:30,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 06:51:30,680 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 06:51:30,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:51:30,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1562844010, now seen corresponding path program 1 times [2022-01-19 06:51:30,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:51:30,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790113708] [2022-01-19 06:51:30,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:51:30,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:51:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:51:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:51:30,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:51:30,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790113708] [2022-01-19 06:51:30,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790113708] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:51:30,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103015451] [2022-01-19 06:51:30,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:51:30,797 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:51:30,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:51:30,798 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-01-19 06:51:30,799 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-01-19 06:51:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:51:30,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 06:51:30,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:51:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:51:31,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:51:31,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:51:31,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103015451] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:51:31,932 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:51:31,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-01-19 06:51:31,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086412693] [2022-01-19 06:51:31,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:51:31,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:51:31,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:51:31,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:51:31,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:51:31,935 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2022-01-19 06:51:31,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 155 transitions, 472 flow. Second operand has 10 states, 10 states have (on average 123.3) internal successors, (1233), 10 states have internal predecessors, (1233), 0 states have call successors, (0), 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-01-19 06:51:31,936 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:51:31,936 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2022-01-19 06:51:31,936 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:51:37,424 INFO L129 PetriNetUnfolder]: 50113/75128 cut-off events. [2022-01-19 06:51:37,424 INFO L130 PetriNetUnfolder]: For 80131/81542 co-relation queries the response was YES. [2022-01-19 06:51:37,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 191498 conditions, 75128 events. 50113/75128 cut-off events. For 80131/81542 co-relation queries the response was YES. Maximal size of possible extension queue 3698. Compared 589842 event pairs, 7598 based on Foata normal form. 1208/59792 useless extension candidates. Maximal degree in co-relation 191488. Up to 15354 conditions per place. [2022-01-19 06:51:38,063 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 167 selfloop transitions, 22 changer transitions 0/294 dead transitions. [2022-01-19 06:51:38,063 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 294 transitions, 1458 flow [2022-01-19 06:51:38,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 06:51:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 06:51:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1573 transitions. [2022-01-19 06:51:38,066 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7756410256410257 [2022-01-19 06:51:38,066 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1573 transitions. [2022-01-19 06:51:38,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1573 transitions. [2022-01-19 06:51:38,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:51:38,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1573 transitions. [2022-01-19 06:51:38,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 131.08333333333334) internal successors, (1573), 12 states have internal predecessors, (1573), 0 states have call successors, (0), 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-01-19 06:51:38,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 169.0) internal successors, (2197), 13 states have internal predecessors, (2197), 0 states have call successors, (0), 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-01-19 06:51:38,072 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 169.0) internal successors, (2197), 13 states have internal predecessors, (2197), 0 states have call successors, (0), 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-01-19 06:51:38,072 INFO L186 Difference]: Start difference. First operand has 153 places, 155 transitions, 472 flow. Second operand 12 states and 1573 transitions. [2022-01-19 06:51:38,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 294 transitions, 1458 flow [2022-01-19 06:51:38,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 294 transitions, 1440 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-01-19 06:51:38,131 INFO L242 Difference]: Finished difference. Result has 169 places, 167 transitions, 604 flow [2022-01-19 06:51:38,131 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=604, PETRI_PLACES=169, PETRI_TRANSITIONS=167} [2022-01-19 06:51:38,132 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 18 predicate places. [2022-01-19 06:51:38,132 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 167 transitions, 604 flow [2022-01-19 06:51:38,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 123.3) internal successors, (1233), 10 states have internal predecessors, (1233), 0 states have call successors, (0), 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-01-19 06:51:38,133 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:51:38,133 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 06:51:38,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 06:51:38,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:51:38,347 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 06:51:38,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:51:38,347 INFO L85 PathProgramCache]: Analyzing trace with hash 87096828, now seen corresponding path program 1 times [2022-01-19 06:51:38,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:51:38,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710210636] [2022-01-19 06:51:38,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:51:38,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:51:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:51:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:51:38,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:51:38,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710210636] [2022-01-19 06:51:38,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710210636] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:51:38,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569958376] [2022-01-19 06:51:38,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:51:38,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:51:38,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:51:38,639 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-01-19 06:51:38,669 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-01-19 06:51:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:51:38,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 06:51:38,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:51:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:51:39,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:51:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:51:39,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569958376] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:51:39,449 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:51:39,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-01-19 06:51:39,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230761577] [2022-01-19 06:51:39,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:51:39,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 06:51:39,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:51:39,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 06:51:39,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-01-19 06:51:39,451 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-01-19 06:51:39,452 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 167 transitions, 604 flow. Second operand has 14 states, 14 states have (on average 110.92857142857143) internal successors, (1553), 14 states have internal predecessors, (1553), 0 states have call successors, (0), 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-01-19 06:51:39,452 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:51:39,452 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-01-19 06:51:39,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:51:49,281 INFO L129 PetriNetUnfolder]: 81740/122202 cut-off events. [2022-01-19 06:51:49,281 INFO L130 PetriNetUnfolder]: For 252386/253211 co-relation queries the response was YES. [2022-01-19 06:51:49,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 381847 conditions, 122202 events. 81740/122202 cut-off events. For 252386/253211 co-relation queries the response was YES. Maximal size of possible extension queue 4957. Compared 975015 event pairs, 25887 based on Foata normal form. 1881/108125 useless extension candidates. Maximal degree in co-relation 381830. Up to 34691 conditions per place. [2022-01-19 06:51:50,262 INFO L132 encePairwiseOnDemand]: 152/169 looper letters, 290 selfloop transitions, 36 changer transitions 1/411 dead transitions. [2022-01-19 06:51:50,263 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 411 transitions, 2493 flow [2022-01-19 06:51:50,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 06:51:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 06:51:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1725 transitions. [2022-01-19 06:51:50,266 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7290786136939983 [2022-01-19 06:51:50,266 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1725 transitions. [2022-01-19 06:51:50,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1725 transitions. [2022-01-19 06:51:50,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:51:50,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1725 transitions. [2022-01-19 06:51:50,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 123.21428571428571) internal successors, (1725), 14 states have internal predecessors, (1725), 0 states have call successors, (0), 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-01-19 06:51:50,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 169.0) internal successors, (2535), 15 states have internal predecessors, (2535), 0 states have call successors, (0), 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-01-19 06:51:50,272 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 169.0) internal successors, (2535), 15 states have internal predecessors, (2535), 0 states have call successors, (0), 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-01-19 06:51:50,272 INFO L186 Difference]: Start difference. First operand has 169 places, 167 transitions, 604 flow. Second operand 14 states and 1725 transitions. [2022-01-19 06:51:50,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 411 transitions, 2493 flow [2022-01-19 06:51:50,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 411 transitions, 2487 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 06:51:50,953 INFO L242 Difference]: Finished difference. Result has 187 places, 183 transitions, 852 flow [2022-01-19 06:51:50,953 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=852, PETRI_PLACES=187, PETRI_TRANSITIONS=183} [2022-01-19 06:51:50,954 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 36 predicate places. [2022-01-19 06:51:50,954 INFO L470 AbstractCegarLoop]: Abstraction has has 187 places, 183 transitions, 852 flow [2022-01-19 06:51:50,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 110.92857142857143) internal successors, (1553), 14 states have internal predecessors, (1553), 0 states have call successors, (0), 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-01-19 06:51:50,955 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:51:50,955 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 06:51:50,973 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-01-19 06:51:51,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-19 06:51:51,171 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 06:51:51,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:51:51,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1417117332, now seen corresponding path program 2 times [2022-01-19 06:51:51,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:51:51,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357277919] [2022-01-19 06:51:51,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:51:51,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:51:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:51:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:51:51,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:51:51,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357277919] [2022-01-19 06:51:51,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357277919] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:51:51,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:51:51,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 06:51:51,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349476003] [2022-01-19 06:51:51,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:51:51,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 06:51:51,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:51:51,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 06:51:51,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:51:51,436 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-01-19 06:51:51,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 183 transitions, 852 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-01-19 06:51:51,437 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:51:51,437 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-01-19 06:51:51,437 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:52:01,411 INFO L129 PetriNetUnfolder]: 80515/116929 cut-off events. [2022-01-19 06:52:01,411 INFO L130 PetriNetUnfolder]: For 394482/394755 co-relation queries the response was YES. [2022-01-19 06:52:02,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 411060 conditions, 116929 events. 80515/116929 cut-off events. For 394482/394755 co-relation queries the response was YES. Maximal size of possible extension queue 5457. Compared 892701 event pairs, 40481 based on Foata normal form. 246/102493 useless extension candidates. Maximal degree in co-relation 411035. Up to 95798 conditions per place. [2022-01-19 06:52:02,984 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 123 selfloop transitions, 27 changer transitions 1/235 dead transitions. [2022-01-19 06:52:02,984 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 235 transitions, 1466 flow [2022-01-19 06:52:02,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 06:52:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 06:52:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2022-01-19 06:52:03,000 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.727810650887574 [2022-01-19 06:52:03,000 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 738 transitions. [2022-01-19 06:52:03,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions. [2022-01-19 06:52:03,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:52:03,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions. [2022-01-19 06:52:03,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 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-01-19 06:52:03,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 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-01-19 06:52:03,003 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 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-01-19 06:52:03,003 INFO L186 Difference]: Start difference. First operand has 187 places, 183 transitions, 852 flow. Second operand 6 states and 738 transitions. [2022-01-19 06:52:03,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 235 transitions, 1466 flow [2022-01-19 06:52:04,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 235 transitions, 1431 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-01-19 06:52:04,121 INFO L242 Difference]: Finished difference. Result has 190 places, 193 transitions, 1000 flow [2022-01-19 06:52:04,121 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1000, PETRI_PLACES=190, PETRI_TRANSITIONS=193} [2022-01-19 06:52:04,123 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 39 predicate places. [2022-01-19 06:52:04,123 INFO L470 AbstractCegarLoop]: Abstraction has has 190 places, 193 transitions, 1000 flow [2022-01-19 06:52:04,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-01-19 06:52:04,123 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:52:04,123 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 06:52:04,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 06:52:04,124 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 06:52:04,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:52:04,124 INFO L85 PathProgramCache]: Analyzing trace with hash 260390758, now seen corresponding path program 1 times [2022-01-19 06:52:04,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:52:04,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601850786] [2022-01-19 06:52:04,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:52:04,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:52:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:52:04,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:52:04,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:52:04,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601850786] [2022-01-19 06:52:04,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601850786] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:52:04,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:52:04,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 06:52:04,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268990401] [2022-01-19 06:52:04,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:52:04,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 06:52:04,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:52:04,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 06:52:04,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:52:04,297 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2022-01-19 06:52:04,298 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 193 transitions, 1000 flow. Second operand has 6 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 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-01-19 06:52:04,298 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:52:04,298 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2022-01-19 06:52:04,298 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:52:10,516 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 208#true, 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, Black: 1003#true, Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:10,516 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-01-19 06:52:10,516 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 06:52:10,516 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 06:52:10,516 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 06:52:10,542 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 208#true, 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), 223#true, Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, Black: 1003#true, Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:10,542 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-01-19 06:52:10,542 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 06:52:10,542 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 06:52:10,542 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 06:52:10,936 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 208#true, Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:10,937 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-01-19 06:52:10,937 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 06:52:10,937 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 06:52:10,937 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 06:52:10,966 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 208#true, 223#true, Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:10,966 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-01-19 06:52:10,966 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 06:52:10,967 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 06:52:10,967 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 06:52:11,929 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 208#true, 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:11,929 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 06:52:11,929 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 06:52:11,929 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 06:52:11,930 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 06:52:11,930 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 84#L62-1true, 66#L47true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 208#true, 177#true, 15#L54-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, Black: 1003#true, Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:11,930 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 06:52:11,930 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:11,930 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 06:52:11,930 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 06:52:11,965 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 208#true, 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), 223#true, Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:11,965 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 06:52:11,965 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 06:52:11,965 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 06:52:11,965 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 06:52:11,965 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 66#L47true, 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 208#true, 177#true, 15#L54-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), 223#true, Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, Black: 1003#true, Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:11,965 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 06:52:11,965 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 06:52:11,965 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 06:52:11,965 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:11,979 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 208#true, 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, Black: 1003#true, Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 55#L63true, Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:11,980 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 06:52:11,980 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 06:52:11,980 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 06:52:11,980 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:11,987 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 79#L55true, 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 208#true, 177#true, 106#L46-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), 223#true, Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, Black: 1003#true, Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:11,987 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 06:52:11,987 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 06:52:11,987 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 06:52:11,987 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:12,091 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 208#true, Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), 1003#true, 57#L39true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:12,092 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 06:52:12,092 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 06:52:12,092 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 06:52:12,092 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:12,120 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 208#true, Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), 223#true, Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 1003#true, 57#L39true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:12,120 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 06:52:12,120 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 06:52:12,120 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 06:52:12,120 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:12,414 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 208#true, Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 55#L63true, Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:12,414 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 06:52:12,414 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 06:52:12,414 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 06:52:12,414 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:12,423 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 79#L55true, 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 177#true, 106#L46-1true, 61#L105-4true, Black: 208#true, 223#true, Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:12,423 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 06:52:12,423 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 06:52:12,423 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 06:52:12,423 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:13,416 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 66#L47true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 208#true, 177#true, 15#L54-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, Black: 1003#true, Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 55#L63true, Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:13,417 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 06:52:13,417 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 06:52:13,417 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 06:52:13,417 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 06:52:13,417 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 208#true, 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 55#L63true, Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:13,417 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 06:52:13,417 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:13,417 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 06:52:13,417 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:13,428 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 79#L55true, 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 208#true, 177#true, 106#L46-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), 223#true, Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:13,428 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 06:52:13,428 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 06:52:13,428 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:13,428 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:13,428 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 79#L55true, 84#L62-1true, 66#L47true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 208#true, 177#true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), 223#true, Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, Black: 1003#true, Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:13,429 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 06:52:13,429 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 06:52:13,429 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 06:52:13,429 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 06:52:13,603 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 177#true, 106#L46-1true, 15#L54-1true, 61#L105-4true, Black: 208#true, Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 223#true, Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), 1003#true, 57#L39true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 55#L63true, Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:13,603 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 06:52:13,603 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 06:52:13,603 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 06:52:13,603 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 06:52:13,612 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 79#L55true, 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 177#true, 106#L46-1true, 61#L105-4true, Black: 208#true, Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), 223#true, Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 1003#true, 57#L39true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:13,612 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 06:52:13,613 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 06:52:13,613 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 06:52:13,613 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 06:52:15,041 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][225], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1794#true, 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 177#true, 208#true, 106#L46-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 223#true, Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 99#L54-2true, Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:15,042 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 06:52:15,042 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:15,042 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:15,042 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 06:52:15,042 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L46-1-->L46-2: Formula: (not (< (mod v_~x2~0_1 4294967296) (mod v_~n~0_3 4294967296))) InVars {~n~0=v_~n~0_3, ~x2~0=v_~x2~0_1} OutVars{~n~0=v_~n~0_3, ~x2~0=v_~x2~0_1} AuxVars[] AssignedVars[][146], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1814#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296)))), 1794#true, 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 95#L46-2true, Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 177#true, 208#true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 223#true, Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 26#L71true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 99#L54-2true, Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:15,042 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 06:52:15,042 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:15,042 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:15,042 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 06:52:15,042 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][155], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1814#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296)))), 1794#true, 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 177#true, 208#true, 106#L46-1true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 223#true, Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 26#L71true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 99#L54-2true, Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 5#L38-2true, 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:15,042 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 06:52:15,042 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:15,042 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:15,042 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 06:52:15,043 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([392] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][158], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1814#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296)))), 1794#true, 84#L62-1true, 66#L47true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 177#true, 208#true, 61#L105-4true, Black: 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 223#true, Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 75#L78-2true, 26#L71true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 99#L54-2true, Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 136#L38-1true, Black: 1003#true, Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:52:15,043 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 06:52:15,043 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:15,043 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 06:52:15,043 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 06:52:20,362 INFO L129 PetriNetUnfolder]: 115930/173971 cut-off events. [2022-01-19 06:52:20,362 INFO L130 PetriNetUnfolder]: For 526321/540429 co-relation queries the response was YES. [2022-01-19 06:52:21,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 585300 conditions, 173971 events. 115930/173971 cut-off events. For 526321/540429 co-relation queries the response was YES. Maximal size of possible extension queue 9829. Compared 1555373 event pairs, 18153 based on Foata normal form. 9016/161409 useless extension candidates. Maximal degree in co-relation 585272. Up to 58497 conditions per place. [2022-01-19 06:52:22,683 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 154 selfloop transitions, 39 changer transitions 0/310 dead transitions. [2022-01-19 06:52:22,684 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 310 transitions, 2207 flow [2022-01-19 06:52:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 06:52:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 06:52:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 926 transitions. [2022-01-19 06:52:22,685 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7827557058326289 [2022-01-19 06:52:22,685 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 926 transitions. [2022-01-19 06:52:22,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 926 transitions. [2022-01-19 06:52:22,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:52:22,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 926 transitions. [2022-01-19 06:52:22,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.28571428571428) internal successors, (926), 7 states have internal predecessors, (926), 0 states have call successors, (0), 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-01-19 06:52:22,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-01-19 06:52:22,689 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-01-19 06:52:22,689 INFO L186 Difference]: Start difference. First operand has 190 places, 193 transitions, 1000 flow. Second operand 7 states and 926 transitions. [2022-01-19 06:52:22,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 310 transitions, 2207 flow [2022-01-19 06:52:25,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 310 transitions, 2152 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-01-19 06:52:25,839 INFO L242 Difference]: Finished difference. Result has 196 places, 213 transitions, 1252 flow [2022-01-19 06:52:25,839 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1252, PETRI_PLACES=196, PETRI_TRANSITIONS=213} [2022-01-19 06:52:25,840 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 45 predicate places. [2022-01-19 06:52:25,840 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 213 transitions, 1252 flow [2022-01-19 06:52:25,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 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-01-19 06:52:25,840 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:52:25,840 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 06:52:25,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 06:52:25,840 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 06:52:25,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:52:25,841 INFO L85 PathProgramCache]: Analyzing trace with hash 599558452, now seen corresponding path program 2 times [2022-01-19 06:52:25,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:52:25,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309172148] [2022-01-19 06:52:25,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:52:25,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:52:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:52:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:52:26,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:52:26,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309172148] [2022-01-19 06:52:26,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309172148] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:52:26,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:52:26,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 06:52:26,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946095971] [2022-01-19 06:52:26,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:52:26,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 06:52:26,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:52:26,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 06:52:26,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:52:26,018 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-01-19 06:52:26,019 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 213 transitions, 1252 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-01-19 06:52:26,019 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:52:26,019 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-01-19 06:52:26,019 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:52:45,836 INFO L129 PetriNetUnfolder]: 139589/197434 cut-off events. [2022-01-19 06:52:45,836 INFO L130 PetriNetUnfolder]: For 705826/705991 co-relation queries the response was YES. [2022-01-19 06:52:47,189 INFO L84 FinitePrefix]: Finished finitePrefix Result has 779949 conditions, 197434 events. 139589/197434 cut-off events. For 705826/705991 co-relation queries the response was YES. Maximal size of possible extension queue 8983. Compared 1546715 event pairs, 48684 based on Foata normal form. 146/195185 useless extension candidates. Maximal degree in co-relation 779918. Up to 168663 conditions per place. [2022-01-19 06:52:48,354 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 138 selfloop transitions, 43 changer transitions 2/267 dead transitions. [2022-01-19 06:52:48,354 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 267 transitions, 1992 flow [2022-01-19 06:52:48,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 06:52:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 06:52:48,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2022-01-19 06:52:48,357 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.727810650887574 [2022-01-19 06:52:48,357 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 738 transitions. [2022-01-19 06:52:48,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions. [2022-01-19 06:52:48,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:52:48,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions. [2022-01-19 06:52:48,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 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-01-19 06:52:48,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 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-01-19 06:52:48,360 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 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-01-19 06:52:48,360 INFO L186 Difference]: Start difference. First operand has 196 places, 213 transitions, 1252 flow. Second operand 6 states and 738 transitions. [2022-01-19 06:52:48,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 267 transitions, 1992 flow [2022-01-19 06:52:51,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 267 transitions, 1988 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 06:52:51,420 INFO L242 Difference]: Finished difference. Result has 201 places, 219 transitions, 1459 flow [2022-01-19 06:52:51,421 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1459, PETRI_PLACES=201, PETRI_TRANSITIONS=219} [2022-01-19 06:52:51,421 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 50 predicate places. [2022-01-19 06:52:51,421 INFO L470 AbstractCegarLoop]: Abstraction has has 201 places, 219 transitions, 1459 flow [2022-01-19 06:52:51,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-01-19 06:52:51,422 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:52:51,422 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 06:52:51,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 06:52:51,422 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 06:52:51,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:52:51,422 INFO L85 PathProgramCache]: Analyzing trace with hash 366735110, now seen corresponding path program 1 times [2022-01-19 06:52:51,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:52:51,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897709881] [2022-01-19 06:52:51,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:52:51,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:52:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:52:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:52:51,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:52:51,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897709881] [2022-01-19 06:52:51,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897709881] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:52:51,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008232284] [2022-01-19 06:52:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:52:51,491 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:52:51,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:52:51,493 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-01-19 06:52:51,493 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-01-19 06:52:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:52:51,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 06:52:51,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:52:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:52:52,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:52:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:52:52,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008232284] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:52:52,263 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:52:52,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-01-19 06:52:52,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933933018] [2022-01-19 06:52:52,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:52:52,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:52:52,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:52:52,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:52:52,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:52:52,265 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2022-01-19 06:52:52,265 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 219 transitions, 1459 flow. Second operand has 10 states, 10 states have (on average 123.7) internal successors, (1237), 10 states have internal predecessors, (1237), 0 states have call successors, (0), 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-01-19 06:52:52,265 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:52:52,265 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2022-01-19 06:52:52,265 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:53:16,368 INFO L129 PetriNetUnfolder]: 161371/244635 cut-off events. [2022-01-19 06:53:16,368 INFO L130 PetriNetUnfolder]: For 905713/923660 co-relation queries the response was YES. [2022-01-19 06:53:18,573 INFO L84 FinitePrefix]: Finished finitePrefix Result has 949720 conditions, 244635 events. 161371/244635 cut-off events. For 905713/923660 co-relation queries the response was YES. Maximal size of possible extension queue 14264. Compared 2285890 event pairs, 22104 based on Foata normal form. 18493/253425 useless extension candidates. Maximal degree in co-relation 949686. Up to 57134 conditions per place. [2022-01-19 06:53:20,018 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 244 selfloop transitions, 43 changer transitions 0/414 dead transitions. [2022-01-19 06:53:20,018 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 414 transitions, 3385 flow [2022-01-19 06:53:20,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 06:53:20,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 06:53:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1568 transitions. [2022-01-19 06:53:20,030 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7731755424063116 [2022-01-19 06:53:20,030 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1568 transitions. [2022-01-19 06:53:20,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1568 transitions. [2022-01-19 06:53:20,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:53:20,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1568 transitions. [2022-01-19 06:53:20,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 130.66666666666666) internal successors, (1568), 12 states have internal predecessors, (1568), 0 states have call successors, (0), 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-01-19 06:53:20,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 169.0) internal successors, (2197), 13 states have internal predecessors, (2197), 0 states have call successors, (0), 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-01-19 06:53:20,042 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 169.0) internal successors, (2197), 13 states have internal predecessors, (2197), 0 states have call successors, (0), 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-01-19 06:53:20,042 INFO L186 Difference]: Start difference. First operand has 201 places, 219 transitions, 1459 flow. Second operand 12 states and 1568 transitions. [2022-01-19 06:53:20,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 414 transitions, 3385 flow [2022-01-19 06:53:27,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 414 transitions, 3340 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-01-19 06:53:27,095 INFO L242 Difference]: Finished difference. Result has 216 places, 233 transitions, 1699 flow [2022-01-19 06:53:27,095 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1699, PETRI_PLACES=216, PETRI_TRANSITIONS=233} [2022-01-19 06:53:27,096 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 65 predicate places. [2022-01-19 06:53:27,096 INFO L470 AbstractCegarLoop]: Abstraction has has 216 places, 233 transitions, 1699 flow [2022-01-19 06:53:27,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 123.7) internal successors, (1237), 10 states have internal predecessors, (1237), 0 states have call successors, (0), 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-01-19 06:53:27,096 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:53:27,096 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 06:53:27,113 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-01-19 06:53:27,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:53:27,313 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 06:53:27,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:53:27,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1381831978, now seen corresponding path program 2 times [2022-01-19 06:53:27,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:53:27,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805931454] [2022-01-19 06:53:27,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:53:27,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:53:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:53:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:53:27,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:53:27,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805931454] [2022-01-19 06:53:27,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805931454] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:53:27,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:53:27,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 06:53:27,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042856195] [2022-01-19 06:53:27,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:53:27,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 06:53:27,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:53:27,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 06:53:27,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:53:27,551 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-01-19 06:53:27,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 233 transitions, 1699 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-01-19 06:53:27,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:53:27,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-01-19 06:53:27,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:53:59,057 INFO L129 PetriNetUnfolder]: 194904/278242 cut-off events. [2022-01-19 06:53:59,057 INFO L130 PetriNetUnfolder]: For 1242647/1242982 co-relation queries the response was YES. [2022-01-19 06:54:01,400 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1231509 conditions, 278242 events. 194904/278242 cut-off events. For 1242647/1242982 co-relation queries the response was YES. Maximal size of possible extension queue 13578. Compared 2279722 event pairs, 97725 based on Foata normal form. 73/273313 useless extension candidates. Maximal degree in co-relation 1231469. Up to 238338 conditions per place. [2022-01-19 06:54:03,307 INFO L132 encePairwiseOnDemand]: 157/169 looper letters, 150 selfloop transitions, 47 changer transitions 4/285 dead transitions. [2022-01-19 06:54:03,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 285 transitions, 2467 flow [2022-01-19 06:54:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 06:54:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 06:54:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2022-01-19 06:54:03,308 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7268244575936884 [2022-01-19 06:54:03,308 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 737 transitions. [2022-01-19 06:54:03,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions. [2022-01-19 06:54:03,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:54:03,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions. [2022-01-19 06:54:03,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 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-01-19 06:54:03,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 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-01-19 06:54:03,311 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 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-01-19 06:54:03,311 INFO L186 Difference]: Start difference. First operand has 216 places, 233 transitions, 1699 flow. Second operand 6 states and 737 transitions. [2022-01-19 06:54:03,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 285 transitions, 2467 flow [2022-01-19 06:54:31,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 285 transitions, 2423 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-01-19 06:54:31,031 INFO L242 Difference]: Finished difference. Result has 219 places, 239 transitions, 1866 flow [2022-01-19 06:54:31,031 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=1537, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1866, PETRI_PLACES=219, PETRI_TRANSITIONS=239} [2022-01-19 06:54:31,031 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 68 predicate places. [2022-01-19 06:54:31,031 INFO L470 AbstractCegarLoop]: Abstraction has has 219 places, 239 transitions, 1866 flow [2022-01-19 06:54:31,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-01-19 06:54:31,032 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:54:31,032 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 06:54:31,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 06:54:31,032 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 06:54:31,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:54:31,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1183357756, now seen corresponding path program 3 times [2022-01-19 06:54:31,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:54:31,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813711811] [2022-01-19 06:54:31,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:54:31,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:54:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:54:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:54:31,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:54:31,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813711811] [2022-01-19 06:54:31,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813711811] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:54:31,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:54:31,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 06:54:31,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986657160] [2022-01-19 06:54:31,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:54:31,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 06:54:31,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:54:31,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 06:54:31,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:54:31,104 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2022-01-19 06:54:31,104 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 239 transitions, 1866 flow. Second operand has 6 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 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-01-19 06:54:31,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:54:31,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2022-01-19 06:54:31,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:54:48,507 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L79-->L78-1: Formula: (= (* v_~x6~0_4 2) v_~x6~0_3) InVars {~x6~0=v_~x6~0_4} OutVars{~x6~0=v_~x6~0_3} AuxVars[] AssignedVars[~x6~0][273], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1830#true, Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 84#L62-1true, 50#L78-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 2626#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 177#true, 106#L46-1true, 61#L105-4true, 1805#true, Black: 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1809#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1814#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296)))), Black: 208#true, 223#true, Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 26#L71true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 1823#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 99#L54-2true, Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 2593#(and (< 0 (mod ~x5~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1835#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 2088#(< (+ (div (mod ~x6~0 4294967296) (- 4294967296)) (div (+ (- 1) (mod ~x6~0 4294967296)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) (div (+ (- 1) (* (- 1) (mod ~x6~0 4294967296)) (mod ~n~0 4294967296)) 4294967296) 1)), Black: 2595#(and (< (+ (div (mod ~x6~0 4294967296) (- 4294967296)) (div (+ (- 1) (mod ~x6~0 4294967296)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) (div (+ (- 1) (* (- 1) (mod ~x6~0 4294967296)) (mod ~n~0 4294967296)) 4294967296) 1)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 1003#true, Black: 2601#(and (< 0 (mod ~x5~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 5#L38-2true, Black: 2597#(and (< (+ (div (mod ~x6~0 4294967296) (- 4294967296)) (div (+ (- 1) (mod ~x6~0 4294967296)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) (div (+ (- 1) (* (- 1) (mod ~x6~0 4294967296)) (mod ~n~0 4294967296)) 4294967296) 1)) (<= (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))) (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0))), 2610#true, Black: 2614#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 2615#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (<= (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))) (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:54:48,508 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-01-19 06:54:48,508 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 06:54:48,508 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 06:54:48,508 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 06:54:48,508 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][212], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 2621#true, 1835#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 177#true, 106#L46-1true, 61#L105-4true, 1805#true, Black: 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1809#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1814#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296)))), Black: 208#true, 223#true, Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 1823#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 99#L54-2true, Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 151#L79true, Black: 1830#true, Black: 2593#(and (< 0 (mod ~x5~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 2088#(< (+ (div (mod ~x6~0 4294967296) (- 4294967296)) (div (+ (- 1) (mod ~x6~0 4294967296)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) (div (+ (- 1) (* (- 1) (mod ~x6~0 4294967296)) (mod ~n~0 4294967296)) 4294967296) 1)), Black: 2595#(and (< (+ (div (mod ~x6~0 4294967296) (- 4294967296)) (div (+ (- 1) (mod ~x6~0 4294967296)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) (div (+ (- 1) (* (- 1) (mod ~x6~0 4294967296)) (mod ~n~0 4294967296)) 4294967296) 1)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 1003#true, Black: 2601#(and (< 0 (mod ~x5~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 5#L38-2true, Black: 2597#(and (< (+ (div (mod ~x6~0 4294967296) (- 4294967296)) (div (+ (- 1) (mod ~x6~0 4294967296)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) (div (+ (- 1) (* (- 1) (mod ~x6~0 4294967296)) (mod ~n~0 4294967296)) 4294967296) 1)) (<= (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))) (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0))), 2610#true, Black: 2614#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 2615#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (<= (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))) (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:54:48,508 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-01-19 06:54:48,508 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 06:54:48,508 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 06:54:48,508 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 06:54:57,174 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L79-->L78-1: Formula: (= (* v_~x6~0_4 2) v_~x6~0_3) InVars {~x6~0=v_~x6~0_4} OutVars{~x6~0=v_~x6~0_3} AuxVars[] AssignedVars[~x6~0][273], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 1830#true, Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 50#L78-1true, 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 2626#(<= (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 177#true, 106#L46-1true, 1805#true, Black: 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1809#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1814#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296)))), Black: 208#true, Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), 223#true, Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 26#L71true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 99#L54-2true, Black: 1823#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), Black: 2593#(and (< 0 (mod ~x5~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 1835#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), Black: 2088#(< (+ (div (mod ~x6~0 4294967296) (- 4294967296)) (div (+ (- 1) (mod ~x6~0 4294967296)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) (div (+ (- 1) (* (- 1) (mod ~x6~0 4294967296)) (mod ~n~0 4294967296)) 4294967296) 1)), Black: 2595#(and (< (+ (div (mod ~x6~0 4294967296) (- 4294967296)) (div (+ (- 1) (mod ~x6~0 4294967296)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) (div (+ (- 1) (* (- 1) (mod ~x6~0 4294967296)) (mod ~n~0 4294967296)) 4294967296) 1)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 1003#true, Black: 2601#(and (< 0 (mod ~x5~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 2597#(and (< (+ (div (mod ~x6~0 4294967296) (- 4294967296)) (div (+ (- 1) (mod ~x6~0 4294967296)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) (div (+ (- 1) (* (- 1) (mod ~x6~0 4294967296)) (mod ~n~0 4294967296)) 4294967296) 1)) (<= (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))) (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0))), 2610#true, 64#L106-2true, Black: 2614#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 2615#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (<= (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))) (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:54:57,175 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-01-19 06:54:57,175 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 06:54:57,175 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 06:54:57,175 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 06:54:57,175 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L71-->L70-1: Formula: (= (* v_~x5~0_2 2) v_~x5~0_1) InVars {~x5~0=v_~x5~0_2} OutVars{~x5~0=v_~x5~0_1} AuxVars[] AssignedVars[~x5~0][212], [Black: 1774#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1780#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), 2621#true, Black: 184#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)) (* (- 1) ~x6~0)) 0) (= 0 (+ (* (- 1) ~x4~0) (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)), 1835#(<= (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0)), 213#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), 84#L62-1true, Black: 1799#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1798#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 201#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 202#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), 177#true, 106#L46-1true, 1805#true, Black: 1810#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1809#(<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))), Black: 1814#(and (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (<= (+ (* (div ~x6~0 4294967296) 4294967296) ~n~0) (+ ~x6~0 (* (div ~n~0 4294967296) 4294967296)))), Black: 208#true, Black: 217#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0))), 223#true, Black: 212#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 8#L70-1true, Black: 986#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 99#L54-2true, Black: 1823#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 988#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x4~0 4294967296))), Black: 994#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 228#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 990#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod ~x4~0 4294967296))), Black: 517#(and (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x4~0 4294967296))), 151#L79true, Black: 1830#true, Black: 2593#(and (< 0 (mod ~x5~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 2088#(< (+ (div (mod ~x6~0 4294967296) (- 4294967296)) (div (+ (- 1) (mod ~x6~0 4294967296)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) (div (+ (- 1) (* (- 1) (mod ~x6~0 4294967296)) (mod ~n~0 4294967296)) 4294967296) 1)), Black: 2595#(and (< (+ (div (mod ~x6~0 4294967296) (- 4294967296)) (div (+ (- 1) (mod ~x6~0 4294967296)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) (div (+ (- 1) (* (- 1) (mod ~x6~0 4294967296)) (mod ~n~0 4294967296)) 4294967296) 1)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 1003#true, Black: 2601#(and (< 0 (mod ~x5~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), Black: 2597#(and (< (+ (div (mod ~x6~0 4294967296) (- 4294967296)) (div (+ (- 1) (mod ~x6~0 4294967296)) (- 4294967296))) (+ (div (+ 4294967295 (* (- 1) (mod ~x6~0 4294967296))) 4294967296) (div (+ (- 1) (* (- 1) (mod ~x6~0 4294967296)) (mod ~n~0 4294967296)) 4294967296) 1)) (<= (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296))) (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0))), 2610#true, 64#L106-2true, Black: 2614#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* 4294967296 (div ~x5~0 4294967296)) ~x5~0) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1253#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 2615#(and (= (+ (* (- 4294967296) (div ~x3~0 4294967296)) ~x3~0) (+ (* (div ~x4~0 4294967296) (- 4294967296)) ~x4~0)) (<= (+ ~n~0 (* 4294967296 (div ~x5~0 4294967296))) (+ ~x5~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ ~x6~0 (* (div ~x6~0 4294967296) (- 4294967296))) (+ ~x5~0 (* (- 4294967296) (div ~x5~0 4294967296)))) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))) (not (<= ~x5~0 (* 4294967296 (div ~x5~0 4294967296))))), Black: 1009#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 1784#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 1776#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1782#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)))]) [2022-01-19 06:54:57,175 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-01-19 06:54:57,175 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 06:54:57,175 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 06:54:57,175 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 06:55:02,106 INFO L129 PetriNetUnfolder]: 177018/266613 cut-off events. [2022-01-19 06:55:02,106 INFO L130 PetriNetUnfolder]: For 1132276/1145919 co-relation queries the response was YES. [2022-01-19 06:55:05,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1141864 conditions, 266613 events. 177018/266613 cut-off events. For 1132276/1145919 co-relation queries the response was YES. Maximal size of possible extension queue 13677. Compared 2475066 event pairs, 22343 based on Foata normal form. 14353/269629 useless extension candidates. Maximal degree in co-relation 1141822. Up to 93549 conditions per place. [2022-01-19 06:55:07,010 INFO L132 encePairwiseOnDemand]: 158/169 looper letters, 168 selfloop transitions, 31 changer transitions 0/336 dead transitions. [2022-01-19 06:55:07,010 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 336 transitions, 2964 flow [2022-01-19 06:55:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 06:55:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 06:55:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 925 transitions. [2022-01-19 06:55:07,028 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7819103972950127 [2022-01-19 06:55:07,028 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 925 transitions. [2022-01-19 06:55:07,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 925 transitions. [2022-01-19 06:55:07,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:55:07,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 925 transitions. [2022-01-19 06:55:07,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.14285714285714) internal successors, (925), 7 states have internal predecessors, (925), 0 states have call successors, (0), 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-01-19 06:55:07,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-01-19 06:55:07,032 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-01-19 06:55:07,032 INFO L186 Difference]: Start difference. First operand has 219 places, 239 transitions, 1866 flow. Second operand 7 states and 925 transitions. [2022-01-19 06:55:07,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 336 transitions, 2964 flow [2022-01-19 06:55:45,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 336 transitions, 2917 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 06:55:45,423 INFO L242 Difference]: Finished difference. Result has 225 places, 244 transitions, 1985 flow [2022-01-19 06:55:45,423 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=1819, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1985, PETRI_PLACES=225, PETRI_TRANSITIONS=244} [2022-01-19 06:55:45,423 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 74 predicate places. [2022-01-19 06:55:45,423 INFO L470 AbstractCegarLoop]: Abstraction has has 225 places, 244 transitions, 1985 flow [2022-01-19 06:55:45,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 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-01-19 06:55:45,424 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:55:45,424 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 06:55:45,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 06:55:45,424 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 06:55:45,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:55:45,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1527063256, now seen corresponding path program 1 times [2022-01-19 06:55:45,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:55:45,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260112760] [2022-01-19 06:55:45,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:55:45,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:55:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:55:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:55:45,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:55:45,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260112760] [2022-01-19 06:55:45,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260112760] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:55:45,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:55:45,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 06:55:45,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853445458] [2022-01-19 06:55:45,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:55:45,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 06:55:45,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:55:45,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 06:55:45,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-19 06:55:45,611 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-01-19 06:55:45,611 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 244 transitions, 1985 flow. Second operand has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 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-01-19 06:55:45,611 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:55:45,611 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-01-19 06:55:45,611 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:56:29,590 INFO L129 PetriNetUnfolder]: 252953/351581 cut-off events. [2022-01-19 06:56:29,591 INFO L130 PetriNetUnfolder]: For 1926166/1926379 co-relation queries the response was YES. [2022-01-19 06:56:32,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1666531 conditions, 351581 events. 252953/351581 cut-off events. For 1926166/1926379 co-relation queries the response was YES. Maximal size of possible extension queue 15570. Compared 2811046 event pairs, 74096 based on Foata normal form. 5727/355136 useless extension candidates. Maximal degree in co-relation 1666487. Up to 184828 conditions per place. [2022-01-19 06:56:35,240 INFO L132 encePairwiseOnDemand]: 157/169 looper letters, 211 selfloop transitions, 63 changer transitions 2/360 dead transitions. [2022-01-19 06:56:35,240 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 360 transitions, 3660 flow [2022-01-19 06:56:35,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 06:56:35,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 06:56:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 864 transitions. [2022-01-19 06:56:35,241 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7303465765004227 [2022-01-19 06:56:35,241 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 864 transitions. [2022-01-19 06:56:35,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 864 transitions. [2022-01-19 06:56:35,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:56:35,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 864 transitions. [2022-01-19 06:56:35,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 0 states have call successors, (0), 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-01-19 06:56:35,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-01-19 06:56:35,273 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 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-01-19 06:56:35,273 INFO L186 Difference]: Start difference. First operand has 225 places, 244 transitions, 1985 flow. Second operand 7 states and 864 transitions. [2022-01-19 06:56:35,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 360 transitions, 3660 flow [2022-01-19 06:58:37,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 360 transitions, 3633 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-01-19 06:58:37,092 INFO L242 Difference]: Finished difference. Result has 231 places, 259 transitions, 2470 flow [2022-01-19 06:58:37,092 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=1968, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2470, PETRI_PLACES=231, PETRI_TRANSITIONS=259} [2022-01-19 06:58:37,093 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 80 predicate places. [2022-01-19 06:58:37,093 INFO L470 AbstractCegarLoop]: Abstraction has has 231 places, 259 transitions, 2470 flow [2022-01-19 06:58:37,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 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-01-19 06:58:37,093 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:58:37,106 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 06:58:37,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 06:58:37,106 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 06:58:37,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:58:37,106 INFO L85 PathProgramCache]: Analyzing trace with hash 271503096, now seen corresponding path program 1 times [2022-01-19 06:58:37,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:58:37,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230750943] [2022-01-19 06:58:37,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:58:37,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:58:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:58:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:58:37,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:58:37,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230750943] [2022-01-19 06:58:37,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230750943] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:58:37,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203646281] [2022-01-19 06:58:37,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:58:37,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:58:37,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:58:37,600 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-01-19 06:58:37,601 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-01-19 06:58:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:58:37,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 06:58:37,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:58:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:58:55,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:59:11,836 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 06:59:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:59:12,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203646281] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:59:12,210 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:59:12,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2022-01-19 06:59:12,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43037668] [2022-01-19 06:59:12,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:59:12,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-19 06:59:12,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:59:12,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-19 06:59:12,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=581, Unknown=2, NotChecked=0, Total=756 [2022-01-19 06:59:12,213 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-01-19 06:59:12,214 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 259 transitions, 2470 flow. Second operand has 28 states, 28 states have (on average 109.42857142857143) internal successors, (3064), 28 states have internal predecessors, (3064), 0 states have call successors, (0), 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-01-19 06:59:12,214 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:59:12,215 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-01-19 06:59:12,215 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:59:25,128 WARN L228 SmtUtils]: Spent 7.20s on a formula simplification. DAG size of input: 55 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:59:34,493 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:59:36,503 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:59:38,522 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:59:40,723 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:59:41,894 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:59:43,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:59:52,316 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:59:54,324 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:59:55,459 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:00:03,734 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:00:05,747 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:00:07,762 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:00:12,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:00:15,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:00:17,047 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:00:19,974 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:00:24,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:00:28,493 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:00:44,636 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:00:46,222 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:00:55,232 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:00:57,398 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:00:59,409 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:01:01,420 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:01:03,483 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:01:20,198 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:01:22,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:01:24,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:01:26,697 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:01:31,972 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 07:01:33,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []