./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 791161d1 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-?-791161d [2022-07-22 21:37:16,809 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:37:16,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:37:16,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:37:16,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:37:16,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:37:16,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:37:16,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:37:16,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:37:16,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:37:16,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:37:16,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:37:16,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:37:16,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:37:16,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:37:16,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:37:16,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:37:16,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:37:16,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:37:16,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:37:16,902 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:37:16,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:37:16,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:37:16,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:37:16,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:37:16,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:37:16,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:37:16,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:37:16,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:37:16,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:37:16,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:37:16,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:37:16,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:37:16,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:37:16,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:37:16,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:37:16,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:37:16,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:37:16,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:37:16,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:37:16,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:37:16,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:37:16,926 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 21:37:16,956 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:37:16,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:37:16,957 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:37:16,957 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:37:16,957 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:37:16,958 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:37:16,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:37:16,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:37:16,958 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:37:16,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:37:16,959 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:37:16,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:37:16,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:37:16,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:37:16,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:37:16,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:37:16,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:37:16,961 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:37:16,961 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:37:16,962 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:37:16,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:37:16,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:37:16,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:37:16,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:37:16,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:37:16,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:37:16,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:37:16,963 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:37:16,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:37:16,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:37:16,964 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:37:16,964 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:37:16,964 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:37:16,965 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-22 21:37:17,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:37:17,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:37:17,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:37:17,228 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:37:17,229 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:37:17,230 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-22 21:37:17,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3cec83a1/0cec3da45f1948de9b5f17f4c7c8806d/FLAGb2fe3e2b8 [2022-07-22 21:37:17,728 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:37:17,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2022-07-22 21:37:17,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3cec83a1/0cec3da45f1948de9b5f17f4c7c8806d/FLAGb2fe3e2b8 [2022-07-22 21:37:18,127 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3cec83a1/0cec3da45f1948de9b5f17f4c7c8806d [2022-07-22 21:37:18,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:37:18,130 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:37:18,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:37:18,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:37:18,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:37:18,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:37:18" (1/1) ... [2022-07-22 21:37:18,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f9fc4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:37:18, skipping insertion in model container [2022-07-22 21:37:18,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:37:18" (1/1) ... [2022-07-22 21:37:18,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:37:18,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:37:18,364 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-22 21:37:18,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:37:18,374 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:37:18,420 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-22 21:37:18,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:37:18,438 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:37:18,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:37:18 WrapperNode [2022-07-22 21:37:18,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:37:18,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:37:18,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:37:18,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:37:18,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:37:18" (1/1) ... [2022-07-22 21:37:18,467 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:37:18" (1/1) ... [2022-07-22 21:37:18,490 INFO L137 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2022-07-22 21:37:18,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:37:18,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:37:18,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:37:18,491 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:37:18,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:37:18" (1/1) ... [2022-07-22 21:37:18,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:37:18" (1/1) ... [2022-07-22 21:37:18,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:37:18" (1/1) ... [2022-07-22 21:37:18,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:37:18" (1/1) ... [2022-07-22 21:37:18,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:37:18" (1/1) ... [2022-07-22 21:37:18,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:37:18" (1/1) ... [2022-07-22 21:37:18,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:37:18" (1/1) ... [2022-07-22 21:37:18,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:37:18,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:37:18,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:37:18,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:37:18,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:37:18" (1/1) ... [2022-07-22 21:37:18,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:37:18,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:37:18,560 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-22 21:37:18,562 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-22 21:37:18,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:37:18,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:37:18,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:37:18,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 21:37:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 21:37:18,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 21:37:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 21:37:18,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 21:37:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 21:37:18,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 21:37:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-07-22 21:37:18,607 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-07-22 21:37:18,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:37:18,607 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-07-22 21:37:18,607 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-07-22 21:37:18,607 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-07-22 21:37:18,607 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-07-22 21:37:18,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:37:18,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:37:18,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:37:18,609 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 21:37:18,740 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:37:18,741 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:37:19,063 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:37:19,071 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:37:19,071 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-22 21:37:19,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:37:19 BoogieIcfgContainer [2022-07-22 21:37:19,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:37:19,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:37:19,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:37:19,080 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:37:19,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:37:18" (1/3) ... [2022-07-22 21:37:19,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f893bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:37:19, skipping insertion in model container [2022-07-22 21:37:19,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:37:18" (2/3) ... [2022-07-22 21:37:19,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f893bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:37:19, skipping insertion in model container [2022-07-22 21:37:19,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:37:19" (3/3) ... [2022-07-22 21:37:19,084 INFO L111 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2022-07-22 21:37:19,089 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:37:19,098 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:37:19,099 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 21:37:19,099 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:37:19,206 INFO L135 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-07-22 21:37:19,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 174 places, 169 transitions, 386 flow [2022-07-22 21:37:19,349 INFO L129 PetriNetUnfolder]: 14/163 cut-off events. [2022-07-22 21:37:19,366 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-22 21:37:19,378 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-22 21:37:19,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 169 transitions, 386 flow [2022-07-22 21:37:19,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 146 transitions, 328 flow [2022-07-22 21:37:19,391 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:37:19,397 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@34645f5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@65ca8fe1 [2022-07-22 21:37:19,398 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-22 21:37:19,425 INFO L129 PetriNetUnfolder]: 14/145 cut-off events. [2022-07-22 21:37:19,425 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-22 21:37:19,425 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:37:19,426 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-22 21:37:19,426 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-22 21:37:19,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:37:19,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1408301095, now seen corresponding path program 1 times [2022-07-22 21:37:19,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:37:19,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743228090] [2022-07-22 21:37:19,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:37:19,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:37:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:37:19,707 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-22 21:37:19,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:37:19,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743228090] [2022-07-22 21:37:19,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743228090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:37:19,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:37:19,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 21:37:19,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109451534] [2022-07-22 21:37:19,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:37:19,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 21:37:19,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:37:19,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 21:37:19,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 21:37:19,748 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 169 [2022-07-22 21:37:19,750 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-22 21:37:19,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:37:19,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 169 [2022-07-22 21:37:19,752 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:37:19,815 INFO L129 PetriNetUnfolder]: 6/138 cut-off events. [2022-07-22 21:37:19,816 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-07-22 21:37:19,817 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-22 21:37:19,819 INFO L132 encePairwiseOnDemand]: 161/169 looper letters, 12 selfloop transitions, 0 changer transitions 2/138 dead transitions. [2022-07-22 21:37:19,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 138 transitions, 336 flow [2022-07-22 21:37:19,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 21:37:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-22 21:37:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 316 transitions. [2022-07-22 21:37:19,832 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9349112426035503 [2022-07-22 21:37:19,832 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 316 transitions. [2022-07-22 21:37:19,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 316 transitions. [2022-07-22 21:37:19,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:37:19,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 316 transitions. [2022-07-22 21:37:19,840 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-22 21:37:19,844 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-22 21:37:19,845 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-22 21:37:19,847 INFO L186 Difference]: Start difference. First operand has 151 places, 146 transitions, 328 flow. Second operand 2 states and 316 transitions. [2022-07-22 21:37:19,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 138 transitions, 336 flow [2022-07-22 21:37:19,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 138 transitions, 312 flow, removed 0 selfloop flow, removed 12 redundant places. [2022-07-22 21:37:19,855 INFO L242 Difference]: Finished difference. Result has 140 places, 136 transitions, 284 flow [2022-07-22 21:37:19,857 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-22 21:37:19,860 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, -11 predicate places. [2022-07-22 21:37:19,860 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 136 transitions, 284 flow [2022-07-22 21:37:19,861 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-22 21:37:19,861 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:37:19,861 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-22 21:37:19,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:37:19,862 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-22 21:37:19,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:37:19,863 INFO L85 PathProgramCache]: Analyzing trace with hash 266842239, now seen corresponding path program 1 times [2022-07-22 21:37:19,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:37:19,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411852895] [2022-07-22 21:37:19,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:37:19,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:37:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:37:20,249 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-22 21:37:20,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:37:20,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411852895] [2022-07-22 21:37:20,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411852895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:37:20,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:37:20,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:37:20,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717753306] [2022-07-22 21:37:20,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:37:20,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:37:20,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:37:20,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:37:20,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:37:20,256 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 169 [2022-07-22 21:37:20,257 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-22 21:37:20,257 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:37:20,258 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 169 [2022-07-22 21:37:20,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:37:20,461 INFO L129 PetriNetUnfolder]: 183/547 cut-off events. [2022-07-22 21:37:20,461 INFO L130 PetriNetUnfolder]: For 16/28 co-relation queries the response was YES. [2022-07-22 21:37:20,465 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-22 21:37:20,478 INFO L132 encePairwiseOnDemand]: 161/169 looper letters, 41 selfloop transitions, 5 changer transitions 4/156 dead transitions. [2022-07-22 21:37:20,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 156 transitions, 435 flow [2022-07-22 21:37:20,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:37:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:37:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 947 transitions. [2022-07-22 21:37:20,486 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8005071851225697 [2022-07-22 21:37:20,486 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 947 transitions. [2022-07-22 21:37:20,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 947 transitions. [2022-07-22 21:37:20,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:37:20,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 947 transitions. [2022-07-22 21:37:20,491 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-22 21:37:20,495 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-22 21:37:20,496 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-22 21:37:20,497 INFO L186 Difference]: Start difference. First operand has 140 places, 136 transitions, 284 flow. Second operand 7 states and 947 transitions. [2022-07-22 21:37:20,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 156 transitions, 435 flow [2022-07-22 21:37:20,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 156 transitions, 435 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-22 21:37:20,505 INFO L242 Difference]: Finished difference. Result has 147 places, 138 transitions, 311 flow [2022-07-22 21:37:20,505 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-22 21:37:20,506 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, -4 predicate places. [2022-07-22 21:37:20,506 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 138 transitions, 311 flow [2022-07-22 21:37:20,507 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-22 21:37:20,507 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:37:20,508 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-22 21:37:20,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 21:37:20,508 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-22 21:37:20,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:37:20,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1701374149, now seen corresponding path program 1 times [2022-07-22 21:37:20,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:37:20,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484879248] [2022-07-22 21:37:20,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:37:20,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:37:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:37:20,955 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-22 21:37:20,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:37:20,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484879248] [2022-07-22 21:37:20,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484879248] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:37:20,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532847565] [2022-07-22 21:37:20,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:37:20,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:37:20,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:37:20,963 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-22 21:37:20,999 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-22 21:37:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:37:21,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 21:37:21,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:37:21,459 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-22 21:37:21,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:37:21,751 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-22 21:37:21,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532847565] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:37:21,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:37:21,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-07-22 21:37:21,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628532843] [2022-07-22 21:37:21,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:37:21,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 21:37:21,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:37:21,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 21:37:21,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-07-22 21:37:21,761 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-07-22 21:37:21,763 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-22 21:37:21,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:37:21,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-07-22 21:37:21,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:37:26,114 INFO L129 PetriNetUnfolder]: 25464/36490 cut-off events. [2022-07-22 21:37:26,116 INFO L130 PetriNetUnfolder]: For 3503/3601 co-relation queries the response was YES. [2022-07-22 21:37:26,242 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-22 21:37:26,444 INFO L132 encePairwiseOnDemand]: 151/169 looper letters, 158 selfloop transitions, 28 changer transitions 10/280 dead transitions. [2022-07-22 21:37:26,444 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 280 transitions, 1049 flow [2022-07-22 21:37:26,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 21:37:26,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-22 21:37:26,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1580 transitions. [2022-07-22 21:37:26,449 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7191624943104233 [2022-07-22 21:37:26,450 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1580 transitions. [2022-07-22 21:37:26,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1580 transitions. [2022-07-22 21:37:26,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:37:26,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1580 transitions. [2022-07-22 21:37:26,455 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-22 21:37:26,459 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-22 21:37:26,460 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-22 21:37:26,461 INFO L186 Difference]: Start difference. First operand has 147 places, 138 transitions, 311 flow. Second operand 13 states and 1580 transitions. [2022-07-22 21:37:26,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 280 transitions, 1049 flow [2022-07-22 21:37:26,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 280 transitions, 1032 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-07-22 21:37:26,468 INFO L242 Difference]: Finished difference. Result has 161 places, 158 transitions, 500 flow [2022-07-22 21:37:26,469 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-22 21:37:26,470 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 10 predicate places. [2022-07-22 21:37:26,470 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 158 transitions, 500 flow [2022-07-22 21:37:26,471 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-22 21:37:26,471 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:37:26,472 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-22 21:37:26,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 21:37:26,687 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-22 21:37:26,688 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-22 21:37:26,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:37:26,688 INFO L85 PathProgramCache]: Analyzing trace with hash 888802973, now seen corresponding path program 2 times [2022-07-22 21:37:26,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:37:26,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342022327] [2022-07-22 21:37:26,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:37:26,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:37:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:37:26,842 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-22 21:37:26,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:37:26,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342022327] [2022-07-22 21:37:26,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342022327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:37:26,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:37:26,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:37:26,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134195998] [2022-07-22 21:37:26,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:37:26,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:37:26,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:37:26,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:37:26,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:37:26,847 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2022-07-22 21:37:26,848 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-22 21:37:26,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:37:26,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2022-07-22 21:37:26,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:37:29,508 INFO L129 PetriNetUnfolder]: 20081/30013 cut-off events. [2022-07-22 21:37:29,509 INFO L130 PetriNetUnfolder]: For 45891/46161 co-relation queries the response was YES. [2022-07-22 21:37:29,656 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-22 21:37:29,835 INFO L132 encePairwiseOnDemand]: 157/169 looper letters, 85 selfloop transitions, 20 changer transitions 6/215 dead transitions. [2022-07-22 21:37:29,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 215 transitions, 931 flow [2022-07-22 21:37:29,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:37:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:37:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 925 transitions. [2022-07-22 21:37:29,839 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7819103972950127 [2022-07-22 21:37:29,839 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 925 transitions. [2022-07-22 21:37:29,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 925 transitions. [2022-07-22 21:37:29,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:37:29,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 925 transitions. [2022-07-22 21:37:29,843 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-22 21:37:29,845 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-22 21:37:29,845 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-22 21:37:29,845 INFO L186 Difference]: Start difference. First operand has 161 places, 158 transitions, 500 flow. Second operand 7 states and 925 transitions. [2022-07-22 21:37:29,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 215 transitions, 931 flow [2022-07-22 21:37:29,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 215 transitions, 908 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-07-22 21:37:29,946 INFO L242 Difference]: Finished difference. Result has 162 places, 163 transitions, 602 flow [2022-07-22 21:37:29,947 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-22 21:37:29,947 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 11 predicate places. [2022-07-22 21:37:29,948 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 163 transitions, 602 flow [2022-07-22 21:37:29,948 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-22 21:37:29,948 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:37:29,949 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-22 21:37:29,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:37:29,949 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-22 21:37:29,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:37:29,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1222625569, now seen corresponding path program 1 times [2022-07-22 21:37:29,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:37:29,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232357673] [2022-07-22 21:37:29,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:37:29,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:37:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:37:30,360 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-22 21:37:30,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:37:30,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232357673] [2022-07-22 21:37:30,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232357673] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:37:30,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:37:30,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:37:30,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564927677] [2022-07-22 21:37:30,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:37:30,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:37:30,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:37:30,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:37:30,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:37:30,364 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-07-22 21:37:30,365 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-22 21:37:30,365 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:37:30,365 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-07-22 21:37:30,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:37:32,962 INFO L129 PetriNetUnfolder]: 21701/32040 cut-off events. [2022-07-22 21:37:32,962 INFO L130 PetriNetUnfolder]: For 73087/73556 co-relation queries the response was YES. [2022-07-22 21:37:33,051 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-22 21:37:33,191 INFO L132 encePairwiseOnDemand]: 157/169 looper letters, 93 selfloop transitions, 18 changer transitions 8/203 dead transitions. [2022-07-22 21:37:33,191 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 203 transitions, 987 flow [2022-07-22 21:37:33,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 21:37:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-22 21:37:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 736 transitions. [2022-07-22 21:37:33,193 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7258382642998028 [2022-07-22 21:37:33,193 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 736 transitions. [2022-07-22 21:37:33,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 736 transitions. [2022-07-22 21:37:33,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:37:33,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 736 transitions. [2022-07-22 21:37:33,196 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-22 21:37:33,197 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-22 21:37:33,198 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-22 21:37:33,198 INFO L186 Difference]: Start difference. First operand has 162 places, 163 transitions, 602 flow. Second operand 6 states and 736 transitions. [2022-07-22 21:37:33,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 203 transitions, 987 flow [2022-07-22 21:37:33,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 203 transitions, 969 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-07-22 21:37:33,278 INFO L242 Difference]: Finished difference. Result has 167 places, 166 transitions, 660 flow [2022-07-22 21:37:33,279 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-22 21:37:33,280 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 16 predicate places. [2022-07-22 21:37:33,280 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 166 transitions, 660 flow [2022-07-22 21:37:33,280 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-22 21:37:33,280 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:37:33,281 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-22 21:37:33,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 21:37:33,281 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-22 21:37:33,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:37:33,282 INFO L85 PathProgramCache]: Analyzing trace with hash 986873925, now seen corresponding path program 2 times [2022-07-22 21:37:33,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:37:33,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393754224] [2022-07-22 21:37:33,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:37:33,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:37:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:37:33,465 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-22 21:37:33,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:37:33,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393754224] [2022-07-22 21:37:33,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393754224] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:37:33,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400956510] [2022-07-22 21:37:33,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 21:37:33,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:37:33,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:37:33,472 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-22 21:37:33,474 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-22 21:37:33,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 21:37:33,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:37:33,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 21:37:33,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:37:34,037 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-22 21:37:34,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 21:37:34,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400956510] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:37:34,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 21:37:34,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-07-22 21:37:34,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097421360] [2022-07-22 21:37:34,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:37:34,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:37:34,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:37:34,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:37:34,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-22 21:37:34,040 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2022-07-22 21:37:34,040 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-22 21:37:34,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:37:34,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2022-07-22 21:37:34,041 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:37:36,237 INFO L129 PetriNetUnfolder]: 14912/21374 cut-off events. [2022-07-22 21:37:36,239 INFO L130 PetriNetUnfolder]: For 27657/37966 co-relation queries the response was YES. [2022-07-22 21:37:36,355 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-22 21:37:36,488 INFO L132 encePairwiseOnDemand]: 158/169 looper letters, 53 selfloop transitions, 19 changer transitions 4/190 dead transitions. [2022-07-22 21:37:36,488 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 190 transitions, 887 flow [2022-07-22 21:37:36,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 21:37:36,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-22 21:37:36,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1009 transitions. [2022-07-22 21:37:36,492 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.746301775147929 [2022-07-22 21:37:36,492 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1009 transitions. [2022-07-22 21:37:36,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1009 transitions. [2022-07-22 21:37:36,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:37:36,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1009 transitions. [2022-07-22 21:37:36,494 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-22 21:37:36,496 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-22 21:37:36,497 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-22 21:37:36,497 INFO L186 Difference]: Start difference. First operand has 167 places, 166 transitions, 660 flow. Second operand 8 states and 1009 transitions. [2022-07-22 21:37:36,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 190 transitions, 887 flow [2022-07-22 21:37:36,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 190 transitions, 866 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-07-22 21:37:36,521 INFO L242 Difference]: Finished difference. Result has 175 places, 170 transitions, 734 flow [2022-07-22 21:37:36,521 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-22 21:37:36,522 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 24 predicate places. [2022-07-22 21:37:36,522 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 170 transitions, 734 flow [2022-07-22 21:37:36,522 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-22 21:37:36,522 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:37:36,523 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-22 21:37:36,540 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-22 21:37:36,723 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-22 21:37:36,723 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-22 21:37:36,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:37:36,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1831519177, now seen corresponding path program 1 times [2022-07-22 21:37:36,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:37:36,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173086515] [2022-07-22 21:37:36,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:37:36,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:37:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:37:36,948 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-22 21:37:36,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:37:36,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173086515] [2022-07-22 21:37:36,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173086515] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:37:36,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:37:36,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:37:36,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118912743] [2022-07-22 21:37:36,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:37:36,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:37:36,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:37:36,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:37:36,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:37:36,951 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2022-07-22 21:37:36,951 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-22 21:37:36,952 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:37:36,952 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2022-07-22 21:37:36,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:37:41,345 INFO L129 PetriNetUnfolder]: 31366/45922 cut-off events. [2022-07-22 21:37:41,346 INFO L130 PetriNetUnfolder]: For 129355/129711 co-relation queries the response was YES. [2022-07-22 21:37:41,573 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-22 21:37:41,822 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 98 selfloop transitions, 27 changer transitions 9/218 dead transitions. [2022-07-22 21:37:41,822 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 218 transitions, 1255 flow [2022-07-22 21:37:41,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 21:37:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-22 21:37:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 739 transitions. [2022-07-22 21:37:41,824 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7287968441814595 [2022-07-22 21:37:41,824 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 739 transitions. [2022-07-22 21:37:41,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 739 transitions. [2022-07-22 21:37:41,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:37:41,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 739 transitions. [2022-07-22 21:37:41,826 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-22 21:37:41,828 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-22 21:37:41,828 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-22 21:37:41,829 INFO L186 Difference]: Start difference. First operand has 175 places, 170 transitions, 734 flow. Second operand 6 states and 739 transitions. [2022-07-22 21:37:41,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 218 transitions, 1255 flow [2022-07-22 21:37:41,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 218 transitions, 1222 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-07-22 21:37:41,955 INFO L242 Difference]: Finished difference. Result has 173 places, 180 transitions, 884 flow [2022-07-22 21:37:41,956 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-22 21:37:41,956 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 22 predicate places. [2022-07-22 21:37:41,956 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 180 transitions, 884 flow [2022-07-22 21:37:41,957 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-22 21:37:41,957 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:37:41,957 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-22 21:37:41,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 21:37:41,957 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-22 21:37:41,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:37:41,958 INFO L85 PathProgramCache]: Analyzing trace with hash -537321145, now seen corresponding path program 2 times [2022-07-22 21:37:41,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:37:41,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972308405] [2022-07-22 21:37:41,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:37:41,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:37:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:37:42,080 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-22 21:37:42,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:37:42,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972308405] [2022-07-22 21:37:42,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972308405] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:37:42,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786373910] [2022-07-22 21:37:42,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 21:37:42,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:37:42,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:37:42,083 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-22 21:37:42,084 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-22 21:37:42,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 21:37:42,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:37:42,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 21:37:42,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:37:42,412 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-22 21:37:42,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 21:37:42,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786373910] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:37:42,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 21:37:42,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2022-07-22 21:37:42,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123148850] [2022-07-22 21:37:42,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:37:42,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:37:42,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:37:42,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:37:42,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-22 21:37:42,415 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 169 [2022-07-22 21:37:42,416 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-22 21:37:42,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:37:42,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 169 [2022-07-22 21:37:42,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:37:42,582 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-22 21:37:42,583 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-07-22 21:37:42,583 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-07-22 21:37:42,583 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-22 21:37:42,583 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-07-22 21:37:42,585 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-22 21:37:42,585 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-07-22 21:37:42,586 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-07-22 21:37:42,586 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-22 21:37:42,586 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-07-22 21:37:42,681 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-22 21:37:42,682 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-07-22 21:37:42,682 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-07-22 21:37:42,682 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-07-22 21:37:42,682 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-07-22 21:37:42,684 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-22 21:37:42,684 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-07-22 21:37:42,684 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-07-22 21:37:42,684 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-07-22 21:37:42,685 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-07-22 21:37:42,915 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-22 21:37:42,915 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-07-22 21:37:42,915 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-07-22 21:37:42,916 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-07-22 21:37:42,916 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-07-22 21:37:42,920 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-22 21:37:42,920 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-07-22 21:37:42,920 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-07-22 21:37:42,920 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-07-22 21:37:42,920 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-07-22 21:37:42,939 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-22 21:37:42,939 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-07-22 21:37:42,939 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-07-22 21:37:42,939 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-22 21:37:42,939 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-22 21:37:42,939 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-22 21:37:42,939 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-07-22 21:37:42,940 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-07-22 21:37:42,940 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-22 21:37:42,940 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-22 21:37:42,940 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-22 21:37:42,940 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-07-22 21:37:42,940 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-07-22 21:37:42,940 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-22 21:37:42,940 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-22 21:37:42,946 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-22 21:37:42,946 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-07-22 21:37:42,946 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-07-22 21:37:42,946 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-22 21:37:42,946 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-22 21:37:42,947 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-22 21:37:42,947 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-07-22 21:37:42,947 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-22 21:37:42,947 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-07-22 21:37:42,947 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-22 21:37:42,948 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-22 21:37:42,948 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-07-22 21:37:42,948 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-22 21:37:42,948 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-22 21:37:42,949 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-07-22 21:37:43,021 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-22 21:37:43,022 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is not cut-off event [2022-07-22 21:37:43,022 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2022-07-22 21:37:43,022 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-07-22 21:37:43,022 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-07-22 21:37:43,046 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-22 21:37:43,047 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is not cut-off event [2022-07-22 21:37:43,047 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-07-22 21:37:43,047 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2022-07-22 21:37:43,047 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-07-22 21:37:43,124 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-22 21:37:43,124 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-07-22 21:37:43,124 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-07-22 21:37:43,124 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-07-22 21:37:43,124 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-07-22 21:37:43,257 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-22 21:37:43,257 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-07-22 21:37:43,257 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-07-22 21:37:43,257 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-07-22 21:37:43,257 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-07-22 21:37:43,302 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-22 21:37:43,302 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-07-22 21:37:43,302 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-22 21:37:43,302 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-22 21:37:43,302 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-07-22 21:37:43,303 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-22 21:37:43,303 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-07-22 21:37:43,303 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-22 21:37:43,303 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-07-22 21:37:43,303 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-22 21:37:43,303 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-22 21:37:43,303 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-07-22 21:37:43,303 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-22 21:37:43,303 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-22 21:37:43,303 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-07-22 21:37:43,376 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-22 21:37:43,376 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is not cut-off event [2022-07-22 21:37:43,376 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2022-07-22 21:37:43,377 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2022-07-22 21:37:43,377 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2022-07-22 21:37:43,411 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-22 21:37:43,411 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-07-22 21:37:43,411 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-07-22 21:37:43,411 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-22 21:37:43,411 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-22 21:37:43,413 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-22 21:37:43,413 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-07-22 21:37:43,413 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-22 21:37:43,413 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-22 21:37:43,413 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-07-22 21:37:43,461 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-22 21:37:43,462 INFO L384 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-07-22 21:37:43,462 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-22 21:37:43,462 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-22 21:37:43,462 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-07-22 21:37:43,465 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-22 21:37:43,465 INFO L384 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-07-22 21:37:43,465 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-22 21:37:43,465 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-22 21:37:43,465 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-07-22 21:37:43,468 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-22 21:37:43,468 INFO L384 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-07-22 21:37:43,468 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-22 21:37:43,468 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-22 21:37:43,468 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-07-22 21:37:43,469 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-22 21:37:43,469 INFO L384 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-07-22 21:37:43,470 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-22 21:37:43,470 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-22 21:37:43,470 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-07-22 21:37:43,754 INFO L129 PetriNetUnfolder]: 6295/10484 cut-off events. [2022-07-22 21:37:43,755 INFO L130 PetriNetUnfolder]: For 23359/135313 co-relation queries the response was YES. [2022-07-22 21:37:43,852 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-22 21:37:43,941 INFO L132 encePairwiseOnDemand]: 160/169 looper letters, 37 selfloop transitions, 19 changer transitions 4/196 dead transitions. [2022-07-22 21:37:43,941 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 196 transitions, 1059 flow [2022-07-22 21:37:43,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 21:37:43,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-22 21:37:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1071 transitions. [2022-07-22 21:37:43,944 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7921597633136095 [2022-07-22 21:37:43,944 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1071 transitions. [2022-07-22 21:37:43,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1071 transitions. [2022-07-22 21:37:43,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:37:43,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1071 transitions. [2022-07-22 21:37:43,947 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-22 21:37:43,949 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-22 21:37:43,950 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-22 21:37:43,950 INFO L186 Difference]: Start difference. First operand has 173 places, 180 transitions, 884 flow. Second operand 8 states and 1071 transitions. [2022-07-22 21:37:43,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 196 transitions, 1059 flow [2022-07-22 21:37:43,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 196 transitions, 1032 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-22 21:37:43,971 INFO L242 Difference]: Finished difference. Result has 181 places, 182 transitions, 940 flow [2022-07-22 21:37:43,971 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-22 21:37:43,972 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 30 predicate places. [2022-07-22 21:37:43,972 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 182 transitions, 940 flow [2022-07-22 21:37:43,973 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-22 21:37:43,973 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:37:43,973 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-22 21:37:43,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-22 21:37:44,175 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-22 21:37:44,175 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-22 21:37:44,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:37:44,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1766440947, now seen corresponding path program 1 times [2022-07-22 21:37:44,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:37:44,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208295551] [2022-07-22 21:37:44,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:37:44,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:37:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:37:44,382 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-22 21:37:44,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:37:44,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208295551] [2022-07-22 21:37:44,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208295551] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:37:44,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:37:44,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:37:44,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916598248] [2022-07-22 21:37:44,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:37:44,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:37:44,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:37:44,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:37:44,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:37:44,385 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2022-07-22 21:37:44,386 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-22 21:37:44,386 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:37:44,386 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2022-07-22 21:37:44,386 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:37:49,434 INFO L129 PetriNetUnfolder]: 38132/58502 cut-off events. [2022-07-22 21:37:49,435 INFO L130 PetriNetUnfolder]: For 173612/177886 co-relation queries the response was YES. [2022-07-22 21:37:50,024 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-22 21:37:50,404 INFO L132 encePairwiseOnDemand]: 156/169 looper letters, 117 selfloop transitions, 44 changer transitions 1/276 dead transitions. [2022-07-22 21:37:50,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 276 transitions, 1971 flow [2022-07-22 21:37:50,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:37:50,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:37:50,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 922 transitions. [2022-07-22 21:37:50,407 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.779374471682164 [2022-07-22 21:37:50,408 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 922 transitions. [2022-07-22 21:37:50,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 922 transitions. [2022-07-22 21:37:50,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:37:50,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 922 transitions. [2022-07-22 21:37:50,411 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-22 21:37:50,413 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-22 21:37:50,413 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-22 21:37:50,414 INFO L186 Difference]: Start difference. First operand has 181 places, 182 transitions, 940 flow. Second operand 7 states and 922 transitions. [2022-07-22 21:37:50,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 276 transitions, 1971 flow [2022-07-22 21:37:50,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 276 transitions, 1928 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-07-22 21:37:50,941 INFO L242 Difference]: Finished difference. Result has 181 places, 203 transitions, 1291 flow [2022-07-22 21:37:50,942 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-22 21:37:50,943 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 30 predicate places. [2022-07-22 21:37:50,943 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 203 transitions, 1291 flow [2022-07-22 21:37:50,943 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-22 21:37:50,943 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:37:50,944 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-22 21:37:50,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 21:37:50,944 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-22 21:37:50,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:37:50,945 INFO L85 PathProgramCache]: Analyzing trace with hash 525625971, now seen corresponding path program 2 times [2022-07-22 21:37:50,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:37:50,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691133581] [2022-07-22 21:37:50,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:37:50,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:37:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:37:51,103 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-22 21:37:51,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:37:51,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691133581] [2022-07-22 21:37:51,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691133581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:37:51,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:37:51,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:37:51,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562214030] [2022-07-22 21:37:51,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:37:51,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:37:51,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:37:51,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:37:51,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:37:51,106 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 169 [2022-07-22 21:37:51,107 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-22 21:37:51,107 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:37:51,107 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 169 [2022-07-22 21:37:51,108 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand