./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c1c24b29e2a448aa58292c6eb9ff7da7a6479c4a0ee37fcfe55a998096eea30 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 08:55:11,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 08:55:11,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 08:55:11,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 08:55:11,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 08:55:11,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 08:55:11,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 08:55:11,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 08:55:11,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 08:55:11,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 08:55:11,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 08:55:11,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 08:55:11,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 08:55:11,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 08:55:11,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 08:55:11,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 08:55:11,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 08:55:11,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 08:55:11,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 08:55:11,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 08:55:11,115 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 08:55:11,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 08:55:11,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 08:55:11,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 08:55:11,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 08:55:11,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 08:55:11,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 08:55:11,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 08:55:11,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 08:55:11,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 08:55:11,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 08:55:11,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 08:55:11,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 08:55:11,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 08:55:11,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 08:55:11,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 08:55:11,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 08:55:11,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 08:55:11,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 08:55:11,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 08:55:11,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 08:55:11,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 08:55:11,140 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 08:55:11,172 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 08:55:11,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 08:55:11,172 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 08:55:11,173 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 08:55:11,173 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 08:55:11,173 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 08:55:11,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 08:55:11,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 08:55:11,174 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 08:55:11,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 08:55:11,175 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 08:55:11,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 08:55:11,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 08:55:11,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 08:55:11,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 08:55:11,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 08:55:11,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 08:55:11,177 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 08:55:11,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 08:55:11,177 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 08:55:11,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 08:55:11,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 08:55:11,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 08:55:11,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 08:55:11,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:55:11,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 08:55:11,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 08:55:11,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 08:55:11,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 08:55:11,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 08:55:11,179 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 08:55:11,179 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 08:55:11,179 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 08:55:11,180 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c1c24b29e2a448aa58292c6eb9ff7da7a6479c4a0ee37fcfe55a998096eea30 [2022-07-21 08:55:11,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 08:55:11,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 08:55:11,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 08:55:11,460 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 08:55:11,460 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 08:55:11,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2022-07-21 08:55:11,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc46be011/40dc5ce14b024244ae971c45f7987852/FLAG62d93c0d1 [2022-07-21 08:55:11,835 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 08:55:11,835 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2022-07-21 08:55:11,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc46be011/40dc5ce14b024244ae971c45f7987852/FLAG62d93c0d1 [2022-07-21 08:55:12,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc46be011/40dc5ce14b024244ae971c45f7987852 [2022-07-21 08:55:12,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 08:55:12,246 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 08:55:12,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 08:55:12,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 08:55:12,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 08:55:12,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:55:12" (1/1) ... [2022-07-21 08:55:12,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2997f217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:55:12, skipping insertion in model container [2022-07-21 08:55:12,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:55:12" (1/1) ... [2022-07-21 08:55:12,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 08:55:12,274 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 08:55:12,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c[2826,2839] [2022-07-21 08:55:12,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:55:12,421 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 08:55:12,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c[2826,2839] [2022-07-21 08:55:12,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:55:12,487 INFO L208 MainTranslator]: Completed translation [2022-07-21 08:55:12,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:55:12 WrapperNode [2022-07-21 08:55:12,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 08:55:12,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 08:55:12,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 08:55:12,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 08:55:12,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:55:12" (1/1) ... [2022-07-21 08:55:12,506 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:55:12" (1/1) ... [2022-07-21 08:55:12,532 INFO L137 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2022-07-21 08:55:12,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 08:55:12,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 08:55:12,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 08:55:12,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 08:55:12,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:55:12" (1/1) ... [2022-07-21 08:55:12,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:55:12" (1/1) ... [2022-07-21 08:55:12,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:55:12" (1/1) ... [2022-07-21 08:55:12,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:55:12" (1/1) ... [2022-07-21 08:55:12,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:55:12" (1/1) ... [2022-07-21 08:55:12,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:55:12" (1/1) ... [2022-07-21 08:55:12,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:55:12" (1/1) ... [2022-07-21 08:55:12,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 08:55:12,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 08:55:12,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 08:55:12,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 08:55:12,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:55:12" (1/1) ... [2022-07-21 08:55:12,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:55:12,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:55:12,606 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-07-21 08:55:12,624 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-07-21 08:55:12,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 08:55:12,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 08:55:12,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 08:55:12,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 08:55:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-21 08:55:12,637 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-21 08:55:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-21 08:55:12,637 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-21 08:55:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-21 08:55:12,637 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-21 08:55:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-07-21 08:55:12,638 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-07-21 08:55:12,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 08:55:12,638 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-07-21 08:55:12,638 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-07-21 08:55:12,638 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-07-21 08:55:12,638 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-07-21 08:55:12,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 08:55:12,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 08:55:12,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 08:55:12,640 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-21 08:55:12,728 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 08:55:12,729 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 08:55:12,978 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 08:55:12,985 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 08:55:12,985 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-21 08:55:12,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:55:12 BoogieIcfgContainer [2022-07-21 08:55:12,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 08:55:12,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 08:55:12,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 08:55:12,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 08:55:12,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:55:12" (1/3) ... [2022-07-21 08:55:13,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2072bdfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:55:13, skipping insertion in model container [2022-07-21 08:55:13,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:55:12" (2/3) ... [2022-07-21 08:55:13,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2072bdfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:55:13, skipping insertion in model container [2022-07-21 08:55:13,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:55:12" (3/3) ... [2022-07-21 08:55:13,002 INFO L111 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2022-07-21 08:55:13,006 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-21 08:55:13,013 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 08:55:13,014 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 08:55:13,014 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-21 08:55:13,110 INFO L135 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-07-21 08:55:13,144 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 174 places, 169 transitions, 386 flow [2022-07-21 08:55:13,206 INFO L129 PetriNetUnfolder]: 14/163 cut-off events. [2022-07-21 08:55:13,206 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-21 08:55:13,212 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 77 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-07-21 08:55:13,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 169 transitions, 386 flow [2022-07-21 08:55:13,216 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 146 transitions, 328 flow [2022-07-21 08:55:13,222 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:55:13,226 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47ac2e7b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c3074a5 [2022-07-21 08:55:13,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-21 08:55:13,257 INFO L129 PetriNetUnfolder]: 14/145 cut-off events. [2022-07-21 08:55:13,257 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-21 08:55:13,258 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:55:13,258 INFO L200 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-07-21 08:55:13,259 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:55:13,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:55:13,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1408301095, now seen corresponding path program 1 times [2022-07-21 08:55:13,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:55:13,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701915068] [2022-07-21 08:55:13,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:55:13,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:55:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:55:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:55:13,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:55:13,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701915068] [2022-07-21 08:55:13,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701915068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:55:13,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:55:13,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 08:55:13,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317391756] [2022-07-21 08:55:13,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:55:13,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 08:55:13,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:55:13,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 08:55:13,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 08:55:13,578 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 169 [2022-07-21 08:55:13,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 146 transitions, 328 flow. Second operand has 2 states, 2 states have (on average 155.0) internal successors, (310), 2 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:13,585 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:55:13,585 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 169 [2022-07-21 08:55:13,586 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:55:13,652 INFO L129 PetriNetUnfolder]: 6/138 cut-off events. [2022-07-21 08:55:13,652 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-07-21 08:55:13,654 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 58 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-07-21 08:55:13,657 INFO L132 encePairwiseOnDemand]: 161/169 looper letters, 12 selfloop transitions, 0 changer transitions 2/138 dead transitions. [2022-07-21 08:55:13,657 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 138 transitions, 336 flow [2022-07-21 08:55:13,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 08:55:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-21 08:55:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 316 transitions. [2022-07-21 08:55:13,676 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9349112426035503 [2022-07-21 08:55:13,676 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 316 transitions. [2022-07-21 08:55:13,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 316 transitions. [2022-07-21 08:55:13,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:55:13,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 316 transitions. [2022-07-21 08:55:13,685 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-07-21 08:55:13,689 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-07-21 08:55:13,689 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-07-21 08:55:13,690 INFO L186 Difference]: Start difference. First operand has 151 places, 146 transitions, 328 flow. Second operand 2 states and 316 transitions. [2022-07-21 08:55:13,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 138 transitions, 336 flow [2022-07-21 08:55:13,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 138 transitions, 312 flow, removed 0 selfloop flow, removed 12 redundant places. [2022-07-21 08:55:13,696 INFO L242 Difference]: Finished difference. Result has 140 places, 136 transitions, 284 flow [2022-07-21 08:55:13,698 INFO L262 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-07-21 08:55:13,700 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, -11 predicate places. [2022-07-21 08:55:13,700 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 136 transitions, 284 flow [2022-07-21 08:55:13,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 155.0) internal successors, (310), 2 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:13,701 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:55:13,701 INFO L200 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-07-21 08:55:13,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 08:55:13,702 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:55:13,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:55:13,702 INFO L85 PathProgramCache]: Analyzing trace with hash 266842239, now seen corresponding path program 1 times [2022-07-21 08:55:13,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:55:13,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780108453] [2022-07-21 08:55:13,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:55:13,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:55:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:55:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:55:14,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:55:14,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780108453] [2022-07-21 08:55:14,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780108453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:55:14,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:55:14,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:55:14,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497650668] [2022-07-21 08:55:14,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:55:14,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:55:14,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:55:14,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:55:14,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:55:14,034 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 169 [2022-07-21 08:55:14,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 136 transitions, 284 flow. Second operand has 7 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:14,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:55:14,035 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 169 [2022-07-21 08:55:14,035 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:55:14,274 INFO L129 PetriNetUnfolder]: 183/547 cut-off events. [2022-07-21 08:55:14,274 INFO L130 PetriNetUnfolder]: For 16/28 co-relation queries the response was YES. [2022-07-21 08:55:14,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 547 events. 183/547 cut-off events. For 16/28 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2063 event pairs, 112 based on Foata normal form. 1/404 useless extension candidates. Maximal degree in co-relation 928. Up to 184 conditions per place. [2022-07-21 08:55:14,282 INFO L132 encePairwiseOnDemand]: 161/169 looper letters, 41 selfloop transitions, 5 changer transitions 4/156 dead transitions. [2022-07-21 08:55:14,283 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 156 transitions, 435 flow [2022-07-21 08:55:14,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 08:55:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 08:55:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 947 transitions. [2022-07-21 08:55:14,287 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8005071851225697 [2022-07-21 08:55:14,287 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 947 transitions. [2022-07-21 08:55:14,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 947 transitions. [2022-07-21 08:55:14,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:55:14,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 947 transitions. [2022-07-21 08:55:14,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.28571428571428) internal successors, (947), 7 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:14,299 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-07-21 08:55:14,300 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-07-21 08:55:14,300 INFO L186 Difference]: Start difference. First operand has 140 places, 136 transitions, 284 flow. Second operand 7 states and 947 transitions. [2022-07-21 08:55:14,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 156 transitions, 435 flow [2022-07-21 08:55:14,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 156 transitions, 435 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-21 08:55:14,307 INFO L242 Difference]: Finished difference. Result has 147 places, 138 transitions, 311 flow [2022-07-21 08:55:14,308 INFO L262 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=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=311, PETRI_PLACES=147, PETRI_TRANSITIONS=138} [2022-07-21 08:55:14,309 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, -4 predicate places. [2022-07-21 08:55:14,309 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 138 transitions, 311 flow [2022-07-21 08:55:14,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:14,309 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:55:14,310 INFO L200 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-07-21 08:55:14,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 08:55:14,310 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:55:14,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:55:14,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1701374149, now seen corresponding path program 1 times [2022-07-21 08:55:14,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:55:14,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916654152] [2022-07-21 08:55:14,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:55:14,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:55:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:55:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:55:14,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:55:14,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916654152] [2022-07-21 08:55:14,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916654152] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:55:14,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089812254] [2022-07-21 08:55:14,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:55:14,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:55:14,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:55:14,688 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-07-21 08:55:14,694 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-07-21 08:55:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:55:14,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 08:55:14,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:55:15,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:55:15,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 08:55:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:55:15,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089812254] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 08:55:15,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 08:55:15,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-07-21 08:55:15,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227260136] [2022-07-21 08:55:15,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 08:55:15,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 08:55:15,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:55:15,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 08:55:15,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-07-21 08:55:15,306 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-07-21 08:55:15,307 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 138 transitions, 311 flow. Second operand has 13 states, 13 states have (on average 110.23076923076923) internal successors, (1433), 13 states have internal predecessors, (1433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:15,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:55:15,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-07-21 08:55:15,308 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:55:18,994 INFO L129 PetriNetUnfolder]: 25464/36490 cut-off events. [2022-07-21 08:55:18,995 INFO L130 PetriNetUnfolder]: For 3503/3601 co-relation queries the response was YES. [2022-07-21 08:55:19,097 INFO L84 FinitePrefix]: Finished finitePrefix Result has 73391 conditions, 36490 events. 25464/36490 cut-off events. For 3503/3601 co-relation queries the response was YES. Maximal size of possible extension queue 1628. Compared 231079 event pairs, 4983 based on Foata normal form. 0/26015 useless extension candidates. Maximal degree in co-relation 73384. Up to 6867 conditions per place. [2022-07-21 08:55:19,374 INFO L132 encePairwiseOnDemand]: 151/169 looper letters, 158 selfloop transitions, 28 changer transitions 10/280 dead transitions. [2022-07-21 08:55:19,374 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 280 transitions, 1049 flow [2022-07-21 08:55:19,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 08:55:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-21 08:55:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1580 transitions. [2022-07-21 08:55:19,378 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7191624943104233 [2022-07-21 08:55:19,378 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1580 transitions. [2022-07-21 08:55:19,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1580 transitions. [2022-07-21 08:55:19,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:55:19,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1580 transitions. [2022-07-21 08:55:19,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 121.53846153846153) internal successors, (1580), 13 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:19,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 169.0) internal successors, (2366), 14 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:19,386 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 169.0) internal successors, (2366), 14 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:19,386 INFO L186 Difference]: Start difference. First operand has 147 places, 138 transitions, 311 flow. Second operand 13 states and 1580 transitions. [2022-07-21 08:55:19,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 280 transitions, 1049 flow [2022-07-21 08:55:19,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 280 transitions, 1032 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-07-21 08:55:19,391 INFO L242 Difference]: Finished difference. Result has 161 places, 158 transitions, 500 flow [2022-07-21 08:55:19,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=500, PETRI_PLACES=161, PETRI_TRANSITIONS=158} [2022-07-21 08:55:19,392 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 10 predicate places. [2022-07-21 08:55:19,393 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 158 transitions, 500 flow [2022-07-21 08:55:19,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 110.23076923076923) internal successors, (1433), 13 states have internal predecessors, (1433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:19,394 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:55:19,394 INFO L200 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-07-21 08:55:19,428 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-07-21 08:55:19,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:55:19,608 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:55:19,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:55:19,609 INFO L85 PathProgramCache]: Analyzing trace with hash 888802973, now seen corresponding path program 2 times [2022-07-21 08:55:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:55:19,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341045016] [2022-07-21 08:55:19,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:55:19,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:55:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:55:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:55:19,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:55:19,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341045016] [2022-07-21 08:55:19,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341045016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:55:19,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:55:19,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:55:19,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482895867] [2022-07-21 08:55:19,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:55:19,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:55:19,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:55:19,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:55:19,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:55:19,747 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2022-07-21 08:55:19,748 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 158 transitions, 500 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-07-21 08:55:19,748 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:55:19,748 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2022-07-21 08:55:19,748 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:55:21,991 INFO L129 PetriNetUnfolder]: 20081/30013 cut-off events. [2022-07-21 08:55:21,992 INFO L130 PetriNetUnfolder]: For 45891/46161 co-relation queries the response was YES. [2022-07-21 08:55:22,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79597 conditions, 30013 events. 20081/30013 cut-off events. For 45891/46161 co-relation queries the response was YES. Maximal size of possible extension queue 1729. Compared 206620 event pairs, 10748 based on Foata normal form. 541/22782 useless extension candidates. Maximal degree in co-relation 79584. Up to 8391 conditions per place. [2022-07-21 08:55:22,415 INFO L132 encePairwiseOnDemand]: 157/169 looper letters, 85 selfloop transitions, 20 changer transitions 6/215 dead transitions. [2022-07-21 08:55:22,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 215 transitions, 931 flow [2022-07-21 08:55:22,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 08:55:22,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 08:55:22,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 925 transitions. [2022-07-21 08:55:22,418 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7819103972950127 [2022-07-21 08:55:22,418 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 925 transitions. [2022-07-21 08:55:22,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 925 transitions. [2022-07-21 08:55:22,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:55:22,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 925 transitions. [2022-07-21 08:55:22,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.14285714285714) internal successors, (925), 7 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:22,422 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-07-21 08:55:22,422 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-07-21 08:55:22,422 INFO L186 Difference]: Start difference. First operand has 161 places, 158 transitions, 500 flow. Second operand 7 states and 925 transitions. [2022-07-21 08:55:22,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 215 transitions, 931 flow [2022-07-21 08:55:22,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 215 transitions, 908 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-07-21 08:55:22,508 INFO L242 Difference]: Finished difference. Result has 162 places, 163 transitions, 602 flow [2022-07-21 08:55:22,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=602, PETRI_PLACES=162, PETRI_TRANSITIONS=163} [2022-07-21 08:55:22,510 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 11 predicate places. [2022-07-21 08:55:22,510 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 163 transitions, 602 flow [2022-07-21 08:55:22,511 INFO L496 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-07-21 08:55:22,511 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:55:22,511 INFO L200 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-07-21 08:55:22,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 08:55:22,512 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:55:22,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:55:22,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1222625569, now seen corresponding path program 1 times [2022-07-21 08:55:22,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:55:22,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208765820] [2022-07-21 08:55:22,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:55:22,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:55:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:55:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:55:22,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:55:22,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208765820] [2022-07-21 08:55:22,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208765820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:55:22,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:55:22,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:55:22,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917033763] [2022-07-21 08:55:22,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:55:22,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:55:22,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:55:22,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:55:22,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:55:22,708 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-07-21 08:55:22,709 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 163 transitions, 602 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-07-21 08:55:22,709 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:55:22,709 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-07-21 08:55:22,709 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:55:25,241 INFO L129 PetriNetUnfolder]: 21701/32040 cut-off events. [2022-07-21 08:55:25,241 INFO L130 PetriNetUnfolder]: For 73087/73556 co-relation queries the response was YES. [2022-07-21 08:55:25,345 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97008 conditions, 32040 events. 21701/32040 cut-off events. For 73087/73556 co-relation queries the response was YES. Maximal size of possible extension queue 1663. Compared 211220 event pairs, 10265 based on Foata normal form. 203/24962 useless extension candidates. Maximal degree in co-relation 96993. Up to 22280 conditions per place. [2022-07-21 08:55:25,470 INFO L132 encePairwiseOnDemand]: 157/169 looper letters, 93 selfloop transitions, 18 changer transitions 8/203 dead transitions. [2022-07-21 08:55:25,471 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 203 transitions, 987 flow [2022-07-21 08:55:25,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 08:55:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-21 08:55:25,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 736 transitions. [2022-07-21 08:55:25,474 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7258382642998028 [2022-07-21 08:55:25,474 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 736 transitions. [2022-07-21 08:55:25,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 736 transitions. [2022-07-21 08:55:25,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:55:25,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 736 transitions. [2022-07-21 08:55:25,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:25,477 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-07-21 08:55:25,478 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-07-21 08:55:25,478 INFO L186 Difference]: Start difference. First operand has 162 places, 163 transitions, 602 flow. Second operand 6 states and 736 transitions. [2022-07-21 08:55:25,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 203 transitions, 987 flow [2022-07-21 08:55:25,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 203 transitions, 969 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-07-21 08:55:25,563 INFO L242 Difference]: Finished difference. Result has 167 places, 166 transitions, 660 flow [2022-07-21 08:55:25,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=660, PETRI_PLACES=167, PETRI_TRANSITIONS=166} [2022-07-21 08:55:25,566 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 16 predicate places. [2022-07-21 08:55:25,566 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 166 transitions, 660 flow [2022-07-21 08:55:25,566 INFO L496 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-07-21 08:55:25,567 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:55:25,567 INFO L200 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-07-21 08:55:25,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 08:55:25,567 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:55:25,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:55:25,568 INFO L85 PathProgramCache]: Analyzing trace with hash 986873925, now seen corresponding path program 2 times [2022-07-21 08:55:25,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:55:25,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434960219] [2022-07-21 08:55:25,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:55:25,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:55:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:55:25,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:55:25,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:55:25,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434960219] [2022-07-21 08:55:25,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434960219] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:55:25,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342789568] [2022-07-21 08:55:25,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 08:55:25,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:55:25,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:55:25,724 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-07-21 08:55:25,725 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-07-21 08:55:25,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 08:55:25,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 08:55:25,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 08:55:25,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:55:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 08:55:26,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:55:26,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342789568] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:55:26,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:55:26,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-07-21 08:55:26,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851037633] [2022-07-21 08:55:26,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:55:26,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:55:26,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:55:26,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:55:26,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-21 08:55:26,164 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2022-07-21 08:55:26,164 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 166 transitions, 660 flow. Second operand has 7 states, 7 states have (on average 122.57142857142857) internal successors, (858), 7 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:26,164 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:55:26,164 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2022-07-21 08:55:26,164 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:55:27,971 INFO L129 PetriNetUnfolder]: 14912/21374 cut-off events. [2022-07-21 08:55:27,971 INFO L130 PetriNetUnfolder]: For 27657/37966 co-relation queries the response was YES. [2022-07-21 08:55:28,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62231 conditions, 21374 events. 14912/21374 cut-off events. For 27657/37966 co-relation queries the response was YES. Maximal size of possible extension queue 1446. Compared 134712 event pairs, 2385 based on Foata normal form. 282/14304 useless extension candidates. Maximal degree in co-relation 62213. Up to 14532 conditions per place. [2022-07-21 08:55:28,200 INFO L132 encePairwiseOnDemand]: 158/169 looper letters, 53 selfloop transitions, 19 changer transitions 4/190 dead transitions. [2022-07-21 08:55:28,201 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 190 transitions, 887 flow [2022-07-21 08:55:28,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 08:55:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-21 08:55:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1009 transitions. [2022-07-21 08:55:28,203 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.746301775147929 [2022-07-21 08:55:28,204 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1009 transitions. [2022-07-21 08:55:28,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1009 transitions. [2022-07-21 08:55:28,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:55:28,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1009 transitions. [2022-07-21 08:55:28,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.125) internal successors, (1009), 8 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:28,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 169.0) internal successors, (1521), 9 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:28,208 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 169.0) internal successors, (1521), 9 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:28,208 INFO L186 Difference]: Start difference. First operand has 167 places, 166 transitions, 660 flow. Second operand 8 states and 1009 transitions. [2022-07-21 08:55:28,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 190 transitions, 887 flow [2022-07-21 08:55:28,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 190 transitions, 866 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-07-21 08:55:28,230 INFO L242 Difference]: Finished difference. Result has 175 places, 170 transitions, 734 flow [2022-07-21 08:55:28,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=734, PETRI_PLACES=175, PETRI_TRANSITIONS=170} [2022-07-21 08:55:28,233 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 24 predicate places. [2022-07-21 08:55:28,233 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 170 transitions, 734 flow [2022-07-21 08:55:28,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.57142857142857) internal successors, (858), 7 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:28,233 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:55:28,233 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:55:28,252 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-07-21 08:55:28,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-21 08:55:28,438 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:55:28,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:55:28,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1831519177, now seen corresponding path program 1 times [2022-07-21 08:55:28,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:55:28,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825491010] [2022-07-21 08:55:28,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:55:28,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:55:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:55:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 08:55:28,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:55:28,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825491010] [2022-07-21 08:55:28,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825491010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:55:28,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:55:28,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:55:28,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044550358] [2022-07-21 08:55:28,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:55:28,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:55:28,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:55:28,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:55:28,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:55:28,755 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-07-21 08:55:28,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 170 transitions, 734 flow. Second operand has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:28,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:55:28,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-07-21 08:55:28,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:55:32,639 INFO L129 PetriNetUnfolder]: 31366/45922 cut-off events. [2022-07-21 08:55:32,640 INFO L130 PetriNetUnfolder]: For 129355/129711 co-relation queries the response was YES. [2022-07-21 08:55:32,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152436 conditions, 45922 events. 31366/45922 cut-off events. For 129355/129711 co-relation queries the response was YES. Maximal size of possible extension queue 2252. Compared 313103 event pairs, 13950 based on Foata normal form. 0/36080 useless extension candidates. Maximal degree in co-relation 152414. Up to 34646 conditions per place. [2022-07-21 08:55:33,032 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 98 selfloop transitions, 27 changer transitions 9/218 dead transitions. [2022-07-21 08:55:33,032 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 218 transitions, 1255 flow [2022-07-21 08:55:33,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 08:55:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-21 08:55:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 739 transitions. [2022-07-21 08:55:33,034 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7287968441814595 [2022-07-21 08:55:33,034 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 739 transitions. [2022-07-21 08:55:33,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 739 transitions. [2022-07-21 08:55:33,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:55:33,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 739 transitions. [2022-07-21 08:55:33,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:33,037 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-07-21 08:55:33,037 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-07-21 08:55:33,037 INFO L186 Difference]: Start difference. First operand has 175 places, 170 transitions, 734 flow. Second operand 6 states and 739 transitions. [2022-07-21 08:55:33,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 218 transitions, 1255 flow [2022-07-21 08:55:33,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 218 transitions, 1222 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-07-21 08:55:33,160 INFO L242 Difference]: Finished difference. Result has 173 places, 180 transitions, 884 flow [2022-07-21 08:55:33,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=884, PETRI_PLACES=173, PETRI_TRANSITIONS=180} [2022-07-21 08:55:33,161 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 22 predicate places. [2022-07-21 08:55:33,161 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 180 transitions, 884 flow [2022-07-21 08:55:33,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:33,161 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:55:33,162 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:55:33,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 08:55:33,162 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:55:33,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:55:33,162 INFO L85 PathProgramCache]: Analyzing trace with hash -537321145, now seen corresponding path program 2 times [2022-07-21 08:55:33,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:55:33,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854776774] [2022-07-21 08:55:33,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:55:33,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:55:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:55:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 08:55:33,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:55:33,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854776774] [2022-07-21 08:55:33,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854776774] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:55:33,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859234599] [2022-07-21 08:55:33,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 08:55:33,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:55:33,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:55:33,275 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-07-21 08:55:33,276 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-07-21 08:55:33,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 08:55:33,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 08:55:33,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 08:55:33,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:55:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 08:55:33,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:55:33,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859234599] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:55:33,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:55:33,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2022-07-21 08:55:33,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241446570] [2022-07-21 08:55:33,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:55:33,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:55:33,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:55:33,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:55:33,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:55:33,527 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 169 [2022-07-21 08:55:33,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 180 transitions, 884 flow. Second operand has 7 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:33,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:55:33,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 169 [2022-07-21 08:55:33,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:55:33,652 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L74-->L73-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][130], [1416#true, 18#L65-1true, Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 14#L50true, Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 86#L107-4true, 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 119#L57-1true, 69#L73-1true, 65#L42true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 971#(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))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-07-21 08:55:33,652 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-07-21 08:55:33,652 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-07-21 08:55:33,652 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-21 08:55:33,652 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-07-21 08:55:33,654 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L74-->L73-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][130], [1416#true, 18#L65-1true, 971#(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))), Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), 86#L107-4true, Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 108#L49-2true, 119#L57-1true, 69#L73-1true, 115#L41-2true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-07-21 08:55:33,654 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-07-21 08:55:33,654 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-07-21 08:55:33,654 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-21 08:55:33,654 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-07-21 08:55:33,721 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L82-->L81-1: Formula: (= (* v_~x6~0_4 2) v_~x6~0_3) InVars {~x6~0=v_~x6~0_4} OutVars{~x6~0=v_~x6~0_3} AuxVars[] AssignedVars[~x6~0][152], [18#L65-1true, Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 118#L108-4true, 119#L57-1true, 69#L73-1true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 1427#true, Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 9#L81-1true, 1416#true, 971#(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))), 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 108#L49-2true, 115#L41-2true, Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))))]) [2022-07-21 08:55:33,722 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-07-21 08:55:33,722 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-07-21 08:55:33,722 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-07-21 08:55:33,722 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-07-21 08:55:33,723 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L82-->L81-1: Formula: (= (* v_~x6~0_4 2) v_~x6~0_3) InVars {~x6~0=v_~x6~0_4} OutVars{~x6~0=v_~x6~0_3} AuxVars[] AssignedVars[~x6~0][152], [18#L65-1true, Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 118#L108-4true, 119#L57-1true, 69#L73-1true, 65#L42true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 971#(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))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 9#L81-1true, 1416#true, 14#L50true, Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))))]) [2022-07-21 08:55:33,723 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-07-21 08:55:33,723 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-07-21 08:55:33,723 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-07-21 08:55:33,723 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-07-21 08:55:33,804 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L74-->L73-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][130], [18#L65-1true, Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 118#L108-4true, 119#L57-1true, 69#L73-1true, 65#L42true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 971#(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))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 9#L81-1true, 1416#true, 14#L50true, Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))))]) [2022-07-21 08:55:33,804 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-07-21 08:55:33,804 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-07-21 08:55:33,804 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-07-21 08:55:33,804 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-07-21 08:55:33,808 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L74-->L73-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][130], [18#L65-1true, Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 118#L108-4true, 119#L57-1true, 69#L73-1true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 9#L81-1true, 1416#true, 971#(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))), 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 108#L49-2true, 115#L41-2true, Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))))]) [2022-07-21 08:55:33,808 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-07-21 08:55:33,808 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-07-21 08:55:33,808 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-07-21 08:55:33,808 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-07-21 08:55:33,911 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L82-->L81-1: Formula: (= (* v_~x6~0_4 2) v_~x6~0_3) InVars {~x6~0=v_~x6~0_4} OutVars{~x6~0=v_~x6~0_3} AuxVars[] AssignedVars[~x6~0][152], [18#L65-1true, Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 118#L108-4true, 119#L57-1true, 65#L42true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 971#(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))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 9#L81-1true, 1416#true, 14#L50true, Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 159#L73-2true, 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))))]) [2022-07-21 08:55:33,912 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-07-21 08:55:33,912 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-07-21 08:55:33,912 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-21 08:55:33,912 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-21 08:55:33,912 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L74-->L73-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][130], [18#L65-1true, Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 118#L108-4true, 119#L57-1true, 69#L73-1true, 65#L42true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 971#(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))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 1416#true, 14#L50true, Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 135#L81-2true]) [2022-07-21 08:55:33,912 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-07-21 08:55:33,912 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-07-21 08:55:33,912 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-21 08:55:33,912 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-21 08:55:33,912 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L74-->L73-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][130], [18#L65-1true, Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 118#L108-4true, 119#L57-1true, 94#L82true, 69#L73-1true, 65#L42true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 971#(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))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 1416#true, 14#L50true, Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))))]) [2022-07-21 08:55:33,912 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-07-21 08:55:33,912 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-07-21 08:55:33,913 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-21 08:55:33,913 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-21 08:55:33,917 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L82-->L81-1: Formula: (= (* v_~x6~0_4 2) v_~x6~0_3) InVars {~x6~0=v_~x6~0_4} OutVars{~x6~0=v_~x6~0_3} AuxVars[] AssignedVars[~x6~0][152], [18#L65-1true, Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 118#L108-4true, 119#L57-1true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 9#L81-1true, 1416#true, 971#(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))), 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 108#L49-2true, 159#L73-2true, 115#L41-2true, Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))))]) [2022-07-21 08:55:33,917 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-07-21 08:55:33,917 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-07-21 08:55:33,917 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-21 08:55:33,917 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-21 08:55:33,917 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L74-->L73-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][130], [18#L65-1true, Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 118#L108-4true, 119#L57-1true, 69#L73-1true, 177#true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 1416#true, 971#(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))), 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 108#L49-2true, 115#L41-2true, Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 135#L81-2true]) [2022-07-21 08:55:33,917 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-07-21 08:55:33,917 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-21 08:55:33,917 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-07-21 08:55:33,917 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-21 08:55:33,918 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L74-->L73-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][130], [18#L65-1true, Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 118#L108-4true, 119#L57-1true, 94#L82true, 69#L73-1true, 177#true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 1427#true, Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 1416#true, 971#(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))), 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 108#L49-2true, 115#L41-2true, Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))))]) [2022-07-21 08:55:33,918 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-07-21 08:55:33,918 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-21 08:55:33,918 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-21 08:55:33,918 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-07-21 08:55:33,974 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L82-->L81-1: Formula: (= (* v_~x6~0_4 2) v_~x6~0_3) InVars {~x6~0=v_~x6~0_4} OutVars{~x6~0=v_~x6~0_3} AuxVars[] AssignedVars[~x6~0][152], [18#L65-1true, Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 118#L108-4true, 119#L57-1true, 65#L42true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 971#(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))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 9#L81-1true, 1416#true, 29#L74true, 14#L50true, Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))))]) [2022-07-21 08:55:33,974 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is not cut-off event [2022-07-21 08:55:33,974 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2022-07-21 08:55:33,974 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-07-21 08:55:33,974 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-07-21 08:55:33,988 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L82-->L81-1: Formula: (= (* v_~x6~0_4 2) v_~x6~0_3) InVars {~x6~0=v_~x6~0_4} OutVars{~x6~0=v_~x6~0_3} AuxVars[] AssignedVars[~x6~0][152], [18#L65-1true, Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 118#L108-4true, 119#L57-1true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 9#L81-1true, 1416#true, 971#(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))), 29#L74true, 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 108#L49-2true, 115#L41-2true, Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)))))]) [2022-07-21 08:55:33,989 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is not cut-off event [2022-07-21 08:55:33,989 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-07-21 08:55:33,989 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2022-07-21 08:55:33,989 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-07-21 08:55:34,040 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L82-->L81-1: Formula: (= (* v_~x6~0_4 2) v_~x6~0_3) InVars {~x6~0=v_~x6~0_4} OutVars{~x6~0=v_~x6~0_3} AuxVars[] AssignedVars[~x6~0][152], [9#L81-1true, 1416#true, 18#L65-1true, Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 971#(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))), 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 108#L49-2true, 119#L57-1true, 150#L109-2true, 69#L73-1true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-07-21 08:55:34,040 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-07-21 08:55:34,040 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-07-21 08:55:34,040 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-07-21 08:55:34,040 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-07-21 08:55:34,148 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L74-->L73-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][130], [9#L81-1true, 1416#true, 18#L65-1true, 971#(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))), Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 108#L49-2true, 119#L57-1true, 150#L109-2true, 69#L73-1true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 1427#true, Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-07-21 08:55:34,149 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-07-21 08:55:34,149 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-07-21 08:55:34,149 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-07-21 08:55:34,149 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-07-21 08:55:34,185 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L82-->L81-1: Formula: (= (* v_~x6~0_4 2) v_~x6~0_3) InVars {~x6~0=v_~x6~0_4} OutVars{~x6~0=v_~x6~0_3} AuxVars[] AssignedVars[~x6~0][152], [9#L81-1true, 1416#true, 18#L65-1true, Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 971#(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))), 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 108#L49-2true, 159#L73-2true, 119#L57-1true, 150#L109-2true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-07-21 08:55:34,185 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-07-21 08:55:34,185 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-21 08:55:34,185 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-21 08:55:34,186 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-07-21 08:55:34,186 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L74-->L73-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][130], [1416#true, 18#L65-1true, 971#(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))), Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 108#L49-2true, 119#L57-1true, 150#L109-2true, 69#L73-1true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 135#L81-2true, Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-07-21 08:55:34,186 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-07-21 08:55:34,186 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-21 08:55:34,186 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-07-21 08:55:34,186 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-21 08:55:34,187 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L74-->L73-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][130], [1416#true, 18#L65-1true, 971#(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))), Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 108#L49-2true, 119#L57-1true, 150#L109-2true, 94#L82true, 69#L73-1true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-07-21 08:55:34,187 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-07-21 08:55:34,187 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-21 08:55:34,187 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-21 08:55:34,187 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-07-21 08:55:34,247 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L82-->L81-1: Formula: (= (* v_~x6~0_4 2) v_~x6~0_3) InVars {~x6~0=v_~x6~0_4} OutVars{~x6~0=v_~x6~0_3} AuxVars[] AssignedVars[~x6~0][152], [9#L81-1true, 1416#true, 18#L65-1true, 971#(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))), Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 29#L74true, 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 108#L49-2true, 119#L57-1true, 150#L109-2true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 197#true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-07-21 08:55:34,247 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is not cut-off event [2022-07-21 08:55:34,247 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2022-07-21 08:55:34,247 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2022-07-21 08:55:34,247 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2022-07-21 08:55:34,277 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L74-->L73-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][130], [9#L81-1true, 1416#true, 18#L65-1true, 971#(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))), Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 119#L57-1true, 69#L73-1true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 197#true, 45#L110-2true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-07-21 08:55:34,277 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-07-21 08:55:34,277 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-07-21 08:55:34,277 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-21 08:55:34,277 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-21 08:55:34,278 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L82-->L81-1: Formula: (= (* v_~x6~0_4 2) v_~x6~0_3) InVars {~x6~0=v_~x6~0_4} OutVars{~x6~0=v_~x6~0_3} AuxVars[] AssignedVars[~x6~0][152], [9#L81-1true, 1416#true, 18#L65-1true, Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 971#(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))), 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 119#L57-1true, 69#L73-1true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 197#true, 45#L110-2true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-07-21 08:55:34,279 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-07-21 08:55:34,279 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-21 08:55:34,279 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-21 08:55:34,279 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-07-21 08:55:34,317 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L82-->L81-1: Formula: (= (* v_~x6~0_4 2) v_~x6~0_3) InVars {~x6~0=v_~x6~0_4} OutVars{~x6~0=v_~x6~0_3} AuxVars[] AssignedVars[~x6~0][152], [9#L81-1true, 1416#true, 18#L65-1true, 971#(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))), Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 159#L73-2true, 119#L57-1true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 1427#true, Black: 197#true, 45#L110-2true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-07-21 08:55:34,317 INFO L384 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-07-21 08:55:34,317 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-21 08:55:34,317 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-21 08:55:34,317 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-07-21 08:55:34,319 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L74-->L73-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][130], [1416#true, 18#L65-1true, Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 971#(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))), 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 119#L57-1true, 69#L73-1true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, 135#L81-2true, Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 197#true, 45#L110-2true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-07-21 08:55:34,319 INFO L384 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-07-21 08:55:34,319 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-21 08:55:34,319 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-21 08:55:34,319 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-07-21 08:55:34,320 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L74-->L73-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][130], [1416#true, 18#L65-1true, 971#(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))), Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 119#L57-1true, 94#L82true, 69#L73-1true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 197#true, 45#L110-2true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-07-21 08:55:34,320 INFO L384 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-07-21 08:55:34,320 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-21 08:55:34,320 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-21 08:55:34,320 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-07-21 08:55:34,321 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L82-->L81-1: Formula: (= (* v_~x6~0_4 2) v_~x6~0_3) InVars {~x6~0=v_~x6~0_4} OutVars{~x6~0=v_~x6~0_3} AuxVars[] AssignedVars[~x6~0][152], [9#L81-1true, 1416#true, 18#L65-1true, Black: 1404#(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)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~x6~0 4294967296) (mod ~x5~0 4294967296))), 971#(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))), 29#L74true, 995#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 993#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 992#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 119#L57-1true, Black: 1421#(and (<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (- 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)))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), 177#true, Black: 1420#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1007#(and (= (+ (* (div ~x6~0 4294967296) 4294967296) ~x5~0) (+ ~x6~0 (* 4294967296 (div ~x5~0 4294967296)))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 1008#(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)))) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))) (= (+ (* (div ~x2~0 4294967296) (- 4294967296)) ~x2~0) (+ ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296))))), Black: 967#(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)))) (= (+ ~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)) (= (+ (* (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)))), Black: 965#(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)))) (= (+ ~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)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 203#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 1427#true, Black: 973#(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)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 197#true, 45#L110-2true, Black: 969#(and (<= (div (+ (mod ~x1~0 4294967296) (* (- 1) ~x2~0)) (- 4294967296)) (div ~x2~0 4294967296)) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-07-21 08:55:34,321 INFO L384 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-07-21 08:55:34,321 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-21 08:55:34,321 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-21 08:55:34,321 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-07-21 08:55:34,551 INFO L129 PetriNetUnfolder]: 6295/10484 cut-off events. [2022-07-21 08:55:34,551 INFO L130 PetriNetUnfolder]: For 23359/135313 co-relation queries the response was YES. [2022-07-21 08:55:34,631 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34522 conditions, 10484 events. 6295/10484 cut-off events. For 23359/135313 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 73954 event pairs, 993 based on Foata normal form. 189/7393 useless extension candidates. Maximal degree in co-relation 34501. Up to 5114 conditions per place. [2022-07-21 08:55:34,812 INFO L132 encePairwiseOnDemand]: 160/169 looper letters, 37 selfloop transitions, 19 changer transitions 4/196 dead transitions. [2022-07-21 08:55:34,812 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 196 transitions, 1059 flow [2022-07-21 08:55:34,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 08:55:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-21 08:55:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1071 transitions. [2022-07-21 08:55:34,814 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7921597633136095 [2022-07-21 08:55:34,814 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1071 transitions. [2022-07-21 08:55:34,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1071 transitions. [2022-07-21 08:55:34,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:55:34,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1071 transitions. [2022-07-21 08:55:34,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 133.875) internal successors, (1071), 8 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:34,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 169.0) internal successors, (1521), 9 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:34,820 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 169.0) internal successors, (1521), 9 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:34,820 INFO L186 Difference]: Start difference. First operand has 173 places, 180 transitions, 884 flow. Second operand 8 states and 1071 transitions. [2022-07-21 08:55:34,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 196 transitions, 1059 flow [2022-07-21 08:55:34,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 196 transitions, 1032 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-21 08:55:34,835 INFO L242 Difference]: Finished difference. Result has 181 places, 182 transitions, 940 flow [2022-07-21 08:55:34,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=940, PETRI_PLACES=181, PETRI_TRANSITIONS=182} [2022-07-21 08:55:34,837 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 30 predicate places. [2022-07-21 08:55:34,838 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 182 transitions, 940 flow [2022-07-21 08:55:34,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:34,838 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:55:34,838 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:55:34,855 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-07-21 08:55:35,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:55:35,054 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:55:35,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:55:35,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1766440947, now seen corresponding path program 1 times [2022-07-21 08:55:35,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:55:35,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548636415] [2022-07-21 08:55:35,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:55:35,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:55:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:55:35,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 08:55:35,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:55:35,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548636415] [2022-07-21 08:55:35,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548636415] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:55:35,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:55:35,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:55:35,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004932830] [2022-07-21 08:55:35,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:55:35,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:55:35,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:55:35,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:55:35,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:55:35,192 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2022-07-21 08:55:35,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 182 transitions, 940 flow. Second operand has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:35,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:55:35,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2022-07-21 08:55:35,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:55:40,304 INFO L129 PetriNetUnfolder]: 38132/58502 cut-off events. [2022-07-21 08:55:40,305 INFO L130 PetriNetUnfolder]: For 173612/177886 co-relation queries the response was YES. [2022-07-21 08:55:40,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 197359 conditions, 58502 events. 38132/58502 cut-off events. For 173612/177886 co-relation queries the response was YES. Maximal size of possible extension queue 3611. Compared 474168 event pairs, 8472 based on Foata normal form. 1763/53711 useless extension candidates. Maximal degree in co-relation 197334. Up to 14668 conditions per place. [2022-07-21 08:55:41,227 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 117 selfloop transitions, 44 changer transitions 1/276 dead transitions. [2022-07-21 08:55:41,228 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 276 transitions, 1971 flow [2022-07-21 08:55:41,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 08:55:41,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 08:55:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 922 transitions. [2022-07-21 08:55:41,232 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.779374471682164 [2022-07-21 08:55:41,232 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 922 transitions. [2022-07-21 08:55:41,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 922 transitions. [2022-07-21 08:55:41,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:55:41,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 922 transitions. [2022-07-21 08:55:41,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:41,236 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-07-21 08:55:41,237 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-07-21 08:55:41,237 INFO L186 Difference]: Start difference. First operand has 181 places, 182 transitions, 940 flow. Second operand 7 states and 922 transitions. [2022-07-21 08:55:41,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 276 transitions, 1971 flow [2022-07-21 08:55:41,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 276 transitions, 1928 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-07-21 08:55:41,544 INFO L242 Difference]: Finished difference. Result has 181 places, 203 transitions, 1291 flow [2022-07-21 08:55:41,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1291, PETRI_PLACES=181, PETRI_TRANSITIONS=203} [2022-07-21 08:55:41,545 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 30 predicate places. [2022-07-21 08:55:41,545 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 203 transitions, 1291 flow [2022-07-21 08:55:41,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:41,546 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:55:41,546 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:55:41,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 08:55:41,546 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:55:41,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:55:41,546 INFO L85 PathProgramCache]: Analyzing trace with hash 525625971, now seen corresponding path program 2 times [2022-07-21 08:55:41,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:55:41,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168877878] [2022-07-21 08:55:41,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:55:41,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:55:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:55:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 08:55:41,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:55:41,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168877878] [2022-07-21 08:55:41,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168877878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:55:41,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:55:41,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:55:41,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515125455] [2022-07-21 08:55:41,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:55:41,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:55:41,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:55:41,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:55:41,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:55:41,634 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2022-07-21 08:55:41,635 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 203 transitions, 1291 flow. Second operand has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:41,635 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:55:41,635 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2022-07-21 08:55:41,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:55:47,681 INFO L129 PetriNetUnfolder]: 39822/64040 cut-off events. [2022-07-21 08:55:47,681 INFO L130 PetriNetUnfolder]: For 225382/229626 co-relation queries the response was YES. [2022-07-21 08:55:48,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 226406 conditions, 64040 events. 39822/64040 cut-off events. For 225382/229626 co-relation queries the response was YES. Maximal size of possible extension queue 3731. Compared 553383 event pairs, 9926 based on Foata normal form. 3462/65005 useless extension candidates. Maximal degree in co-relation 226381. Up to 14554 conditions per place. [2022-07-21 08:55:48,458 INFO L132 encePairwiseOnDemand]: 158/169 looper letters, 121 selfloop transitions, 38 changer transitions 2/275 dead transitions. [2022-07-21 08:55:48,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 275 transitions, 2011 flow [2022-07-21 08:55:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 08:55:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 08:55:48,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 922 transitions. [2022-07-21 08:55:48,460 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.779374471682164 [2022-07-21 08:55:48,460 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 922 transitions. [2022-07-21 08:55:48,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 922 transitions. [2022-07-21 08:55:48,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:55:48,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 922 transitions. [2022-07-21 08:55:48,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:48,464 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-07-21 08:55:48,465 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-07-21 08:55:48,465 INFO L186 Difference]: Start difference. First operand has 181 places, 203 transitions, 1291 flow. Second operand 7 states and 922 transitions. [2022-07-21 08:55:48,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 275 transitions, 2011 flow [2022-07-21 08:55:48,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 275 transitions, 2007 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-21 08:55:48,780 INFO L242 Difference]: Finished difference. Result has 189 places, 202 transitions, 1372 flow [2022-07-21 08:55:48,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1372, PETRI_PLACES=189, PETRI_TRANSITIONS=202} [2022-07-21 08:55:48,780 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 38 predicate places. [2022-07-21 08:55:48,781 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 202 transitions, 1372 flow [2022-07-21 08:55:48,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:48,781 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:55:48,781 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:55:48,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 08:55:48,781 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:55:48,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:55:48,782 INFO L85 PathProgramCache]: Analyzing trace with hash -116605427, now seen corresponding path program 1 times [2022-07-21 08:55:48,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:55:48,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49944970] [2022-07-21 08:55:48,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:55:48,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:55:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:55:48,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 08:55:48,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:55:48,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49944970] [2022-07-21 08:55:48,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49944970] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:55:48,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122070022] [2022-07-21 08:55:48,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:55:48,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:55:48,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:55:48,939 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:55:48,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 08:55:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:55:49,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 08:55:49,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:55:49,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 08:55:49,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 08:55:49,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 08:55:49,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122070022] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 08:55:49,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 08:55:49,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-07-21 08:55:49,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643630899] [2022-07-21 08:55:49,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 08:55:49,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 08:55:49,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:55:49,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 08:55:49,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-07-21 08:55:49,417 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-07-21 08:55:49,418 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 202 transitions, 1372 flow. Second operand has 13 states, 13 states have (on average 111.46153846153847) internal successors, (1449), 13 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:55:49,418 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:55:49,418 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-07-21 08:55:49,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand