/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-After.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 12:45:07,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 12:45:07,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 12:45:07,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 12:45:07,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 12:45:07,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 12:45:07,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 12:45:07,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 12:45:07,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 12:45:07,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 12:45:07,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 12:45:07,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 12:45:07,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 12:45:07,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 12:45:07,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 12:45:07,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 12:45:07,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 12:45:07,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 12:45:07,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 12:45:07,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 12:45:07,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 12:45:07,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 12:45:07,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 12:45:07,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 12:45:07,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 12:45:07,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 12:45:07,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 12:45:07,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 12:45:07,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 12:45:07,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 12:45:07,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 12:45:07,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 12:45:07,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 12:45:07,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 12:45:07,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 12:45:07,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 12:45:07,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 12:45:07,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 12:45:07,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 12:45:07,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 12:45:07,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 12:45:07,109 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-After.epf [2022-01-19 12:45:07,142 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 12:45:07,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 12:45:07,143 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 12:45:07,143 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 12:45:07,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 12:45:07,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 12:45:07,144 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 12:45:07,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 12:45:07,144 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 12:45:07,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 12:45:07,144 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 12:45:07,144 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 12:45:07,144 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 12:45:07,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 12:45:07,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 12:45:07,145 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 12:45:07,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 12:45:07,145 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 12:45:07,145 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 12:45:07,145 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 12:45:07,145 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 12:45:07,146 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 12:45:07,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 12:45:07,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 12:45:07,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 12:45:07,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 12:45:07,146 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 12:45:07,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 12:45:07,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 12:45:07,147 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 12:45:07,147 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 12:45:07,147 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 12:45:07,147 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 12:45:07,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 12:45:07,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 12:45:07,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 12:45:07,336 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 12:45:07,336 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 12:45:07,337 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 12:45:07,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bfe5d9bf/0089b614c3664fd8a66e96c3e3162743/FLAGb2b7c119c [2022-01-19 12:45:07,758 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 12:45:07,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2022-01-19 12:45:07,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bfe5d9bf/0089b614c3664fd8a66e96c3e3162743/FLAGb2b7c119c [2022-01-19 12:45:08,163 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bfe5d9bf/0089b614c3664fd8a66e96c3e3162743 [2022-01-19 12:45:08,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 12:45:08,167 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 12:45:08,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 12:45:08,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 12:45:08,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 12:45:08,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:45:08" (1/1) ... [2022-01-19 12:45:08,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@994d9c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:08, skipping insertion in model container [2022-01-19 12:45:08,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:45:08" (1/1) ... [2022-01-19 12:45:08,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 12:45:08,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 12:45:08,364 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 12:45:08,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 12:45:08,373 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 12:45:08,393 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 12:45:08,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 12:45:08,405 INFO L208 MainTranslator]: Completed translation [2022-01-19 12:45:08,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:08 WrapperNode [2022-01-19 12:45:08,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 12:45:08,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 12:45:08,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 12:45:08,406 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 12:45:08,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:08" (1/1) ... [2022-01-19 12:45:08,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:08" (1/1) ... [2022-01-19 12:45:08,451 INFO L137 Inliner]: procedures = 22, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2022-01-19 12:45:08,452 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 12:45:08,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 12:45:08,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 12:45:08,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 12:45:08,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:08" (1/1) ... [2022-01-19 12:45:08,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:08" (1/1) ... [2022-01-19 12:45:08,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:08" (1/1) ... [2022-01-19 12:45:08,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:08" (1/1) ... [2022-01-19 12:45:08,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:08" (1/1) ... [2022-01-19 12:45:08,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:08" (1/1) ... [2022-01-19 12:45:08,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:08" (1/1) ... [2022-01-19 12:45:08,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 12:45:08,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 12:45:08,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 12:45:08,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 12:45:08,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:08" (1/1) ... [2022-01-19 12:45:08,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 12:45:08,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 12:45:08,532 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 12:45:08,555 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 12:45:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 12:45:08,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 12:45:08,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 12:45:08,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 12:45:08,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 12:45:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 12:45:08,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 12:45:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-19 12:45:08,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-19 12:45:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 12:45:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-01-19 12:45:08,572 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-01-19 12:45:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-01-19 12:45:08,572 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-01-19 12:45:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 12:45:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 12:45:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 12:45:08,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 12:45:08,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 12:45:08,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 12:45:08,574 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 12:45:08,692 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 12:45:08,693 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 12:45:08,882 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 12:45:08,890 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 12:45:08,890 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-19 12:45:08,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:45:08 BoogieIcfgContainer [2022-01-19 12:45:08,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 12:45:08,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 12:45:08,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 12:45:08,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 12:45:08,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 12:45:08" (1/3) ... [2022-01-19 12:45:08,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7406cda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:45:08, skipping insertion in model container [2022-01-19 12:45:08,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:08" (2/3) ... [2022-01-19 12:45:08,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7406cda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:45:08, skipping insertion in model container [2022-01-19 12:45:08,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:45:08" (3/3) ... [2022-01-19 12:45:08,902 INFO L111 eAbstractionObserver]: Analyzing ICFG bench-exp3x3.wvr.c [2022-01-19 12:45:08,906 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 12:45:08,907 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 12:45:08,907 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 12:45:08,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,950 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,950 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,951 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,952 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,952 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,952 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,952 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,954 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,954 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,954 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,954 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,955 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,955 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,956 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,956 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,957 WARN L322 ript$VariableManager]: TermVariabe |thread6Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,957 WARN L322 ript$VariableManager]: TermVariabe |thread6Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,957 WARN L322 ript$VariableManager]: TermVariabe |thread6Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,957 WARN L322 ript$VariableManager]: TermVariabe |thread6Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,971 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,972 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,974 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,974 WARN L322 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,974 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,975 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,975 WARN L322 ript$VariableManager]: TermVariabe |thread6Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,976 WARN L322 ript$VariableManager]: TermVariabe |thread6Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,976 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,976 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,977 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,977 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:45:08,985 INFO L148 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-01-19 12:45:09,063 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 12:45:09,068 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 12:45:09,068 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 12:45:09,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 174 places, 169 transitions, 386 flow [2022-01-19 12:45:09,140 INFO L129 PetriNetUnfolder]: 14/163 cut-off events. [2022-01-19 12:45:09,141 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-01-19 12:45:09,147 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 12:45:09,147 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 169 transitions, 386 flow [2022-01-19 12:45:09,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 146 transitions, 328 flow [2022-01-19 12:45:09,187 INFO L129 PetriNetUnfolder]: 14/145 cut-off events. [2022-01-19 12:45:09,188 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-01-19 12:45:09,188 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:45:09,189 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 12:45:09,189 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 12:45:09,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:45:09,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1565365569, now seen corresponding path program 1 times [2022-01-19 12:45:09,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:45:09,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675426058] [2022-01-19 12:45:09,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:45:09,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:45:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:45:09,560 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 12:45:09,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:45:09,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675426058] [2022-01-19 12:45:09,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675426058] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:45:09,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:45:09,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 12:45:09,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063620111] [2022-01-19 12:45:09,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:45:09,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 12:45:09,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:45:09,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 12:45:09,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 12:45:09,610 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 169 [2022-01-19 12:45:09,617 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 12:45:09,617 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:45:09,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 169 [2022-01-19 12:45:09,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:45:09,699 INFO L129 PetriNetUnfolder]: 6/138 cut-off events. [2022-01-19 12:45:09,699 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-01-19 12:45:09,702 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 12:45:09,704 INFO L132 encePairwiseOnDemand]: 161/169 looper letters, 12 selfloop transitions, 0 changer transitions 2/138 dead transitions. [2022-01-19 12:45:09,704 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 138 transitions, 336 flow [2022-01-19 12:45:09,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 12:45:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 12:45:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 316 transitions. [2022-01-19 12:45:09,721 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9349112426035503 [2022-01-19 12:45:09,723 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 316 transitions. [2022-01-19 12:45:09,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 316 transitions. [2022-01-19 12:45:09,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:45:09,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 316 transitions. [2022-01-19 12:45:09,734 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 12:45:09,739 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 12:45:09,739 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 12:45:09,741 INFO L186 Difference]: Start difference. First operand has 151 places, 146 transitions, 328 flow. Second operand 2 states and 316 transitions. [2022-01-19 12:45:09,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 138 transitions, 336 flow [2022-01-19 12:45:09,745 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 12:45:09,748 INFO L242 Difference]: Finished difference. Result has 140 places, 136 transitions, 284 flow [2022-01-19 12:45:09,750 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 12:45:09,753 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, -11 predicate places. [2022-01-19 12:45:09,753 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 136 transitions, 284 flow [2022-01-19 12:45:09,753 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 12:45:09,754 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:45:09,754 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 12:45:09,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 12:45:09,754 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 12:45:09,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:45:09,755 INFO L85 PathProgramCache]: Analyzing trace with hash -616084000, now seen corresponding path program 1 times [2022-01-19 12:45:09,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:45:09,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302775989] [2022-01-19 12:45:09,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:45:09,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:45:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:45:10,357 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 12:45:10,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:45:10,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302775989] [2022-01-19 12:45:10,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302775989] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:45:10,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:45:10,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 12:45:10,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580714967] [2022-01-19 12:45:10,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:45:10,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 12:45:10,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:45:10,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 12:45:10,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-19 12:45:10,363 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 169 [2022-01-19 12:45:10,364 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 12:45:10,364 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:45:10,364 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 169 [2022-01-19 12:45:10,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:45:12,559 INFO L129 PetriNetUnfolder]: 13855/19795 cut-off events. [2022-01-19 12:45:12,559 INFO L130 PetriNetUnfolder]: For 728/910 co-relation queries the response was YES. [2022-01-19 12:45:12,598 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 12:45:12,709 INFO L132 encePairwiseOnDemand]: 157/169 looper letters, 69 selfloop transitions, 9 changer transitions 4/168 dead transitions. [2022-01-19 12:45:12,709 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 168 transitions, 523 flow [2022-01-19 12:45:12,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 12:45:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 12:45:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 839 transitions. [2022-01-19 12:45:12,713 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7092138630600169 [2022-01-19 12:45:12,713 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 839 transitions. [2022-01-19 12:45:12,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 839 transitions. [2022-01-19 12:45:12,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:45:12,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 839 transitions. [2022-01-19 12:45:12,717 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 12:45:12,721 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 12:45:12,722 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 12:45:12,722 INFO L186 Difference]: Start difference. First operand has 140 places, 136 transitions, 284 flow. Second operand 7 states and 839 transitions. [2022-01-19 12:45:12,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 168 transitions, 523 flow [2022-01-19 12:45:12,726 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 12:45:12,731 INFO L242 Difference]: Finished difference. Result has 147 places, 142 transitions, 339 flow [2022-01-19 12:45:12,732 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 12:45:12,732 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, -4 predicate places. [2022-01-19 12:45:12,733 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 142 transitions, 339 flow [2022-01-19 12:45:12,733 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 12:45:12,734 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:45:12,734 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 12:45:12,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 12:45:12,734 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 12:45:12,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:45:12,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1758121540, now seen corresponding path program 1 times [2022-01-19 12:45:12,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:45:12,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385366667] [2022-01-19 12:45:12,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:45:12,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:45:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:45:13,136 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 12:45:13,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:45:13,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385366667] [2022-01-19 12:45:13,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385366667] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:45:13,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:45:13,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 12:45:13,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810281775] [2022-01-19 12:45:13,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:45:13,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 12:45:13,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:45:13,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 12:45:13,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 12:45:13,139 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-01-19 12:45:13,140 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 12:45:13,140 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:45:13,140 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-01-19 12:45:13,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:45:15,076 INFO L129 PetriNetUnfolder]: 13532/20062 cut-off events. [2022-01-19 12:45:15,076 INFO L130 PetriNetUnfolder]: For 4486/4730 co-relation queries the response was YES. [2022-01-19 12:45:15,126 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 12:45:15,214 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 84 selfloop transitions, 17 changer transitions 1/186 dead transitions. [2022-01-19 12:45:15,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 186 transitions, 665 flow [2022-01-19 12:45:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 12:45:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 12:45:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions. [2022-01-19 12:45:15,216 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7297830374753451 [2022-01-19 12:45:15,216 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 740 transitions. [2022-01-19 12:45:15,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions. [2022-01-19 12:45:15,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:45:15,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions. [2022-01-19 12:45:15,219 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 12:45:15,220 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 12:45:15,221 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 12:45:15,221 INFO L186 Difference]: Start difference. First operand has 147 places, 142 transitions, 339 flow. Second operand 6 states and 740 transitions. [2022-01-19 12:45:15,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 186 transitions, 665 flow [2022-01-19 12:45:15,227 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 12:45:15,231 INFO L242 Difference]: Finished difference. Result has 147 places, 150 transitions, 411 flow [2022-01-19 12:45:15,231 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 12:45:15,233 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, -4 predicate places. [2022-01-19 12:45:15,233 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 150 transitions, 411 flow [2022-01-19 12:45:15,234 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 12:45:15,234 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:45:15,234 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 12:45:15,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 12:45:15,235 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 12:45:15,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:45:15,237 INFO L85 PathProgramCache]: Analyzing trace with hash 793584122, now seen corresponding path program 2 times [2022-01-19 12:45:15,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:45:15,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921679085] [2022-01-19 12:45:15,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:45:15,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:45:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:45:15,357 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 12:45:15,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:45:15,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921679085] [2022-01-19 12:45:15,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921679085] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:45:15,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:45:15,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 12:45:15,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451671180] [2022-01-19 12:45:15,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:45:15,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 12:45:15,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:45:15,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 12:45:15,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 12:45:15,361 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2022-01-19 12:45:15,362 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 12:45:15,362 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:45:15,362 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2022-01-19 12:45:15,362 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:45:17,846 INFO L129 PetriNetUnfolder]: 20952/31681 cut-off events. [2022-01-19 12:45:17,846 INFO L130 PetriNetUnfolder]: For 12684/12915 co-relation queries the response was YES. [2022-01-19 12:45:17,949 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 12:45:18,127 INFO L132 encePairwiseOnDemand]: 158/169 looper letters, 104 selfloop transitions, 15 changer transitions 0/223 dead transitions. [2022-01-19 12:45:18,127 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 223 transitions, 852 flow [2022-01-19 12:45:18,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 12:45:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 12:45:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 941 transitions. [2022-01-19 12:45:18,130 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7954353338968724 [2022-01-19 12:45:18,130 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 941 transitions. [2022-01-19 12:45:18,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 941 transitions. [2022-01-19 12:45:18,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:45:18,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 941 transitions. [2022-01-19 12:45:18,132 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 12:45:18,136 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 12:45:18,136 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 12:45:18,136 INFO L186 Difference]: Start difference. First operand has 147 places, 150 transitions, 411 flow. Second operand 7 states and 941 transitions. [2022-01-19 12:45:18,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 223 transitions, 852 flow [2022-01-19 12:45:18,146 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 12:45:18,149 INFO L242 Difference]: Finished difference. Result has 153 places, 155 transitions, 472 flow [2022-01-19 12:45:18,149 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 12:45:18,150 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 2 predicate places. [2022-01-19 12:45:18,151 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 155 transitions, 472 flow [2022-01-19 12:45:18,151 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 12:45:18,151 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:45:18,151 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 12:45:18,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 12:45:18,151 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 12:45:18,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:45:18,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1562844010, now seen corresponding path program 1 times [2022-01-19 12:45:18,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:45:18,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236192673] [2022-01-19 12:45:18,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:45:18,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:45:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:45:18,430 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 12:45:18,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:45:18,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236192673] [2022-01-19 12:45:18,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236192673] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 12:45:18,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555342262] [2022-01-19 12:45:18,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:45:18,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 12:45:18,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 12:45:18,439 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 12:45:18,446 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 12:45:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:45:18,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 12:45:18,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 12:45:19,250 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 12:45:19,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 12:45:19,658 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 12:45:19,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555342262] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 12:45:19,659 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 12:45:19,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-01-19 12:45:19,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813654654] [2022-01-19 12:45:19,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 12:45:19,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 12:45:19,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:45:19,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 12:45:19,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-19 12:45:19,662 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2022-01-19 12:45:19,664 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 12:45:19,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:45:19,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2022-01-19 12:45:19,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:45:25,176 INFO L129 PetriNetUnfolder]: 50113/75128 cut-off events. [2022-01-19 12:45:25,176 INFO L130 PetriNetUnfolder]: For 80131/81542 co-relation queries the response was YES. [2022-01-19 12:45:25,474 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 12:45:25,929 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 167 selfloop transitions, 22 changer transitions 0/294 dead transitions. [2022-01-19 12:45:25,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 294 transitions, 1458 flow [2022-01-19 12:45:25,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 12:45:25,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 12:45:25,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1573 transitions. [2022-01-19 12:45:25,935 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7756410256410257 [2022-01-19 12:45:25,935 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1573 transitions. [2022-01-19 12:45:25,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1573 transitions. [2022-01-19 12:45:25,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:45:25,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1573 transitions. [2022-01-19 12:45:25,940 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 12:45:25,943 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 12:45:25,944 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 12:45:25,944 INFO L186 Difference]: Start difference. First operand has 153 places, 155 transitions, 472 flow. Second operand 12 states and 1573 transitions. [2022-01-19 12:45:25,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 294 transitions, 1458 flow [2022-01-19 12:45:26,029 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 12:45:26,031 INFO L242 Difference]: Finished difference. Result has 169 places, 167 transitions, 604 flow [2022-01-19 12:45:26,032 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 12:45:26,032 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 18 predicate places. [2022-01-19 12:45:26,033 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 167 transitions, 604 flow [2022-01-19 12:45:26,033 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 12:45:26,033 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:45:26,033 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 12:45:26,051 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 12:45:26,239 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 12:45:26,240 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 12:45:26,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:45:26,240 INFO L85 PathProgramCache]: Analyzing trace with hash 87096828, now seen corresponding path program 1 times [2022-01-19 12:45:26,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:45:26,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064219947] [2022-01-19 12:45:26,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:45:26,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:45:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:45:26,559 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 12:45:26,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:45:26,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064219947] [2022-01-19 12:45:26,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064219947] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 12:45:26,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254490172] [2022-01-19 12:45:26,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:45:26,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 12:45:26,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 12:45:26,561 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 12:45:26,590 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 12:45:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:45:26,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 12:45:26,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 12:45:27,300 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 12:45:27,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 12:45:27,624 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 12:45:27,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254490172] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 12:45:27,624 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 12:45:27,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-01-19 12:45:27,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044887135] [2022-01-19 12:45:27,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 12:45:27,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 12:45:27,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:45:27,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 12:45:27,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-01-19 12:45:27,627 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-01-19 12:45:27,629 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 12:45:27,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:45:27,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-01-19 12:45:27,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:45:37,699 INFO L129 PetriNetUnfolder]: 81740/122202 cut-off events. [2022-01-19 12:45:37,699 INFO L130 PetriNetUnfolder]: For 252386/253211 co-relation queries the response was YES. [2022-01-19 12:45:38,397 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 12:45:38,929 INFO L132 encePairwiseOnDemand]: 152/169 looper letters, 290 selfloop transitions, 36 changer transitions 1/411 dead transitions. [2022-01-19 12:45:38,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 411 transitions, 2493 flow [2022-01-19 12:45:38,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 12:45:38,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 12:45:38,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1725 transitions. [2022-01-19 12:45:38,933 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7290786136939983 [2022-01-19 12:45:38,933 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1725 transitions. [2022-01-19 12:45:38,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1725 transitions. [2022-01-19 12:45:38,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:45:38,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1725 transitions. [2022-01-19 12:45:38,937 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 12:45:38,940 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 12:45:38,941 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 12:45:38,941 INFO L186 Difference]: Start difference. First operand has 169 places, 167 transitions, 604 flow. Second operand 14 states and 1725 transitions. [2022-01-19 12:45:38,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 411 transitions, 2493 flow [2022-01-19 12:45:39,605 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 12:45:39,608 INFO L242 Difference]: Finished difference. Result has 187 places, 183 transitions, 852 flow [2022-01-19 12:45:39,609 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 12:45:39,609 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 36 predicate places. [2022-01-19 12:45:39,609 INFO L470 AbstractCegarLoop]: Abstraction has has 187 places, 183 transitions, 852 flow [2022-01-19 12:45:39,610 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 12:45:39,610 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:45:39,610 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 12:45:39,630 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 12:45:39,818 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 12:45:39,818 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 12:45:39,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:45:39,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1417117332, now seen corresponding path program 2 times [2022-01-19 12:45:39,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:45:39,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411584471] [2022-01-19 12:45:39,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:45:39,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:45:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:45:40,091 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 12:45:40,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:45:40,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411584471] [2022-01-19 12:45:40,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411584471] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:45:40,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:45:40,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 12:45:40,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685112309] [2022-01-19 12:45:40,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:45:40,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 12:45:40,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:45:40,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 12:45:40,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 12:45:40,094 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-01-19 12:45:40,095 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 12:45:40,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:45:40,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-01-19 12:45:40,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:45:50,591 INFO L129 PetriNetUnfolder]: 80515/116929 cut-off events. [2022-01-19 12:45:50,591 INFO L130 PetriNetUnfolder]: For 394482/394755 co-relation queries the response was YES. [2022-01-19 12:45:51,281 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 12:45:52,074 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 123 selfloop transitions, 27 changer transitions 1/235 dead transitions. [2022-01-19 12:45:52,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 235 transitions, 1466 flow [2022-01-19 12:45:52,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 12:45:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 12:45:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2022-01-19 12:45:52,077 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.727810650887574 [2022-01-19 12:45:52,077 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 738 transitions. [2022-01-19 12:45:52,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions. [2022-01-19 12:45:52,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:45:52,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions. [2022-01-19 12:45:52,079 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 12:45:52,080 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 12:45:52,081 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 12:45:52,081 INFO L186 Difference]: Start difference. First operand has 187 places, 183 transitions, 852 flow. Second operand 6 states and 738 transitions. [2022-01-19 12:45:52,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 235 transitions, 1466 flow [2022-01-19 12:45:53,146 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 12:45:53,149 INFO L242 Difference]: Finished difference. Result has 190 places, 193 transitions, 1000 flow [2022-01-19 12:45:53,149 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 12:45:53,150 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 39 predicate places. [2022-01-19 12:45:53,150 INFO L470 AbstractCegarLoop]: Abstraction has has 190 places, 193 transitions, 1000 flow [2022-01-19 12:45:53,150 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 12:45:53,150 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:45:53,150 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 12:45:53,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 12:45:53,150 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 12:45:53,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:45:53,151 INFO L85 PathProgramCache]: Analyzing trace with hash 260390758, now seen corresponding path program 1 times [2022-01-19 12:45:53,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:45:53,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426940797] [2022-01-19 12:45:53,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:45:53,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:45:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:45:53,253 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 12:45:53,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:45:53,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426940797] [2022-01-19 12:45:53,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426940797] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:45:53,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:45:53,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 12:45:53,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766737952] [2022-01-19 12:45:53,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:45:53,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 12:45:53,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:45:53,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 12:45:53,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 12:45:53,256 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2022-01-19 12:45:53,257 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 12:45:53,257 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:45:53,257 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2022-01-19 12:45:53,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:45:59,347 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 12:45:59,348 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-01-19 12:45:59,348 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 12:45:59,348 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 12:45:59,348 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 12:45:59,376 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 12:45:59,377 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-01-19 12:45:59,377 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 12:45:59,377 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 12:45:59,377 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 12:46:00,076 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 12:46:00,076 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-01-19 12:46:00,076 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 12:46:00,077 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 12:46:00,077 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 12:46:00,113 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 12:46:00,113 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-01-19 12:46:00,113 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 12:46:00,113 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 12:46:00,113 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 12:46:00,773 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 12:46:00,773 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 12:46:00,773 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 12:46:00,773 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 12:46:00,773 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 12:46:00,774 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 12:46:00,774 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 12:46:00,774 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:00,774 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 12:46:00,774 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 12:46:00,809 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 12:46:00,809 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 12:46:00,810 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 12:46:00,810 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 12:46:00,810 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 12:46:00,810 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 12:46:00,810 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 12:46:00,810 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 12:46:00,810 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 12:46:00,810 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:00,823 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 12:46:00,824 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 12:46:00,824 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 12:46:00,824 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 12:46:00,824 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:00,831 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 12:46:00,831 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 12:46:00,831 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 12:46:00,831 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 12:46:00,831 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:01,255 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 12:46:01,255 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 12:46:01,255 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 12:46:01,256 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 12:46:01,256 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:01,295 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 12:46:01,295 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 12:46:01,295 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 12:46:01,295 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 12:46:01,295 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:01,604 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 12:46:01,605 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 12:46:01,605 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 12:46:01,605 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 12:46:01,605 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:01,614 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 12:46:01,614 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 12:46:01,614 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 12:46:01,614 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 12:46:01,614 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:02,320 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 12:46:02,320 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 12:46:02,320 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 12:46:02,320 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 12:46:02,320 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 12:46:02,320 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 12:46:02,320 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 12:46:02,320 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:02,320 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 12:46:02,320 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:02,330 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 12:46:02,330 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 12:46:02,330 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 12:46:02,330 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:02,330 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:02,330 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 12:46:02,330 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 12:46:02,330 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 12:46:02,330 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 12:46:02,330 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 12:46:02,784 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 12:46:02,784 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 12:46:02,784 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 12:46:02,784 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 12:46:02,784 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 12:46:02,791 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 12:46:02,791 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 12:46:02,791 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 12:46:02,791 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 12:46:02,791 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 12:46:03,598 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 12:46:03,598 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 12:46:03,598 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:03,598 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:03,598 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 12:46:03,598 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 12:46:03,599 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 12:46:03,599 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:03,599 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:03,599 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 12:46:03,599 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 12:46:03,599 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 12:46:03,599 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:03,599 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:03,599 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 12:46:03,599 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 12:46:03,599 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 12:46:03,599 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:03,599 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 12:46:03,599 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 12:46:08,915 INFO L129 PetriNetUnfolder]: 115930/173971 cut-off events. [2022-01-19 12:46:08,915 INFO L130 PetriNetUnfolder]: For 526321/540429 co-relation queries the response was YES. [2022-01-19 12:46:10,436 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 12:46:11,358 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 154 selfloop transitions, 39 changer transitions 0/310 dead transitions. [2022-01-19 12:46:11,358 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 310 transitions, 2207 flow [2022-01-19 12:46:11,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 12:46:11,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 12:46:11,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 926 transitions. [2022-01-19 12:46:11,361 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7827557058326289 [2022-01-19 12:46:11,361 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 926 transitions. [2022-01-19 12:46:11,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 926 transitions. [2022-01-19 12:46:11,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:46:11,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 926 transitions. [2022-01-19 12:46:11,363 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 12:46:11,365 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 12:46:11,365 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 12:46:11,365 INFO L186 Difference]: Start difference. First operand has 190 places, 193 transitions, 1000 flow. Second operand 7 states and 926 transitions. [2022-01-19 12:46:11,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 310 transitions, 2207 flow [2022-01-19 12:46:15,373 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 12:46:15,375 INFO L242 Difference]: Finished difference. Result has 196 places, 213 transitions, 1252 flow [2022-01-19 12:46:15,376 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 12:46:15,376 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 45 predicate places. [2022-01-19 12:46:15,376 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 213 transitions, 1252 flow [2022-01-19 12:46:15,377 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 12:46:15,377 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:46:15,377 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 12:46:15,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 12:46:15,377 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 12:46:15,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:46:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash 599558452, now seen corresponding path program 2 times [2022-01-19 12:46:15,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:46:15,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605022969] [2022-01-19 12:46:15,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:46:15,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:46:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:46:15,661 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 12:46:15,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:46:15,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605022969] [2022-01-19 12:46:15,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605022969] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:46:15,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:46:15,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 12:46:15,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465024955] [2022-01-19 12:46:15,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:46:15,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 12:46:15,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:46:15,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 12:46:15,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 12:46:15,663 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-01-19 12:46:15,664 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 12:46:15,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:46:15,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-01-19 12:46:15,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:46:36,648 INFO L129 PetriNetUnfolder]: 139589/197434 cut-off events. [2022-01-19 12:46:36,649 INFO L130 PetriNetUnfolder]: For 705826/705991 co-relation queries the response was YES. [2022-01-19 12:46:38,268 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 12:46:39,640 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 138 selfloop transitions, 43 changer transitions 2/267 dead transitions. [2022-01-19 12:46:39,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 267 transitions, 1992 flow [2022-01-19 12:46:39,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 12:46:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 12:46:39,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2022-01-19 12:46:39,642 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.727810650887574 [2022-01-19 12:46:39,642 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 738 transitions. [2022-01-19 12:46:39,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions. [2022-01-19 12:46:39,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:46:39,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions. [2022-01-19 12:46:39,644 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 12:46:39,645 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 12:46:39,646 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 12:46:39,646 INFO L186 Difference]: Start difference. First operand has 196 places, 213 transitions, 1252 flow. Second operand 6 states and 738 transitions. [2022-01-19 12:46:39,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 267 transitions, 1992 flow [2022-01-19 12:46:43,346 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 12:46:43,349 INFO L242 Difference]: Finished difference. Result has 201 places, 219 transitions, 1459 flow [2022-01-19 12:46:43,349 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 12:46:43,350 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 50 predicate places. [2022-01-19 12:46:43,350 INFO L470 AbstractCegarLoop]: Abstraction has has 201 places, 219 transitions, 1459 flow [2022-01-19 12:46:43,350 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 12:46:43,350 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:46:43,351 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 12:46:43,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 12:46:43,351 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 12:46:43,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:46:43,351 INFO L85 PathProgramCache]: Analyzing trace with hash 366735110, now seen corresponding path program 1 times [2022-01-19 12:46:43,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:46:43,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919919934] [2022-01-19 12:46:43,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:46:43,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:46:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:46:43,445 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 12:46:43,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:46:43,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919919934] [2022-01-19 12:46:43,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919919934] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 12:46:43,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170172714] [2022-01-19 12:46:43,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:46:43,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 12:46:43,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 12:46:43,451 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 12:46:43,452 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 12:46:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:46:43,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 12:46:43,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 12:46:44,169 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 12:46:44,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 12:46:44,473 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 12:46:44,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170172714] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 12:46:44,473 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 12:46:44,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-01-19 12:46:44,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918507940] [2022-01-19 12:46:44,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 12:46:44,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 12:46:44,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:46:44,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 12:46:44,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-19 12:46:44,475 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2022-01-19 12:46:44,476 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 12:46:44,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:46:44,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2022-01-19 12:46:44,477 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:47:09,399 INFO L129 PetriNetUnfolder]: 161371/244635 cut-off events. [2022-01-19 12:47:09,400 INFO L130 PetriNetUnfolder]: For 905713/923660 co-relation queries the response was YES. [2022-01-19 12:47:11,747 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 12:47:13,250 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 244 selfloop transitions, 43 changer transitions 0/414 dead transitions. [2022-01-19 12:47:13,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 414 transitions, 3385 flow [2022-01-19 12:47:13,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 12:47:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 12:47:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1568 transitions. [2022-01-19 12:47:13,253 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7731755424063116 [2022-01-19 12:47:13,253 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1568 transitions. [2022-01-19 12:47:13,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1568 transitions. [2022-01-19 12:47:13,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:47:13,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1568 transitions. [2022-01-19 12:47:13,257 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 12:47:13,259 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 12:47:13,260 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 12:47:13,260 INFO L186 Difference]: Start difference. First operand has 201 places, 219 transitions, 1459 flow. Second operand 12 states and 1568 transitions. [2022-01-19 12:47:13,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 414 transitions, 3385 flow [2022-01-19 12:47:21,708 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 12:47:21,712 INFO L242 Difference]: Finished difference. Result has 216 places, 233 transitions, 1699 flow [2022-01-19 12:47:21,712 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 12:47:21,712 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 65 predicate places. [2022-01-19 12:47:21,713 INFO L470 AbstractCegarLoop]: Abstraction has has 216 places, 233 transitions, 1699 flow [2022-01-19 12:47:21,713 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 12:47:21,713 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:47:21,713 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 12:47:21,729 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 12:47:21,915 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 12:47:21,915 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 12:47:21,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:47:21,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1381831978, now seen corresponding path program 2 times [2022-01-19 12:47:21,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:47:21,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131329560] [2022-01-19 12:47:21,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:47:21,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:47:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:47:22,219 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 12:47:22,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:47:22,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131329560] [2022-01-19 12:47:22,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131329560] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:47:22,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:47:22,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 12:47:22,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333117708] [2022-01-19 12:47:22,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:47:22,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 12:47:22,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:47:22,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 12:47:22,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 12:47:22,221 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-01-19 12:47:22,222 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 12:47:22,222 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:47:22,222 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-01-19 12:47:22,222 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:47:55,509 INFO L129 PetriNetUnfolder]: 194904/278242 cut-off events. [2022-01-19 12:47:55,509 INFO L130 PetriNetUnfolder]: For 1242647/1242982 co-relation queries the response was YES. [2022-01-19 12:47:57,863 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 12:47:59,597 INFO L132 encePairwiseOnDemand]: 157/169 looper letters, 150 selfloop transitions, 47 changer transitions 4/285 dead transitions. [2022-01-19 12:47:59,597 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 285 transitions, 2467 flow [2022-01-19 12:47:59,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 12:47:59,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 12:47:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2022-01-19 12:47:59,599 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7268244575936884 [2022-01-19 12:47:59,599 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 737 transitions. [2022-01-19 12:47:59,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions. [2022-01-19 12:47:59,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:47:59,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions. [2022-01-19 12:47:59,601 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 12:47:59,603 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 12:47:59,603 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 12:47:59,603 INFO L186 Difference]: Start difference. First operand has 216 places, 233 transitions, 1699 flow. Second operand 6 states and 737 transitions. [2022-01-19 12:47:59,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 285 transitions, 2467 flow [2022-01-19 12:48:30,411 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 12:48:30,414 INFO L242 Difference]: Finished difference. Result has 219 places, 239 transitions, 1866 flow [2022-01-19 12:48:30,415 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 12:48:30,415 INFO L334 CegarLoopForPetriNet]: 151 programPoint places, 68 predicate places. [2022-01-19 12:48:30,415 INFO L470 AbstractCegarLoop]: Abstraction has has 219 places, 239 transitions, 1866 flow [2022-01-19 12:48:30,415 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 12:48:30,416 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:48:30,416 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 12:48:30,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 12:48:30,416 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 12:48:30,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:48:30,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1183357756, now seen corresponding path program 3 times [2022-01-19 12:48:30,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:48:30,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983607925] [2022-01-19 12:48:30,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:48:30,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:48:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:48:30,532 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 12:48:30,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:48:30,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983607925] [2022-01-19 12:48:30,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983607925] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:48:30,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:48:30,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 12:48:30,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629579610] [2022-01-19 12:48:30,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:48:30,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 12:48:30,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:48:30,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 12:48:30,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 12:48:30,535 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2022-01-19 12:48:30,535 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 12:48:30,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:48:30,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2022-01-19 12:48:30,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand