./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/bench-exp2x9.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/bench-exp2x9.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc --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 d6a1dd92aa2998cfb1326128fd549d301e029b328accb048c4d2ec692e416e63 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:46:29,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:46:29,079 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:46:29,136 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:46:29,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:46:29,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:46:29,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:46:29,149 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:46:29,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:46:29,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:46:29,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:46:29,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:46:29,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:46:29,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:46:29,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:46:29,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:46:29,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:46:29,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:46:29,170 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:46:29,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:46:29,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:46:29,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:46:29,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:46:29,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:46:29,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:46:29,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:46:29,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:46:29,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:46:29,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:46:29,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:46:29,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:46:29,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:46:29,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:46:29,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:46:29,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:46:29,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:46:29,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:46:29,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:46:29,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:46:29,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:46:29,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:46:29,219 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:46:29,275 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:46:29,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:46:29,276 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:46:29,277 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:46:29,278 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:46:29,278 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:46:29,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:46:29,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:46:29,279 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:46:29,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:46:29,281 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:46:29,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:46:29,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:46:29,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:46:29,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:46:29,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:46:29,282 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:46:29,283 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:46:29,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:46:29,283 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:46:29,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:46:29,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:46:29,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:46:29,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:46:29,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:46:29,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:46:29,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:46:29,287 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:46:29,287 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:46:29,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:46:29,287 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:46:29,288 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:46:29,288 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:46:29,288 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc 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 -> d6a1dd92aa2998cfb1326128fd549d301e029b328accb048c4d2ec692e416e63 [2022-11-02 20:46:29,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:46:29,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:46:29,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:46:29,632 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:46:29,633 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:46:29,635 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2022-11-02 20:46:29,727 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/data/5a152d800/6235a435b7d04c99b1c10f66fd4680a9/FLAG2f676791f [2022-11-02 20:46:30,411 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:46:30,412 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2022-11-02 20:46:30,420 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/data/5a152d800/6235a435b7d04c99b1c10f66fd4680a9/FLAG2f676791f [2022-11-02 20:46:30,711 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/data/5a152d800/6235a435b7d04c99b1c10f66fd4680a9 [2022-11-02 20:46:30,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:46:30,715 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:46:30,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:46:30,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:46:30,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:46:30,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:46:30" (1/1) ... [2022-11-02 20:46:30,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@452e7216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:30, skipping insertion in model container [2022-11-02 20:46:30,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:46:30" (1/1) ... [2022-11-02 20:46:30,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:46:30,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:46:31,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c[2669,2682] [2022-11-02 20:46:31,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:46:31,017 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:46:31,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c[2669,2682] [2022-11-02 20:46:31,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:46:31,067 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:46:31,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31 WrapperNode [2022-11-02 20:46:31,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:46:31,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:46:31,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:46:31,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:46:31,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,100 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,140 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-11-02 20:46:31,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:46:31,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:46:31,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:46:31,142 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:46:31,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,169 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:46:31,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:46:31,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:46:31,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:46:31,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:46:31,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:31,213 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:46:31,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:46:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:46:31,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:46:31,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:46:31,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:46:31,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:46:31,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:46:31,256 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:46:31,256 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-02 20:46:31,256 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-02 20:46:31,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:46:31,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:46:31,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:46:31,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:46:31,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:46:31,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:46:31,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:46:31,259 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:46:31,381 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:46:31,384 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:46:31,769 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:46:31,783 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:46:31,786 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:46:31,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:46:31 BoogieIcfgContainer [2022-11-02 20:46:31,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:46:31,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:46:31,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:46:31,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:46:31,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:46:30" (1/3) ... [2022-11-02 20:46:31,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25409d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:46:31, skipping insertion in model container [2022-11-02 20:46:31,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (2/3) ... [2022-11-02 20:46:31,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25409d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:46:31, skipping insertion in model container [2022-11-02 20:46:31,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:46:31" (3/3) ... [2022-11-02 20:46:31,800 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2022-11-02 20:46:31,809 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:46:31,840 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:46:31,840 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:46:31,840 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:46:32,000 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-02 20:46:32,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 149 transitions, 330 flow [2022-11-02 20:46:32,209 INFO L130 PetriNetUnfolder]: 10/145 cut-off events. [2022-11-02 20:46:32,215 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:46:32,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 145 events. 10/145 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 132 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-11-02 20:46:32,220 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 149 transitions, 330 flow [2022-11-02 20:46:32,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 132 transitions, 288 flow [2022-11-02 20:46:32,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:46:32,247 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5d1fd124, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:46:32,247 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-02 20:46:32,292 INFO L130 PetriNetUnfolder]: 10/131 cut-off events. [2022-11-02 20:46:32,292 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:46:32,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:46:32,293 INFO L208 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] [2022-11-02 20:46:32,294 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 2 more)] === [2022-11-02 20:46:32,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:32,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1375460124, now seen corresponding path program 1 times [2022-11-02 20:46:32,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:32,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137176253] [2022-11-02 20:46:32,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:32,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:32,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:32,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:32,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137176253] [2022-11-02 20:46:32,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137176253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:32,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:32,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:46:32,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292263798] [2022-11-02 20:46:32,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:32,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:46:32,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:32,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:46:32,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:46:32,703 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 149 [2022-11-02 20:46:32,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 132 transitions, 288 flow. Second operand has 2 states, 2 states have (on average 138.5) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:32,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:46:32,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 149 [2022-11-02 20:46:32,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:46:32,837 INFO L130 PetriNetUnfolder]: 4/126 cut-off events. [2022-11-02 20:46:32,837 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-02 20:46:32,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 126 events. 4/126 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 126 event pairs, 0 based on Foata normal form. 18/138 useless extension candidates. Maximal degree in co-relation 101. Up to 9 conditions per place. [2022-11-02 20:46:32,841 INFO L137 encePairwiseOnDemand]: 143/149 looper letters, 8 selfloop transitions, 0 changer transitions 2/126 dead transitions. [2022-11-02 20:46:32,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 126 transitions, 292 flow [2022-11-02 20:46:32,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:46:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 20:46:32,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 282 transitions. [2022-11-02 20:46:32,860 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9463087248322147 [2022-11-02 20:46:32,861 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 282 transitions. [2022-11-02 20:46:32,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 282 transitions. [2022-11-02 20:46:32,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:46:32,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 282 transitions. [2022-11-02 20:46:32,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 141.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:32,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:32,879 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:32,882 INFO L175 Difference]: Start difference. First operand has 135 places, 132 transitions, 288 flow. Second operand 2 states and 282 transitions. [2022-11-02 20:46:32,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 126 transitions, 292 flow [2022-11-02 20:46:32,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 126 transitions, 276 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-02 20:46:32,892 INFO L231 Difference]: Finished difference. Result has 128 places, 124 transitions, 256 flow [2022-11-02 20:46:32,894 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=256, PETRI_PLACES=128, PETRI_TRANSITIONS=124} [2022-11-02 20:46:32,899 INFO L287 CegarLoopForPetriNet]: 135 programPoint places, -7 predicate places. [2022-11-02 20:46:32,899 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 124 transitions, 256 flow [2022-11-02 20:46:32,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 138.5) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:32,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:46:32,900 INFO L208 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] [2022-11-02 20:46:32,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:46:32,901 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 2 more)] === [2022-11-02 20:46:32,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:32,902 INFO L85 PathProgramCache]: Analyzing trace with hash 735830245, now seen corresponding path program 1 times [2022-11-02 20:46:32,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:32,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354394401] [2022-11-02 20:46:32,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:32,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:34,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:34,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354394401] [2022-11-02 20:46:34,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354394401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:34,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:34,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:46:34,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386103360] [2022-11-02 20:46:34,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:34,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:46:34,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:34,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:46:34,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:46:34,351 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 149 [2022-11-02 20:46:34,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 124 transitions, 256 flow. Second operand has 7 states, 7 states have (on average 84.0) internal successors, (588), 7 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:34,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:46:34,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 149 [2022-11-02 20:46:34,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:46:40,555 INFO L130 PetriNetUnfolder]: 24847/33450 cut-off events. [2022-11-02 20:46:40,555 INFO L131 PetriNetUnfolder]: For 860/934 co-relation queries the response was YES. [2022-11-02 20:46:40,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67538 conditions, 33450 events. 24847/33450 cut-off events. For 860/934 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 187388 event pairs, 11708 based on Foata normal form. 1/29664 useless extension candidates. Maximal degree in co-relation 67535. Up to 32788 conditions per place. [2022-11-02 20:46:40,826 INFO L137 encePairwiseOnDemand]: 139/149 looper letters, 71 selfloop transitions, 7 changer transitions 4/146 dead transitions. [2022-11-02 20:46:40,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 146 transitions, 471 flow [2022-11-02 20:46:40,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:46:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:46:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 643 transitions. [2022-11-02 20:46:40,830 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6164908916586769 [2022-11-02 20:46:40,831 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 643 transitions. [2022-11-02 20:46:40,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 643 transitions. [2022-11-02 20:46:40,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:46:40,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 643 transitions. [2022-11-02 20:46:40,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:40,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:40,839 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:40,839 INFO L175 Difference]: Start difference. First operand has 128 places, 124 transitions, 256 flow. Second operand 7 states and 643 transitions. [2022-11-02 20:46:40,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 146 transitions, 471 flow [2022-11-02 20:46:40,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 146 transitions, 471 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:46:40,843 INFO L231 Difference]: Finished difference. Result has 135 places, 128 transitions, 297 flow [2022-11-02 20:46:40,844 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=297, PETRI_PLACES=135, PETRI_TRANSITIONS=128} [2022-11-02 20:46:40,845 INFO L287 CegarLoopForPetriNet]: 135 programPoint places, 0 predicate places. [2022-11-02 20:46:40,845 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 128 transitions, 297 flow [2022-11-02 20:46:40,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.0) internal successors, (588), 7 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:40,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:46:40,846 INFO L208 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] [2022-11-02 20:46:40,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:46:40,846 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 2 more)] === [2022-11-02 20:46:40,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:40,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1042539278, now seen corresponding path program 1 times [2022-11-02 20:46:40,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:40,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655138043] [2022-11-02 20:46:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:40,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:41,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:41,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655138043] [2022-11-02 20:46:41,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655138043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:41,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:41,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:46:41,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881330133] [2022-11-02 20:46:41,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:41,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:46:41,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:41,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:46:41,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:46:41,517 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 149 [2022-11-02 20:46:41,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 128 transitions, 297 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:41,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:46:41,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 149 [2022-11-02 20:46:41,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:46:42,736 INFO L130 PetriNetUnfolder]: 5400/8562 cut-off events. [2022-11-02 20:46:42,736 INFO L131 PetriNetUnfolder]: For 901/970 co-relation queries the response was YES. [2022-11-02 20:46:42,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17068 conditions, 8562 events. 5400/8562 cut-off events. For 901/970 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 54785 event pairs, 892 based on Foata normal form. 4/6503 useless extension candidates. Maximal degree in co-relation 17061. Up to 5921 conditions per place. [2022-11-02 20:46:42,823 INFO L137 encePairwiseOnDemand]: 136/149 looper letters, 76 selfloop transitions, 19 changer transitions 0/177 dead transitions. [2022-11-02 20:46:42,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 177 transitions, 618 flow [2022-11-02 20:46:42,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:46:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:46:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 764 transitions. [2022-11-02 20:46:42,826 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7325023969319271 [2022-11-02 20:46:42,827 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 764 transitions. [2022-11-02 20:46:42,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 764 transitions. [2022-11-02 20:46:42,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:46:42,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 764 transitions. [2022-11-02 20:46:42,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:42,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:42,833 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:42,834 INFO L175 Difference]: Start difference. First operand has 135 places, 128 transitions, 297 flow. Second operand 7 states and 764 transitions. [2022-11-02 20:46:42,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 177 transitions, 618 flow [2022-11-02 20:46:42,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 177 transitions, 599 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-11-02 20:46:42,840 INFO L231 Difference]: Finished difference. Result has 137 places, 138 transitions, 390 flow [2022-11-02 20:46:42,840 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=390, PETRI_PLACES=137, PETRI_TRANSITIONS=138} [2022-11-02 20:46:42,841 INFO L287 CegarLoopForPetriNet]: 135 programPoint places, 2 predicate places. [2022-11-02 20:46:42,841 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 138 transitions, 390 flow [2022-11-02 20:46:42,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:42,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:46:42,843 INFO L208 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] [2022-11-02 20:46:42,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:46:42,843 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 2 more)] === [2022-11-02 20:46:42,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:42,844 INFO L85 PathProgramCache]: Analyzing trace with hash 767675744, now seen corresponding path program 1 times [2022-11-02 20:46:42,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:42,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972802879] [2022-11-02 20:46:42,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:42,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:43,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:43,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972802879] [2022-11-02 20:46:43,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972802879] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:43,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366139193] [2022-11-02 20:46:43,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:43,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:43,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:43,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:43,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:46:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:43,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:46:43,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:44,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:44,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:46:44,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:44,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366139193] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:46:44,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:46:44,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-11-02 20:46:44,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278484967] [2022-11-02 20:46:44,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:46:44,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:46:44,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:44,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:46:44,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:46:44,435 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 149 [2022-11-02 20:46:44,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 138 transitions, 390 flow. Second operand has 14 states, 14 states have (on average 82.78571428571429) internal successors, (1159), 14 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:44,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:46:44,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 149 [2022-11-02 20:46:44,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:46:54,282 INFO L130 PetriNetUnfolder]: 39810/59465 cut-off events. [2022-11-02 20:46:54,282 INFO L131 PetriNetUnfolder]: For 24175/24197 co-relation queries the response was YES. [2022-11-02 20:46:54,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136106 conditions, 59465 events. 39810/59465 cut-off events. For 24175/24197 co-relation queries the response was YES. Maximal size of possible extension queue 2161. Compared 437017 event pairs, 16643 based on Foata normal form. 0/56183 useless extension candidates. Maximal degree in co-relation 136098. Up to 34314 conditions per place. [2022-11-02 20:46:54,942 INFO L137 encePairwiseOnDemand]: 134/149 looper letters, 283 selfloop transitions, 30 changer transitions 1/376 dead transitions. [2022-11-02 20:46:54,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 376 transitions, 1872 flow [2022-11-02 20:46:54,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:46:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-02 20:46:54,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1360 transitions. [2022-11-02 20:46:54,948 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6519654841802492 [2022-11-02 20:46:54,948 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1360 transitions. [2022-11-02 20:46:54,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1360 transitions. [2022-11-02 20:46:54,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:46:54,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1360 transitions. [2022-11-02 20:46:54,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 97.14285714285714) internal successors, (1360), 14 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:54,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 149.0) internal successors, (2235), 15 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:54,962 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 149.0) internal successors, (2235), 15 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:54,963 INFO L175 Difference]: Start difference. First operand has 137 places, 138 transitions, 390 flow. Second operand 14 states and 1360 transitions. [2022-11-02 20:46:54,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 376 transitions, 1872 flow [2022-11-02 20:46:54,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 376 transitions, 1868 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:46:54,994 INFO L231 Difference]: Finished difference. Result has 157 places, 156 transitions, 597 flow [2022-11-02 20:46:54,994 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=597, PETRI_PLACES=157, PETRI_TRANSITIONS=156} [2022-11-02 20:46:54,996 INFO L287 CegarLoopForPetriNet]: 135 programPoint places, 22 predicate places. [2022-11-02 20:46:54,996 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 156 transitions, 597 flow [2022-11-02 20:46:54,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 82.78571428571429) internal successors, (1159), 14 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:54,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:46:54,997 INFO L208 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] [2022-11-02 20:46:55,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:46:55,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:55,218 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 2 more)] === [2022-11-02 20:46:55,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:55,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2124593600, now seen corresponding path program 1 times [2022-11-02 20:46:55,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:55,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963503606] [2022-11-02 20:46:55,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:55,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:55,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:55,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:55,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963503606] [2022-11-02 20:46:55,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963503606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:55,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:55,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:46:55,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966813216] [2022-11-02 20:46:55,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:55,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:46:55,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:55,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:46:55,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:46:55,810 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 149 [2022-11-02 20:46:55,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 156 transitions, 597 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:55,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:46:55,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 149 [2022-11-02 20:46:55,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:46:58,662 INFO L130 PetriNetUnfolder]: 9404/16345 cut-off events. [2022-11-02 20:46:58,662 INFO L131 PetriNetUnfolder]: For 20548/21276 co-relation queries the response was YES. [2022-11-02 20:46:58,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45072 conditions, 16345 events. 9404/16345 cut-off events. For 20548/21276 co-relation queries the response was YES. Maximal size of possible extension queue 949. Compared 135114 event pairs, 2956 based on Foata normal form. 150/14994 useless extension candidates. Maximal degree in co-relation 45055. Up to 10100 conditions per place. [2022-11-02 20:46:58,982 INFO L137 encePairwiseOnDemand]: 136/149 looper letters, 106 selfloop transitions, 18 changer transitions 0/216 dead transitions. [2022-11-02 20:46:58,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 216 transitions, 1135 flow [2022-11-02 20:46:58,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:46:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:46:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 765 transitions. [2022-11-02 20:46:58,985 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7334611697027804 [2022-11-02 20:46:58,985 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 765 transitions. [2022-11-02 20:46:58,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 765 transitions. [2022-11-02 20:46:58,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:46:58,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 765 transitions. [2022-11-02 20:46:58,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:58,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:58,991 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:58,991 INFO L175 Difference]: Start difference. First operand has 157 places, 156 transitions, 597 flow. Second operand 7 states and 765 transitions. [2022-11-02 20:46:58,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 216 transitions, 1135 flow [2022-11-02 20:46:59,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 216 transitions, 1117 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:46:59,057 INFO L231 Difference]: Finished difference. Result has 162 places, 163 transitions, 707 flow [2022-11-02 20:46:59,057 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=707, PETRI_PLACES=162, PETRI_TRANSITIONS=163} [2022-11-02 20:46:59,060 INFO L287 CegarLoopForPetriNet]: 135 programPoint places, 27 predicate places. [2022-11-02 20:46:59,060 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 163 transitions, 707 flow [2022-11-02 20:46:59,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:59,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:46:59,061 INFO L208 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] [2022-11-02 20:46:59,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:46:59,062 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 2 more)] === [2022-11-02 20:46:59,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:59,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1018377000, now seen corresponding path program 2 times [2022-11-02 20:46:59,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:59,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38325658] [2022-11-02 20:46:59,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:59,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:59,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:59,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38325658] [2022-11-02 20:46:59,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38325658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:59,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:59,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:46:59,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396231340] [2022-11-02 20:46:59,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:59,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:46:59,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:59,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:46:59,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:46:59,465 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 149 [2022-11-02 20:46:59,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 163 transitions, 707 flow. Second operand has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:59,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:46:59,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 149 [2022-11-02 20:46:59,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:47:07,249 INFO L130 PetriNetUnfolder]: 39302/56783 cut-off events. [2022-11-02 20:47:07,250 INFO L131 PetriNetUnfolder]: For 107075/107127 co-relation queries the response was YES. [2022-11-02 20:47:07,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164982 conditions, 56783 events. 39302/56783 cut-off events. For 107075/107127 co-relation queries the response was YES. Maximal size of possible extension queue 2056. Compared 394870 event pairs, 24376 based on Foata normal form. 22/56595 useless extension candidates. Maximal degree in co-relation 164961. Up to 52863 conditions per place. [2022-11-02 20:47:07,753 INFO L137 encePairwiseOnDemand]: 138/149 looper letters, 115 selfloop transitions, 17 changer transitions 2/196 dead transitions. [2022-11-02 20:47:07,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 196 transitions, 1202 flow [2022-11-02 20:47:07,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:47:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:47:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 562 transitions. [2022-11-02 20:47:07,756 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6286353467561522 [2022-11-02 20:47:07,757 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 562 transitions. [2022-11-02 20:47:07,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 562 transitions. [2022-11-02 20:47:07,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:47:07,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 562 transitions. [2022-11-02 20:47:07,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:07,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 149.0) internal successors, (1043), 7 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:07,763 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 149.0) internal successors, (1043), 7 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:07,763 INFO L175 Difference]: Start difference. First operand has 162 places, 163 transitions, 707 flow. Second operand 6 states and 562 transitions. [2022-11-02 20:47:07,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 196 transitions, 1202 flow [2022-11-02 20:47:08,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 196 transitions, 1166 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-11-02 20:47:08,015 INFO L231 Difference]: Finished difference. Result has 167 places, 166 transitions, 769 flow [2022-11-02 20:47:08,016 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=769, PETRI_PLACES=167, PETRI_TRANSITIONS=166} [2022-11-02 20:47:08,016 INFO L287 CegarLoopForPetriNet]: 135 programPoint places, 32 predicate places. [2022-11-02 20:47:08,017 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 166 transitions, 769 flow [2022-11-02 20:47:08,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:08,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:08,018 INFO L208 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] [2022-11-02 20:47:08,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:47:08,018 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 2 more)] === [2022-11-02 20:47:08,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:08,019 INFO L85 PathProgramCache]: Analyzing trace with hash 704076128, now seen corresponding path program 1 times [2022-11-02 20:47:08,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:08,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955954287] [2022-11-02 20:47:08,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:08,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:08,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:08,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955954287] [2022-11-02 20:47:08,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955954287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:08,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:08,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:47:08,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995118184] [2022-11-02 20:47:08,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:08,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:47:08,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:08,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:47:08,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:47:08,688 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 149 [2022-11-02 20:47:08,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 166 transitions, 769 flow. Second operand has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:08,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:08,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 149 [2022-11-02 20:47:08,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:47:20,195 INFO L130 PetriNetUnfolder]: 48652/73391 cut-off events. [2022-11-02 20:47:20,196 INFO L131 PetriNetUnfolder]: For 142794/142878 co-relation queries the response was YES. [2022-11-02 20:47:20,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214060 conditions, 73391 events. 48652/73391 cut-off events. For 142794/142878 co-relation queries the response was YES. Maximal size of possible extension queue 3040. Compared 576007 event pairs, 26626 based on Foata normal form. 1353/74362 useless extension candidates. Maximal degree in co-relation 214036. Up to 46452 conditions per place. [2022-11-02 20:47:20,839 INFO L137 encePairwiseOnDemand]: 139/149 looper letters, 170 selfloop transitions, 21 changer transitions 2/255 dead transitions. [2022-11-02 20:47:20,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 255 transitions, 1674 flow [2022-11-02 20:47:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:47:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:47:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 676 transitions. [2022-11-02 20:47:20,849 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6481303930968361 [2022-11-02 20:47:20,849 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 676 transitions. [2022-11-02 20:47:20,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 676 transitions. [2022-11-02 20:47:20,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:47:20,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 676 transitions. [2022-11-02 20:47:20,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.57142857142857) internal successors, (676), 7 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:20,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:20,858 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:20,858 INFO L175 Difference]: Start difference. First operand has 167 places, 166 transitions, 769 flow. Second operand 7 states and 676 transitions. [2022-11-02 20:47:20,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 255 transitions, 1674 flow [2022-11-02 20:47:21,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 255 transitions, 1655 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-02 20:47:21,081 INFO L231 Difference]: Finished difference. Result has 172 places, 167 transitions, 825 flow [2022-11-02 20:47:21,081 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=825, PETRI_PLACES=172, PETRI_TRANSITIONS=167} [2022-11-02 20:47:21,082 INFO L287 CegarLoopForPetriNet]: 135 programPoint places, 37 predicate places. [2022-11-02 20:47:21,082 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 167 transitions, 825 flow [2022-11-02 20:47:21,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:21,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:21,083 INFO L208 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] [2022-11-02 20:47:21,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:47:21,084 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 2 more)] === [2022-11-02 20:47:21,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:21,085 INFO L85 PathProgramCache]: Analyzing trace with hash -340457316, now seen corresponding path program 2 times [2022-11-02 20:47:21,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:21,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395121267] [2022-11-02 20:47:21,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:21,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:21,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:21,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395121267] [2022-11-02 20:47:21,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395121267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:21,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:21,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:47:21,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341633090] [2022-11-02 20:47:21,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:21,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:47:21,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:21,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:47:21,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:47:21,434 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 149 [2022-11-02 20:47:21,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 167 transitions, 825 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:21,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:21,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 149 [2022-11-02 20:47:21,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:47:22,178 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][118], [30#L109-4true, 42#L38-2true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 862#true, Black: 850#true, 23#L68true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 175#true, Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true, 55#L81true]) [2022-11-02 20:47:22,179 INFO L383 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-11-02 20:47:22,179 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:47:22,179 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:47:22,179 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:47:22,322 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][118], [30#L109-4true, 42#L38-2true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 102#L69true, 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 862#true, Black: 850#true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 175#true, Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true, 55#L81true]) [2022-11-02 20:47:22,323 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-11-02 20:47:22,323 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 20:47:22,323 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:47:22,324 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 20:47:22,480 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][118], [30#L109-4true, 42#L38-2true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 862#true, Black: 850#true, 99#L70true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 175#true, Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true, 55#L81true]) [2022-11-02 20:47:22,481 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-11-02 20:47:22,481 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 20:47:22,481 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 20:47:22,481 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:47:22,927 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][118], [30#L109-4true, 42#L38-2true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 862#true, Black: 850#true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 175#true, Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 93#L71true, Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true, 55#L81true]) [2022-11-02 20:47:22,928 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-11-02 20:47:22,928 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-02 20:47:22,928 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:47:22,928 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-02 20:47:22,961 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][118], [30#L109-4true, 42#L38-2true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 61#L80-1true, 862#true, Black: 850#true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 175#true, Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), 93#L71true, Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true]) [2022-11-02 20:47:22,962 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-11-02 20:47:22,962 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:47:22,962 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 20:47:22,962 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 20:47:22,963 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][118], [30#L109-4true, 42#L38-2true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 61#L80-1true, 862#true, Black: 850#true, 99#L70true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 175#true, Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true]) [2022-11-02 20:47:22,963 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-11-02 20:47:22,963 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:47:22,963 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 20:47:22,964 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 20:47:22,964 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][118], [30#L109-4true, 42#L38-2true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 102#L69true, 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 61#L80-1true, 862#true, Black: 850#true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 175#true, Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true]) [2022-11-02 20:47:22,964 INFO L383 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-11-02 20:47:22,965 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:47:22,965 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:47:22,965 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:47:22,965 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][118], [30#L109-4true, 42#L38-2true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 61#L80-1true, 862#true, Black: 850#true, 23#L68true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 175#true, Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true]) [2022-11-02 20:47:22,966 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-11-02 20:47:22,966 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:47:22,966 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:47:22,966 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:47:22,967 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][65], [30#L109-4true, 42#L38-2true, 18#L67true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 866#(<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 850#true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true, 55#L81true]) [2022-11-02 20:47:22,967 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-11-02 20:47:22,967 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:47:22,967 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:47:22,967 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:47:22,998 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][118], [30#L109-4true, 42#L38-2true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 61#L80-1true, 862#true, Black: 850#true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 38#L72true, Black: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 175#true, Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true]) [2022-11-02 20:47:22,998 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-11-02 20:47:22,999 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-02 20:47:22,999 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:47:22,999 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-02 20:47:23,140 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][118], [30#L109-4true, 42#L38-2true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 862#true, Black: 850#true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 38#L72true, Black: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 175#true, Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true, 55#L81true]) [2022-11-02 20:47:23,140 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-11-02 20:47:23,140 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:47:23,140 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:47:23,141 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:47:23,202 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][118], [30#L109-4true, 42#L38-2true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 61#L80-1true, 862#true, Black: 850#true, 77#L73true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 175#true, Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true]) [2022-11-02 20:47:23,202 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-11-02 20:47:23,202 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:47:23,202 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:47:23,203 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:47:23,349 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][118], [30#L109-4true, 42#L38-2true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 862#true, Black: 850#true, 77#L73true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 175#true, Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true, 55#L81true]) [2022-11-02 20:47:23,349 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-11-02 20:47:23,349 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-11-02 20:47:23,349 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 20:47:23,350 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 20:47:23,403 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][118], [30#L109-4true, 42#L38-2true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 61#L80-1true, 862#true, 103#L66-1true, Black: 850#true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 175#true, Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true]) [2022-11-02 20:47:23,403 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-11-02 20:47:23,403 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 20:47:23,404 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-11-02 20:47:23,404 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 20:47:23,506 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][118], [30#L109-4true, 42#L38-2true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 862#true, 103#L66-1true, Black: 850#true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 175#true, Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true, 55#L81true]) [2022-11-02 20:47:23,506 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-02 20:47:23,506 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:47:23,506 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:47:23,506 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:47:23,512 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][100], [30#L109-4true, 42#L38-2true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 869#(and (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296)))), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 850#true, 6#L66-2true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 175#true, Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true, 55#L81true]) [2022-11-02 20:47:23,512 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-11-02 20:47:23,512 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:47:23,513 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:47:23,513 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-02 20:47:23,556 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][185], [30#L109-4true, 42#L38-2true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 61#L80-1true, Black: 850#true, 6#L66-2true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 867#(<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 175#true, Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true]) [2022-11-02 20:47:23,556 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-02 20:47:23,556 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:47:23,557 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:47:23,557 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:47:23,561 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][118], [30#L109-4true, 42#L38-2true, 189#true, 18#L67true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 61#L80-1true, 862#true, Black: 850#true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 175#true, Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true]) [2022-11-02 20:47:23,561 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-02 20:47:23,561 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:47:23,561 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:47:23,562 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:47:23,659 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][185], [30#L109-4true, 42#L38-2true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 850#true, 6#L66-2true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 867#(<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 175#true, Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true, 55#L81true]) [2022-11-02 20:47:23,659 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-11-02 20:47:23,659 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:47:23,660 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-02 20:47:23,660 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:47:23,661 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][100], [30#L109-4true, 42#L38-2true, 189#true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), 869#(and (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296)))), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 850#true, 6#L66-2true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 175#true, Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true, 55#L81true]) [2022-11-02 20:47:23,662 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-11-02 20:47:23,662 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-02 20:47:23,662 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:47:23,662 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:47:23,662 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-02 20:47:23,666 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L38-1-->L38-2: Formula: (not (< (mod v_~x1~0_1 4294967296) (mod v_~n~0_1 4294967296))) InVars {~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} OutVars{~n~0=v_~n~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[][118], [30#L109-4true, 42#L38-2true, 189#true, 18#L67true, Black: 830#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 829#(<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)), Black: 834#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 91#L54true, 155#true, Black: 844#(and (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296))) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 843#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 862#true, Black: 850#true, Black: 162#(and (= (+ ~x4~0 (* (div ~x3~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: 808#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 195#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 806#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 810#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 804#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (not (<= ~x1~0 (* (div ~x1~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= ~x3~0 (* (div ~x3~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 814#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (< 0 (mod ~x1~0 4294967296))), Black: 802#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= (+ ~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 ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 175#true, Black: 379#(and (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 179#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), 856#(<= (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))), Black: 180#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), Black: 184#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 825#true, 55#L81true]) [2022-11-02 20:47:23,666 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-11-02 20:47:23,666 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-11-02 20:47:23,667 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:47:23,667 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:47:25,535 INFO L130 PetriNetUnfolder]: 11706/19746 cut-off events. [2022-11-02 20:47:25,536 INFO L131 PetriNetUnfolder]: For 62601/63942 co-relation queries the response was YES. [2022-11-02 20:47:25,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66730 conditions, 19746 events. 11706/19746 cut-off events. For 62601/63942 co-relation queries the response was YES. Maximal size of possible extension queue 1663. Compared 169321 event pairs, 3644 based on Foata normal form. 336/19105 useless extension candidates. Maximal degree in co-relation 66705. Up to 13194 conditions per place. [2022-11-02 20:47:25,769 INFO L137 encePairwiseOnDemand]: 137/149 looper letters, 122 selfloop transitions, 20 changer transitions 0/235 dead transitions. [2022-11-02 20:47:25,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 235 transitions, 1547 flow [2022-11-02 20:47:25,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:47:25,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:47:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 763 transitions. [2022-11-02 20:47:25,773 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7315436241610739 [2022-11-02 20:47:25,773 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 763 transitions. [2022-11-02 20:47:25,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 763 transitions. [2022-11-02 20:47:25,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:47:25,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 763 transitions. [2022-11-02 20:47:25,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:25,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:25,781 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:25,781 INFO L175 Difference]: Start difference. First operand has 172 places, 167 transitions, 825 flow. Second operand 7 states and 763 transitions. [2022-11-02 20:47:25,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 235 transitions, 1547 flow [2022-11-02 20:47:25,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 235 transitions, 1528 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:47:25,919 INFO L231 Difference]: Finished difference. Result has 177 places, 170 transitions, 893 flow [2022-11-02 20:47:25,919 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=893, PETRI_PLACES=177, PETRI_TRANSITIONS=170} [2022-11-02 20:47:25,920 INFO L287 CegarLoopForPetriNet]: 135 programPoint places, 42 predicate places. [2022-11-02 20:47:25,920 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 170 transitions, 893 flow [2022-11-02 20:47:25,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:25,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:25,922 INFO L208 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] [2022-11-02 20:47:25,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:47:25,922 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 2 more)] === [2022-11-02 20:47:25,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:25,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2053700674, now seen corresponding path program 3 times [2022-11-02 20:47:25,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:25,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773754064] [2022-11-02 20:47:25,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:25,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:26,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:26,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773754064] [2022-11-02 20:47:26,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773754064] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:26,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163136642] [2022-11-02 20:47:26,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:47:26,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:26,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:26,489 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:26,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a678679-6640-4ae2-9f04-8cc4d3edb2ce/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:47:26,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-02 20:47:26,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:47:26,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:47:26,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:27,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:27,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:27,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163136642] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:47:27,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:47:27,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-11-02 20:47:27,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476252462] [2022-11-02 20:47:27,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:27,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:47:27,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:27,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:47:27,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:47:27,784 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 149 [2022-11-02 20:47:27,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 170 transitions, 893 flow. Second operand has 14 states, 14 states have (on average 83.14285714285714) internal successors, (1164), 14 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:27,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:27,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 149 [2022-11-02 20:47:27,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand