./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/mult-flipped-dist.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_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/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_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/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_1bb14445-44a3-47f0-b85b-8c62c918d5b4/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 0d10bf8c0e842192a13f4b6638f03cf57668d5bee07d0b49c4b595de1c605066 --- 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 21:07:22,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:07:22,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:07:22,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:07:22,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:07:22,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:07:22,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:07:22,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:07:22,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:07:22,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:07:22,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:07:22,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:07:22,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:07:22,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:07:22,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:07:22,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:07:22,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:07:22,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:07:22,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:07:22,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:07:22,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:07:22,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:07:22,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:07:22,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:07:22,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:07:22,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:07:22,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:07:22,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:07:22,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:07:22,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:07:22,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:07:22,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:07:22,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:07:22,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:07:22,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:07:22,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:07:22,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:07:22,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:07:22,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:07:22,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:07:22,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:07:22,407 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:07:22,446 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:07:22,446 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:07:22,447 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:07:22,447 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:07:22,448 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:07:22,448 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:07:22,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:07:22,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:07:22,449 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:07:22,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:07:22,451 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:07:22,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:07:22,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:07:22,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:07:22,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:07:22,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:07:22,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:07:22,452 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:07:22,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:07:22,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:07:22,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:07:22,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:07:22,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:07:22,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:07:22,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:07:22,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:07:22,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:07:22,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:07:22,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:07:22,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:07:22,456 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:07:22,457 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:07:22,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:07:22,457 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_1bb14445-44a3-47f0-b85b-8c62c918d5b4/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_1bb14445-44a3-47f0-b85b-8c62c918d5b4/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 -> 0d10bf8c0e842192a13f4b6638f03cf57668d5bee07d0b49c4b595de1c605066 [2022-11-02 21:07:22,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:07:22,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:07:22,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:07:22,779 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:07:22,780 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:07:22,781 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2022-11-02 21:07:22,851 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/data/bb33a15c1/5775d541096749cd94ca272ac1e24cce/FLAG947ed0782 [2022-11-02 21:07:23,312 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:07:23,313 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2022-11-02 21:07:23,320 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/data/bb33a15c1/5775d541096749cd94ca272ac1e24cce/FLAG947ed0782 [2022-11-02 21:07:23,672 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/data/bb33a15c1/5775d541096749cd94ca272ac1e24cce [2022-11-02 21:07:23,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:07:23,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:07:23,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:07:23,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:07:23,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:07:23,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:07:23" (1/1) ... [2022-11-02 21:07:23,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69739df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:23, skipping insertion in model container [2022-11-02 21:07:23,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:07:23" (1/1) ... [2022-11-02 21:07:23,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:07:23,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:07:23,938 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_1bb14445-44a3-47f0-b85b-8c62c918d5b4/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c[2135,2148] [2022-11-02 21:07:23,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:07:23,950 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:07:23,972 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_1bb14445-44a3-47f0-b85b-8c62c918d5b4/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c[2135,2148] [2022-11-02 21:07:23,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:07:23,995 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:07:23,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:23 WrapperNode [2022-11-02 21:07:23,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:07:23,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:07:23,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:07:23,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:07:24,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:23" (1/1) ... [2022-11-02 21:07:24,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:23" (1/1) ... [2022-11-02 21:07:24,053 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2022-11-02 21:07:24,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:07:24,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:07:24,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:07:24,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:07:24,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:23" (1/1) ... [2022-11-02 21:07:24,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:23" (1/1) ... [2022-11-02 21:07:24,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:23" (1/1) ... [2022-11-02 21:07:24,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:23" (1/1) ... [2022-11-02 21:07:24,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:23" (1/1) ... [2022-11-02 21:07:24,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:23" (1/1) ... [2022-11-02 21:07:24,097 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:23" (1/1) ... [2022-11-02 21:07:24,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:23" (1/1) ... [2022-11-02 21:07:24,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:07:24,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:07:24,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:07:24,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:07:24,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:23" (1/1) ... [2022-11-02 21:07:24,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:07:24,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:24,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:07:24,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:07:24,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:07:24,193 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 21:07:24,194 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 21:07:24,194 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 21:07:24,194 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 21:07:24,194 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 21:07:24,194 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 21:07:24,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:07:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:07:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:07:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:07:24,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:07:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:07:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:07:24,197 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 21:07:24,329 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:07:24,332 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:07:24,601 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:07:24,609 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:07:24,609 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 21:07:24,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:24 BoogieIcfgContainer [2022-11-02 21:07:24,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:07:24,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:07:24,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:07:24,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:07:24,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:07:23" (1/3) ... [2022-11-02 21:07:24,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2405d49f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:07:24, skipping insertion in model container [2022-11-02 21:07:24,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:23" (2/3) ... [2022-11-02 21:07:24,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2405d49f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:07:24, skipping insertion in model container [2022-11-02 21:07:24,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:24" (3/3) ... [2022-11-02 21:07:24,620 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-flipped-dist.wvr.c [2022-11-02 21:07:24,634 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 21:07:24,647 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:07:24,652 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:07:24,652 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 21:07:24,754 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 21:07:24,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 107 transitions, 238 flow [2022-11-02 21:07:24,916 INFO L130 PetriNetUnfolder]: 7/104 cut-off events. [2022-11-02 21:07:24,917 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 21:07:24,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 7/104 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2022-11-02 21:07:24,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 107 transitions, 238 flow [2022-11-02 21:07:24,926 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 93 transitions, 204 flow [2022-11-02 21:07:24,937 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:07:24,946 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;@5df284f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:07:24,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-02 21:07:24,989 INFO L130 PetriNetUnfolder]: 7/92 cut-off events. [2022-11-02 21:07:24,989 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 21:07:24,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:24,990 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] [2022-11-02 21:07:24,990 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 1 more)] === [2022-11-02 21:07:24,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:24,996 INFO L85 PathProgramCache]: Analyzing trace with hash 588643027, now seen corresponding path program 1 times [2022-11-02 21:07:25,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:25,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204225721] [2022-11-02 21:07:25,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:25,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,377 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 21:07:25,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:25,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204225721] [2022-11-02 21:07:25,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204225721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:25,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:25,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:25,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668326946] [2022-11-02 21:07:25,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:25,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:07:25,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:25,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:07:25,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:07:25,450 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107 [2022-11-02 21:07:25,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 204 flow. Second operand has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 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 21:07:25,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:25,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107 [2022-11-02 21:07:25,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:25,555 INFO L130 PetriNetUnfolder]: 3/89 cut-off events. [2022-11-02 21:07:25,555 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-02 21:07:25,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 89 events. 3/89 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 10/95 useless extension candidates. Maximal degree in co-relation 66. Up to 7 conditions per place. [2022-11-02 21:07:25,558 INFO L137 encePairwiseOnDemand]: 103/107 looper letters, 6 selfloop transitions, 0 changer transitions 1/89 dead transitions. [2022-11-02 21:07:25,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 89 transitions, 208 flow [2022-11-02 21:07:25,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:07:25,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 21:07:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2022-11-02 21:07:25,577 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9439252336448598 [2022-11-02 21:07:25,578 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2022-11-02 21:07:25,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2022-11-02 21:07:25,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:25,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2022-11-02 21:07:25,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 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 21:07:25,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 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 21:07:25,600 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 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 21:07:25,602 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 204 flow. Second operand 2 states and 202 transitions. [2022-11-02 21:07:25,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 89 transitions, 208 flow [2022-11-02 21:07:25,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 89 transitions, 196 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 21:07:25,614 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 182 flow [2022-11-02 21:07:25,616 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=182, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2022-11-02 21:07:25,630 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, -5 predicate places. [2022-11-02 21:07:25,630 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 182 flow [2022-11-02 21:07:25,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 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 21:07:25,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:25,632 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] [2022-11-02 21:07:25,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:07:25,633 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 1 more)] === [2022-11-02 21:07:25,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:25,636 INFO L85 PathProgramCache]: Analyzing trace with hash -609386509, now seen corresponding path program 1 times [2022-11-02 21:07:25,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:25,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957081775] [2022-11-02 21:07:25,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:25,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:26,594 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 21:07:26,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:26,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957081775] [2022-11-02 21:07:26,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957081775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:26,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:26,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:07:26,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842459771] [2022-11-02 21:07:26,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:26,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:07:26,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:26,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:07:26,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:26,600 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2022-11-02 21:07:26,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 182 flow. Second operand has 7 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 states have internal predecessors, (608), 0 states have call successors, (0), 0 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 21:07:26,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:26,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2022-11-02 21:07:26,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:26,772 INFO L130 PetriNetUnfolder]: 53/322 cut-off events. [2022-11-02 21:07:26,772 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-11-02 21:07:26,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 322 events. 53/322 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1263 event pairs, 7 based on Foata normal form. 2/290 useless extension candidates. Maximal degree in co-relation 432. Up to 52 conditions per place. [2022-11-02 21:07:26,777 INFO L137 encePairwiseOnDemand]: 98/107 looper letters, 35 selfloop transitions, 9 changer transitions 4/120 dead transitions. [2022-11-02 21:07:26,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 120 transitions, 354 flow [2022-11-02 21:07:26,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:07:26,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 21:07:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 644 transitions. [2022-11-02 21:07:26,784 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8598130841121495 [2022-11-02 21:07:26,784 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 644 transitions. [2022-11-02 21:07:26,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 644 transitions. [2022-11-02 21:07:26,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:26,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 644 transitions. [2022-11-02 21:07:26,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 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 21:07:26,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 0 states have call successors, (0), 0 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 21:07:26,790 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 0 states have call successors, (0), 0 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 21:07:26,790 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 182 flow. Second operand 7 states and 644 transitions. [2022-11-02 21:07:26,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 120 transitions, 354 flow [2022-11-02 21:07:26,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 120 transitions, 354 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 21:07:26,794 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 235 flow [2022-11-02 21:07:26,794 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2022-11-02 21:07:26,795 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 4 predicate places. [2022-11-02 21:07:26,795 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 235 flow [2022-11-02 21:07:26,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 states have internal predecessors, (608), 0 states have call successors, (0), 0 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 21:07:26,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:26,799 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] [2022-11-02 21:07:26,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:07:26,802 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 1 more)] === [2022-11-02 21:07:26,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:26,802 INFO L85 PathProgramCache]: Analyzing trace with hash -247818876, now seen corresponding path program 1 times [2022-11-02 21:07:26,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:26,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069400039] [2022-11-02 21:07:26,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:26,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:27,032 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 21:07:27,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:27,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069400039] [2022-11-02 21:07:27,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069400039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:27,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:27,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:07:27,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702280355] [2022-11-02 21:07:27,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:27,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:07:27,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:27,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:07:27,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:07:27,036 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2022-11-02 21:07:27,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 0 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 21:07:27,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:27,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2022-11-02 21:07:27,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:27,554 INFO L130 PetriNetUnfolder]: 877/2022 cut-off events. [2022-11-02 21:07:27,554 INFO L131 PetriNetUnfolder]: For 171/172 co-relation queries the response was YES. [2022-11-02 21:07:27,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3675 conditions, 2022 events. 877/2022 cut-off events. For 171/172 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 14886 event pairs, 392 based on Foata normal form. 0/1583 useless extension candidates. Maximal degree in co-relation 3667. Up to 807 conditions per place. [2022-11-02 21:07:27,577 INFO L137 encePairwiseOnDemand]: 99/107 looper letters, 40 selfloop transitions, 6 changer transitions 0/120 dead transitions. [2022-11-02 21:07:27,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 120 transitions, 387 flow [2022-11-02 21:07:27,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:07:27,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 21:07:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 542 transitions. [2022-11-02 21:07:27,580 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8442367601246106 [2022-11-02 21:07:27,580 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 542 transitions. [2022-11-02 21:07:27,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 542 transitions. [2022-11-02 21:07:27,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:27,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 542 transitions. [2022-11-02 21:07:27,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 21:07:27,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 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 21:07:27,586 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 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 21:07:27,586 INFO L175 Difference]: Start difference. First operand has 100 places, 94 transitions, 235 flow. Second operand 6 states and 542 transitions. [2022-11-02 21:07:27,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 120 transitions, 387 flow [2022-11-02 21:07:27,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 120 transitions, 383 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:27,592 INFO L231 Difference]: Finished difference. Result has 104 places, 97 transitions, 269 flow [2022-11-02 21:07:27,592 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=104, PETRI_TRANSITIONS=97} [2022-11-02 21:07:27,593 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 8 predicate places. [2022-11-02 21:07:27,593 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 97 transitions, 269 flow [2022-11-02 21:07:27,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 0 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 21:07:27,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:27,594 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] [2022-11-02 21:07:27,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:07:27,595 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 1 more)] === [2022-11-02 21:07:27,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:27,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1819342954, now seen corresponding path program 2 times [2022-11-02 21:07:27,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:27,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454614944] [2022-11-02 21:07:27,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:27,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:27,776 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 21:07:27,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:27,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454614944] [2022-11-02 21:07:27,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454614944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:27,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:27,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:07:27,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220634301] [2022-11-02 21:07:27,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:27,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:07:27,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:27,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:07:27,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:07:27,779 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2022-11-02 21:07:27,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 97 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 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 21:07:27,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:27,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2022-11-02 21:07:27,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:28,213 INFO L130 PetriNetUnfolder]: 901/2408 cut-off events. [2022-11-02 21:07:28,213 INFO L131 PetriNetUnfolder]: For 1120/1233 co-relation queries the response was YES. [2022-11-02 21:07:28,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5073 conditions, 2408 events. 901/2408 cut-off events. For 1120/1233 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 20109 event pairs, 347 based on Foata normal form. 96/2344 useless extension candidates. Maximal degree in co-relation 5063. Up to 915 conditions per place. [2022-11-02 21:07:28,242 INFO L137 encePairwiseOnDemand]: 101/107 looper letters, 33 selfloop transitions, 5 changer transitions 2/119 dead transitions. [2022-11-02 21:07:28,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 119 transitions, 426 flow [2022-11-02 21:07:28,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:07:28,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 21:07:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2022-11-02 21:07:28,245 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8855140186915887 [2022-11-02 21:07:28,245 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 379 transitions. [2022-11-02 21:07:28,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 379 transitions. [2022-11-02 21:07:28,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:28,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 379 transitions. [2022-11-02 21:07:28,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 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 21:07:28,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 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 21:07:28,249 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 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 21:07:28,249 INFO L175 Difference]: Start difference. First operand has 104 places, 97 transitions, 269 flow. Second operand 4 states and 379 transitions. [2022-11-02 21:07:28,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 119 transitions, 426 flow [2022-11-02 21:07:28,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 119 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:28,256 INFO L231 Difference]: Finished difference. Result has 108 places, 102 transitions, 313 flow [2022-11-02 21:07:28,256 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=313, PETRI_PLACES=108, PETRI_TRANSITIONS=102} [2022-11-02 21:07:28,257 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 12 predicate places. [2022-11-02 21:07:28,257 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 102 transitions, 313 flow [2022-11-02 21:07:28,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 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 21:07:28,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:28,258 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] [2022-11-02 21:07:28,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:07:28,259 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 1 more)] === [2022-11-02 21:07:28,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:28,260 INFO L85 PathProgramCache]: Analyzing trace with hash 715228422, now seen corresponding path program 1 times [2022-11-02 21:07:28,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:28,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395477089] [2022-11-02 21:07:28,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:28,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:28,429 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 21:07:28,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:28,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395477089] [2022-11-02 21:07:28,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395477089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:28,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:28,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:07:28,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044690890] [2022-11-02 21:07:28,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:28,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:07:28,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:28,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:07:28,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:07:28,432 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2022-11-02 21:07:28,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 0 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 21:07:28,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:28,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2022-11-02 21:07:28,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:29,015 INFO L130 PetriNetUnfolder]: 1235/3303 cut-off events. [2022-11-02 21:07:29,015 INFO L131 PetriNetUnfolder]: For 2707/2940 co-relation queries the response was YES. [2022-11-02 21:07:29,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7517 conditions, 3303 events. 1235/3303 cut-off events. For 2707/2940 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 29118 event pairs, 438 based on Foata normal form. 247/3431 useless extension candidates. Maximal degree in co-relation 7505. Up to 1011 conditions per place. [2022-11-02 21:07:29,050 INFO L137 encePairwiseOnDemand]: 99/107 looper letters, 49 selfloop transitions, 6 changer transitions 10/140 dead transitions. [2022-11-02 21:07:29,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 140 transitions, 604 flow [2022-11-02 21:07:29,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:07:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 21:07:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 545 transitions. [2022-11-02 21:07:29,093 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8489096573208723 [2022-11-02 21:07:29,094 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 545 transitions. [2022-11-02 21:07:29,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 545 transitions. [2022-11-02 21:07:29,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:29,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 545 transitions. [2022-11-02 21:07:29,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 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 21:07:29,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 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 21:07:29,097 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 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 21:07:29,097 INFO L175 Difference]: Start difference. First operand has 108 places, 102 transitions, 313 flow. Second operand 6 states and 545 transitions. [2022-11-02 21:07:29,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 140 transitions, 604 flow [2022-11-02 21:07:29,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 140 transitions, 604 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 21:07:29,108 INFO L231 Difference]: Finished difference. Result has 116 places, 104 transitions, 358 flow [2022-11-02 21:07:29,108 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=358, PETRI_PLACES=116, PETRI_TRANSITIONS=104} [2022-11-02 21:07:29,112 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 20 predicate places. [2022-11-02 21:07:29,113 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 104 transitions, 358 flow [2022-11-02 21:07:29,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 0 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 21:07:29,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:29,114 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] [2022-11-02 21:07:29,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:07:29,115 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 1 more)] === [2022-11-02 21:07:29,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:29,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1866092072, now seen corresponding path program 3 times [2022-11-02 21:07:29,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:29,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489930573] [2022-11-02 21:07:29,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:29,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:29,255 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 21:07:29,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:29,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489930573] [2022-11-02 21:07:29,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489930573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:29,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:29,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:07:29,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907125086] [2022-11-02 21:07:29,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:29,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:07:29,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:29,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:07:29,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:07:29,259 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2022-11-02 21:07:29,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 104 transitions, 358 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 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 21:07:29,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:29,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2022-11-02 21:07:29,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:29,821 INFO L130 PetriNetUnfolder]: 1021/3126 cut-off events. [2022-11-02 21:07:29,822 INFO L131 PetriNetUnfolder]: For 4230/4618 co-relation queries the response was YES. [2022-11-02 21:07:29,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7956 conditions, 3126 events. 1021/3126 cut-off events. For 4230/4618 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 28980 event pairs, 497 based on Foata normal form. 250/3228 useless extension candidates. Maximal degree in co-relation 7940. Up to 771 conditions per place. [2022-11-02 21:07:29,859 INFO L137 encePairwiseOnDemand]: 101/107 looper letters, 39 selfloop transitions, 10 changer transitions 2/131 dead transitions. [2022-11-02 21:07:29,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 131 transitions, 610 flow [2022-11-02 21:07:29,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:07:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 21:07:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2022-11-02 21:07:29,861 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8855140186915887 [2022-11-02 21:07:29,861 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 379 transitions. [2022-11-02 21:07:29,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 379 transitions. [2022-11-02 21:07:29,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:29,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 379 transitions. [2022-11-02 21:07:29,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 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 21:07:29,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 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 21:07:29,865 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 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 21:07:29,865 INFO L175 Difference]: Start difference. First operand has 116 places, 104 transitions, 358 flow. Second operand 4 states and 379 transitions. [2022-11-02 21:07:29,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 131 transitions, 610 flow [2022-11-02 21:07:29,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 131 transitions, 585 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-11-02 21:07:29,875 INFO L231 Difference]: Finished difference. Result has 117 places, 110 transitions, 439 flow [2022-11-02 21:07:29,875 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=439, PETRI_PLACES=117, PETRI_TRANSITIONS=110} [2022-11-02 21:07:29,878 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 21 predicate places. [2022-11-02 21:07:29,878 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 110 transitions, 439 flow [2022-11-02 21:07:29,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 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 21:07:29,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:29,879 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] [2022-11-02 21:07:29,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:07:29,879 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 1 more)] === [2022-11-02 21:07:29,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:29,880 INFO L85 PathProgramCache]: Analyzing trace with hash 929537012, now seen corresponding path program 2 times [2022-11-02 21:07:29,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:29,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481475317] [2022-11-02 21:07:29,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:29,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,071 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 21:07:30,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:30,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481475317] [2022-11-02 21:07:30,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481475317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:30,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:30,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:07:30,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780673465] [2022-11-02 21:07:30,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:30,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:07:30,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:30,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:07:30,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:07:30,078 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2022-11-02 21:07:30,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 110 transitions, 439 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 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 21:07:30,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:30,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2022-11-02 21:07:30,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:30,715 INFO L130 PetriNetUnfolder]: 1219/3484 cut-off events. [2022-11-02 21:07:30,715 INFO L131 PetriNetUnfolder]: For 8143/9049 co-relation queries the response was YES. [2022-11-02 21:07:30,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10257 conditions, 3484 events. 1219/3484 cut-off events. For 8143/9049 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 31943 event pairs, 596 based on Foata normal form. 247/3448 useless extension candidates. Maximal degree in co-relation 10240. Up to 1385 conditions per place. [2022-11-02 21:07:30,755 INFO L137 encePairwiseOnDemand]: 101/107 looper letters, 37 selfloop transitions, 8 changer transitions 6/132 dead transitions. [2022-11-02 21:07:30,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 132 transitions, 679 flow [2022-11-02 21:07:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:07:30,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 21:07:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 378 transitions. [2022-11-02 21:07:30,758 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.883177570093458 [2022-11-02 21:07:30,758 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 378 transitions. [2022-11-02 21:07:30,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 378 transitions. [2022-11-02 21:07:30,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:30,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 378 transitions. [2022-11-02 21:07:30,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 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 21:07:30,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 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 21:07:30,763 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 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 21:07:30,763 INFO L175 Difference]: Start difference. First operand has 117 places, 110 transitions, 439 flow. Second operand 4 states and 378 transitions. [2022-11-02 21:07:30,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 132 transitions, 679 flow [2022-11-02 21:07:30,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 132 transitions, 675 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:07:30,771 INFO L231 Difference]: Finished difference. Result has 121 places, 112 transitions, 478 flow [2022-11-02 21:07:30,771 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=478, PETRI_PLACES=121, PETRI_TRANSITIONS=112} [2022-11-02 21:07:30,772 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 25 predicate places. [2022-11-02 21:07:30,772 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 112 transitions, 478 flow [2022-11-02 21:07:30,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 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 21:07:30,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:30,773 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] [2022-11-02 21:07:30,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:07:30,773 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 1 more)] === [2022-11-02 21:07:30,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:30,774 INFO L85 PathProgramCache]: Analyzing trace with hash 493263558, now seen corresponding path program 4 times [2022-11-02 21:07:30,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:30,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588520288] [2022-11-02 21:07:30,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:30,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,965 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 21:07:30,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:30,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588520288] [2022-11-02 21:07:30,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588520288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:30,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:30,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:07:30,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487890603] [2022-11-02 21:07:30,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:30,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:07:30,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:30,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:07:30,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:07:30,968 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2022-11-02 21:07:30,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 112 transitions, 478 flow. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 0 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 21:07:30,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:30,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2022-11-02 21:07:30,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:31,790 INFO L130 PetriNetUnfolder]: 1976/5190 cut-off events. [2022-11-02 21:07:31,790 INFO L131 PetriNetUnfolder]: For 9741/10364 co-relation queries the response was YES. [2022-11-02 21:07:31,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14700 conditions, 5190 events. 1976/5190 cut-off events. For 9741/10364 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 49313 event pairs, 914 based on Foata normal form. 181/5129 useless extension candidates. Maximal degree in co-relation 14681. Up to 1401 conditions per place. [2022-11-02 21:07:31,946 INFO L137 encePairwiseOnDemand]: 99/107 looper letters, 46 selfloop transitions, 6 changer transitions 16/143 dead transitions. [2022-11-02 21:07:31,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 143 transitions, 790 flow [2022-11-02 21:07:31,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:07:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 21:07:31,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 542 transitions. [2022-11-02 21:07:31,953 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8442367601246106 [2022-11-02 21:07:31,953 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 542 transitions. [2022-11-02 21:07:31,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 542 transitions. [2022-11-02 21:07:31,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:31,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 542 transitions. [2022-11-02 21:07:31,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 21:07:31,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 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 21:07:31,957 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 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 21:07:31,957 INFO L175 Difference]: Start difference. First operand has 121 places, 112 transitions, 478 flow. Second operand 6 states and 542 transitions. [2022-11-02 21:07:31,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 143 transitions, 790 flow [2022-11-02 21:07:31,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 143 transitions, 775 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-11-02 21:07:31,973 INFO L231 Difference]: Finished difference. Result has 128 places, 111 transitions, 479 flow [2022-11-02 21:07:31,974 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=479, PETRI_PLACES=128, PETRI_TRANSITIONS=111} [2022-11-02 21:07:31,976 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 32 predicate places. [2022-11-02 21:07:31,976 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 111 transitions, 479 flow [2022-11-02 21:07:31,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 0 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 21:07:31,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:31,977 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] [2022-11-02 21:07:31,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:07:31,977 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 1 more)] === [2022-11-02 21:07:31,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:31,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1887546216, now seen corresponding path program 3 times [2022-11-02 21:07:31,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:31,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389175628] [2022-11-02 21:07:31,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:31,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:32,129 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 21:07:32,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:32,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389175628] [2022-11-02 21:07:32,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389175628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:32,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:32,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:07:32,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936297143] [2022-11-02 21:07:32,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:32,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:07:32,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:32,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:07:32,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:07:32,134 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2022-11-02 21:07:32,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 111 transitions, 479 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 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 21:07:32,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:32,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2022-11-02 21:07:32,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:32,703 INFO L130 PetriNetUnfolder]: 1161/3036 cut-off events. [2022-11-02 21:07:32,704 INFO L131 PetriNetUnfolder]: For 9156/10178 co-relation queries the response was YES. [2022-11-02 21:07:32,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9948 conditions, 3036 events. 1161/3036 cut-off events. For 9156/10178 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 25978 event pairs, 329 based on Foata normal form. 231/3067 useless extension candidates. Maximal degree in co-relation 9926. Up to 837 conditions per place. [2022-11-02 21:07:32,839 INFO L137 encePairwiseOnDemand]: 101/107 looper letters, 40 selfloop transitions, 15 changer transitions 2/138 dead transitions. [2022-11-02 21:07:32,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 138 transitions, 816 flow [2022-11-02 21:07:32,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:07:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 21:07:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 376 transitions. [2022-11-02 21:07:32,841 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8785046728971962 [2022-11-02 21:07:32,842 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 376 transitions. [2022-11-02 21:07:32,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 376 transitions. [2022-11-02 21:07:32,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:32,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 376 transitions. [2022-11-02 21:07:32,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 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 21:07:32,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 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 21:07:32,845 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 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 21:07:32,845 INFO L175 Difference]: Start difference. First operand has 128 places, 111 transitions, 479 flow. Second operand 4 states and 376 transitions. [2022-11-02 21:07:32,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 138 transitions, 816 flow [2022-11-02 21:07:32,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 138 transitions, 776 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-11-02 21:07:32,862 INFO L231 Difference]: Finished difference. Result has 123 places, 119 transitions, 604 flow [2022-11-02 21:07:32,862 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=604, PETRI_PLACES=123, PETRI_TRANSITIONS=119} [2022-11-02 21:07:32,863 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 27 predicate places. [2022-11-02 21:07:32,863 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 119 transitions, 604 flow [2022-11-02 21:07:32,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 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 21:07:32,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:32,864 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] [2022-11-02 21:07:32,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:07:32,864 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:07:32,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:32,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1456629559, now seen corresponding path program 1 times [2022-11-02 21:07:32,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:32,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791466882] [2022-11-02 21:07:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:32,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:07:33,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:33,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791466882] [2022-11-02 21:07:33,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791466882] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:33,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294292108] [2022-11-02 21:07:33,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:33,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:33,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:33,064 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:33,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:07:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:33,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 21:07:33,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:07:33,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:07:33,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294292108] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:33,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 21:07:33,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2022-11-02 21:07:33,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070119886] [2022-11-02 21:07:33,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:33,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:07:33,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:33,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:07:33,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:33,424 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2022-11-02 21:07:33,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 119 transitions, 604 flow. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 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 21:07:33,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:33,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2022-11-02 21:07:33,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:34,001 INFO L130 PetriNetUnfolder]: 1406/3297 cut-off events. [2022-11-02 21:07:34,001 INFO L131 PetriNetUnfolder]: For 14582/15882 co-relation queries the response was YES. [2022-11-02 21:07:34,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12318 conditions, 3297 events. 1406/3297 cut-off events. For 14582/15882 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26619 event pairs, 234 based on Foata normal form. 241/3351 useless extension candidates. Maximal degree in co-relation 12298. Up to 1090 conditions per place. [2022-11-02 21:07:34,046 INFO L137 encePairwiseOnDemand]: 101/107 looper letters, 39 selfloop transitions, 15 changer transitions 1/138 dead transitions. [2022-11-02 21:07:34,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 138 transitions, 881 flow [2022-11-02 21:07:34,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:07:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 21:07:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 372 transitions. [2022-11-02 21:07:34,048 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8691588785046729 [2022-11-02 21:07:34,048 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 372 transitions. [2022-11-02 21:07:34,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 372 transitions. [2022-11-02 21:07:34,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:34,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 372 transitions. [2022-11-02 21:07:34,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 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 21:07:34,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 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 21:07:34,053 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 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 21:07:34,053 INFO L175 Difference]: Start difference. First operand has 123 places, 119 transitions, 604 flow. Second operand 4 states and 372 transitions. [2022-11-02 21:07:34,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 138 transitions, 881 flow [2022-11-02 21:07:34,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 138 transitions, 827 flow, removed 23 selfloop flow, removed 3 redundant places. [2022-11-02 21:07:34,065 INFO L231 Difference]: Finished difference. Result has 124 places, 123 transitions, 657 flow [2022-11-02 21:07:34,066 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=657, PETRI_PLACES=124, PETRI_TRANSITIONS=123} [2022-11-02 21:07:34,067 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 28 predicate places. [2022-11-02 21:07:34,067 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 123 transitions, 657 flow [2022-11-02 21:07:34,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 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 21:07:34,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:34,068 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] [2022-11-02 21:07:34,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:34,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 21:07:34,281 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:07:34,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:34,281 INFO L85 PathProgramCache]: Analyzing trace with hash 7944919, now seen corresponding path program 2 times [2022-11-02 21:07:34,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:34,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764964622] [2022-11-02 21:07:34,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:34,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:07:34,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:34,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764964622] [2022-11-02 21:07:34,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764964622] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:34,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879911381] [2022-11-02 21:07:34,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:07:34,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:34,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:34,494 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:34,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:07:34,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:07:34,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:07:34,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 21:07:34,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:07:34,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:07:34,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879911381] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:34,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:34,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2022-11-02 21:07:34,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684504638] [2022-11-02 21:07:34,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:34,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:07:34,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:34,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:07:34,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:07:34,898 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2022-11-02 21:07:34,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 123 transitions, 657 flow. Second operand has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 0 states have call successors, (0), 0 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 21:07:34,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:34,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2022-11-02 21:07:34,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:36,073 INFO L130 PetriNetUnfolder]: 3119/6597 cut-off events. [2022-11-02 21:07:36,073 INFO L131 PetriNetUnfolder]: For 24775/26879 co-relation queries the response was YES. [2022-11-02 21:07:36,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24803 conditions, 6597 events. 3119/6597 cut-off events. For 24775/26879 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 57161 event pairs, 348 based on Foata normal form. 334/6564 useless extension candidates. Maximal degree in co-relation 24782. Up to 1819 conditions per place. [2022-11-02 21:07:36,165 INFO L137 encePairwiseOnDemand]: 98/107 looper letters, 106 selfloop transitions, 61 changer transitions 1/245 dead transitions. [2022-11-02 21:07:36,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 245 transitions, 2057 flow [2022-11-02 21:07:36,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:07:36,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 21:07:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 918 transitions. [2022-11-02 21:07:36,168 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8579439252336448 [2022-11-02 21:07:36,169 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 918 transitions. [2022-11-02 21:07:36,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 918 transitions. [2022-11-02 21:07:36,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:36,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 918 transitions. [2022-11-02 21:07:36,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.8) internal successors, (918), 10 states have internal predecessors, (918), 0 states have call successors, (0), 0 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 21:07:36,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 0 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 21:07:36,174 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 0 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 21:07:36,175 INFO L175 Difference]: Start difference. First operand has 124 places, 123 transitions, 657 flow. Second operand 10 states and 918 transitions. [2022-11-02 21:07:36,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 245 transitions, 2057 flow [2022-11-02 21:07:36,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 245 transitions, 2016 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:36,196 INFO L231 Difference]: Finished difference. Result has 139 places, 171 transitions, 1399 flow [2022-11-02 21:07:36,196 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1399, PETRI_PLACES=139, PETRI_TRANSITIONS=171} [2022-11-02 21:07:36,197 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 43 predicate places. [2022-11-02 21:07:36,197 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 171 transitions, 1399 flow [2022-11-02 21:07:36,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 0 states have call successors, (0), 0 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 21:07:36,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:36,198 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] [2022-11-02 21:07:36,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:36,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:36,413 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:07:36,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:36,413 INFO L85 PathProgramCache]: Analyzing trace with hash 598957769, now seen corresponding path program 3 times [2022-11-02 21:07:36,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:36,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565953628] [2022-11-02 21:07:36,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:36,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:36,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:36,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565953628] [2022-11-02 21:07:36,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565953628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:36,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:36,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:07:36,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914486666] [2022-11-02 21:07:36,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:36,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:07:36,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:36,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:07:36,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:07:36,618 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2022-11-02 21:07:36,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 171 transitions, 1399 flow. Second operand has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 0 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 21:07:36,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:36,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2022-11-02 21:07:36,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:38,021 INFO L130 PetriNetUnfolder]: 3264/6851 cut-off events. [2022-11-02 21:07:38,021 INFO L131 PetriNetUnfolder]: For 42247/44861 co-relation queries the response was YES. [2022-11-02 21:07:38,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29973 conditions, 6851 events. 3264/6851 cut-off events. For 42247/44861 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 58832 event pairs, 846 based on Foata normal form. 361/6818 useless extension candidates. Maximal degree in co-relation 29945. Up to 2223 conditions per place. [2022-11-02 21:07:38,203 INFO L137 encePairwiseOnDemand]: 99/107 looper letters, 97 selfloop transitions, 51 changer transitions 2/227 dead transitions. [2022-11-02 21:07:38,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 227 transitions, 2326 flow [2022-11-02 21:07:38,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:07:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 21:07:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions. [2022-11-02 21:07:38,206 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8566978193146417 [2022-11-02 21:07:38,206 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 550 transitions. [2022-11-02 21:07:38,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 550 transitions. [2022-11-02 21:07:38,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:38,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 550 transitions. [2022-11-02 21:07:38,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 0 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 21:07:38,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 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 21:07:38,211 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 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 21:07:38,212 INFO L175 Difference]: Start difference. First operand has 139 places, 171 transitions, 1399 flow. Second operand 6 states and 550 transitions. [2022-11-02 21:07:38,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 227 transitions, 2326 flow [2022-11-02 21:07:38,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 227 transitions, 2320 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-02 21:07:38,303 INFO L231 Difference]: Finished difference. Result has 147 places, 190 transitions, 1866 flow [2022-11-02 21:07:38,304 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1393, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1866, PETRI_PLACES=147, PETRI_TRANSITIONS=190} [2022-11-02 21:07:38,304 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 51 predicate places. [2022-11-02 21:07:38,305 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 190 transitions, 1866 flow [2022-11-02 21:07:38,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 0 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 21:07:38,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:38,306 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] [2022-11-02 21:07:38,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:07:38,306 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:07:38,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:38,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1841713370, now seen corresponding path program 1 times [2022-11-02 21:07:38,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:38,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221385666] [2022-11-02 21:07:38,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:38,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:38,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:38,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221385666] [2022-11-02 21:07:38,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221385666] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:38,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786944844] [2022-11-02 21:07:38,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:38,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:38,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:38,884 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:38,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:07:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:39,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 21:07:39,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:39,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:39,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:39,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786944844] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:39,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:39,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 15 [2022-11-02 21:07:39,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164861729] [2022-11-02 21:07:39,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:39,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 21:07:39,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:39,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 21:07:39,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:07:39,912 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2022-11-02 21:07:39,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 190 transitions, 1866 flow. Second operand has 15 states, 15 states have (on average 83.53333333333333) internal successors, (1253), 15 states have internal predecessors, (1253), 0 states have call successors, (0), 0 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 21:07:39,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:39,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2022-11-02 21:07:39,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:40,667 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][148], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 134#(= thread3Thread1of1ForFork0_~i~2 0), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (+ (div ~c~0 4294967296) (div (- ~c~0) 4294967296)))), 94#L76-2true, Black: 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, 1225#true, 45#L50-2true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 116#true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 705#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 64#L59true, Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 706#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:40,668 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-11-02 21:07:40,668 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 21:07:40,668 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 21:07:40,669 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 21:07:40,719 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([269] L58-3-->L58-4: Formula: (= v_thread3Thread1of1ForFork0_~i~2_9 (+ |v_thread3Thread1of1ForFork0_#t~post3_3| 1)) InVars {thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_3|} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2][134], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (+ (div ~c~0 4294967296) (div (- ~c~0) 4294967296)))), 701#true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 69#L58-4true, Black: 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, 1215#true, 1225#true, 45#L50-2true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 6#L42-6true, 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 116#true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 705#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 487#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 706#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true]) [2022-11-02 21:07:40,719 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-11-02 21:07:40,719 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 21:07:40,720 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 21:07:40,720 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 21:07:40,720 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([269] L58-3-->L58-4: Formula: (= v_thread3Thread1of1ForFork0_~i~2_9 (+ |v_thread3Thread1of1ForFork0_#t~post3_3| 1)) InVars {thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_3|} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2][165], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (+ (div ~c~0 4294967296) (div (- ~c~0) 4294967296)))), 701#true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 69#L58-4true, 49#L42-4true, Black: 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, 1215#true, 1225#true, 45#L50-2true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 116#true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 705#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 487#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 706#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true]) [2022-11-02 21:07:40,720 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2022-11-02 21:07:40,720 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-11-02 21:07:40,721 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-11-02 21:07:40,721 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 21:07:40,723 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([244] L42-5-->L43: Formula: (< (mod v_thread1Thread1of1ForFork1_~i~0_5 4294967296) (mod v_~c~0_2 4294967296)) InVars {~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[][44], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (+ (div ~c~0 4294967296) (div (- ~c~0) 4294967296)))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 62#L43true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, 116#true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 705#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 64#L59true, Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 706#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true]) [2022-11-02 21:07:40,723 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 21:07:40,723 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:40,723 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:40,724 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:40,761 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][117], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1204#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), 118#(= ~x_1~0 0), Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (+ (div ~c~0 4294967296) (div (- ~c~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1215#true, 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 62#L43true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, Black: 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), Black: 705#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 64#L59true, Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 706#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true]) [2022-11-02 21:07:40,761 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 21:07:40,761 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:40,762 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:40,762 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:40,767 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][148], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 134#(= thread3Thread1of1ForFork0_~i~2 0), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 94#L76-2true, Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (+ (div ~c~0 4294967296) (div (- ~c~0) 4294967296)))), Black: 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, 1225#true, 45#L50-2true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 116#true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 705#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 706#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:40,767 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-11-02 21:07:40,767 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 21:07:40,768 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 21:07:40,768 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 21:07:40,768 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:40,768 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][148], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 134#(= thread3Thread1of1ForFork0_~i~2 0), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 94#L76-2true, Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (+ (div ~c~0 4294967296) (div (- ~c~0) 4294967296)))), Black: 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, 1225#true, 45#L50-2true, 68#L58-2true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 116#true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 705#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 706#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:40,769 INFO L383 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-11-02 21:07:40,769 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:40,769 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:40,769 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:40,775 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][148], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 134#(= thread3Thread1of1ForFork0_~i~2 0), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 94#L76-2true, Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (+ (div ~c~0 4294967296) (div (- ~c~0) 4294967296)))), Black: 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, 1225#true, 45#L50-2true, 68#L58-2true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 116#true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), Black: 705#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 706#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:40,776 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2022-11-02 21:07:40,776 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:40,776 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:40,776 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:40,777 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:40,786 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][148], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 134#(= thread3Thread1of1ForFork0_~i~2 0), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 94#L76-2true, Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (+ (div ~c~0 4294967296) (div (- ~c~0) 4294967296)))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, 68#L58-2true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 116#true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 705#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 706#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:40,786 INFO L383 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-11-02 21:07:40,786 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:40,786 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:40,787 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:40,801 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][148], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 134#(= thread3Thread1of1ForFork0_~i~2 0), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (+ (div ~c~0 4294967296) (div (- ~c~0) 4294967296)))), 94#L76-2true, 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 45#L50-2true, 1225#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 116#true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 705#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 706#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:40,801 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-11-02 21:07:40,801 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:40,801 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 21:07:40,801 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:40,813 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][148], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 134#(= thread3Thread1of1ForFork0_~i~2 0), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (+ (div ~c~0 4294967296) (div (- ~c~0) 4294967296)))), 94#L76-2true, 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, 68#L58-2true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 116#true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 705#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 706#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:40,814 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-11-02 21:07:40,814 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:40,814 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:40,814 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:40,899 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][148], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 134#(= thread3Thread1of1ForFork0_~i~2 0), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (+ (div ~c~0 4294967296) (div (- ~c~0) 4294967296)))), 94#L76-2true, 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, 68#L58-2true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 116#true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), Black: 705#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 706#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:40,899 INFO L383 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-11-02 21:07:40,899 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:40,900 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 21:07:40,900 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:40,900 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:40,900 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][148], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 134#(= thread3Thread1of1ForFork0_~i~2 0), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 94#L76-2true, Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (+ (div ~c~0 4294967296) (div (- ~c~0) 4294967296)))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 116#true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), Black: 705#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 64#L59true, Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 706#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:40,900 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-11-02 21:07:40,901 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:40,901 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 21:07:40,901 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:40,901 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:41,238 INFO L130 PetriNetUnfolder]: 1947/5842 cut-off events. [2022-11-02 21:07:41,239 INFO L131 PetriNetUnfolder]: For 25987/29107 co-relation queries the response was YES. [2022-11-02 21:07:41,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21744 conditions, 5842 events. 1947/5842 cut-off events. For 25987/29107 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 57761 event pairs, 251 based on Foata normal form. 155/5686 useless extension candidates. Maximal degree in co-relation 21712. Up to 1189 conditions per place. [2022-11-02 21:07:41,346 INFO L137 encePairwiseOnDemand]: 94/107 looper letters, 41 selfloop transitions, 31 changer transitions 8/244 dead transitions. [2022-11-02 21:07:41,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 244 transitions, 2209 flow [2022-11-02 21:07:41,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 21:07:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-02 21:07:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1540 transitions. [2022-11-02 21:07:41,358 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7995846313603323 [2022-11-02 21:07:41,358 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1540 transitions. [2022-11-02 21:07:41,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1540 transitions. [2022-11-02 21:07:41,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:41,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1540 transitions. [2022-11-02 21:07:41,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 85.55555555555556) internal successors, (1540), 18 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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 21:07:41,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 107.0) internal successors, (2033), 19 states have internal predecessors, (2033), 0 states have call successors, (0), 0 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 21:07:41,368 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 107.0) internal successors, (2033), 19 states have internal predecessors, (2033), 0 states have call successors, (0), 0 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 21:07:41,369 INFO L175 Difference]: Start difference. First operand has 147 places, 190 transitions, 1866 flow. Second operand 18 states and 1540 transitions. [2022-11-02 21:07:41,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 244 transitions, 2209 flow [2022-11-02 21:07:41,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 244 transitions, 2046 flow, removed 50 selfloop flow, removed 6 redundant places. [2022-11-02 21:07:41,430 INFO L231 Difference]: Finished difference. Result has 163 places, 211 transitions, 1895 flow [2022-11-02 21:07:41,430 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1703, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1895, PETRI_PLACES=163, PETRI_TRANSITIONS=211} [2022-11-02 21:07:41,432 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 67 predicate places. [2022-11-02 21:07:41,432 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 211 transitions, 1895 flow [2022-11-02 21:07:41,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 83.53333333333333) internal successors, (1253), 15 states have internal predecessors, (1253), 0 states have call successors, (0), 0 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 21:07:41,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:41,433 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] [2022-11-02 21:07:41,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:41,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 21:07:41,649 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:07:41,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:41,649 INFO L85 PathProgramCache]: Analyzing trace with hash 847330504, now seen corresponding path program 2 times [2022-11-02 21:07:41,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:41,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877376207] [2022-11-02 21:07:41,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:41,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:42,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:42,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877376207] [2022-11-02 21:07:42,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877376207] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:42,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935577097] [2022-11-02 21:07:42,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:07:42,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:42,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:42,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:42,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 21:07:42,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:07:42,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:07:42,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 21:07:42,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:42,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:07:43,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935577097] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:43,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:43,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 17 [2022-11-02 21:07:43,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621934801] [2022-11-02 21:07:43,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:43,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 21:07:43,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:43,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 21:07:43,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:07:43,159 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2022-11-02 21:07:43,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 211 transitions, 1895 flow. Second operand has 17 states, 17 states have (on average 83.52941176470588) internal successors, (1420), 17 states have internal predecessors, (1420), 0 states have call successors, (0), 0 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 21:07:43,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:43,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2022-11-02 21:07:43,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:43,509 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([244] L42-5-->L43: Formula: (< (mod v_thread1Thread1of1ForFork1_~i~0_5 4294967296) (mod v_~c~0_2 4294967296)) InVars {~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[][44], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 56#L74-4true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 701#true, 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 62#L43true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 116#true, Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 40#L51true, Black: 1773#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1769#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1775#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:43,509 INFO L383 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2022-11-02 21:07:43,510 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-11-02 21:07:43,510 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-11-02 21:07:43,510 INFO L386 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2022-11-02 21:07:43,848 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][157], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 49#L42-4true, Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 1783#true, 26#L58-5true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 116#true, 40#L51true, Black: 1773#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1769#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1775#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true, Black: 182#(= thread2Thread1of1ForFork2_~i~1 0)]) [2022-11-02 21:07:43,848 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2022-11-02 21:07:43,848 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-11-02 21:07:43,849 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-11-02 21:07:43,849 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 21:07:43,917 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([244] L42-5-->L43: Formula: (< (mod v_thread1Thread1of1ForFork1_~i~0_5 4294967296) (mod v_~c~0_2 4294967296)) InVars {~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[][44], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 701#true, 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 75#thread3ENTRYtrue, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 62#L43true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 116#true, 40#L51true, Black: 1773#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1769#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1775#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true, Black: 182#(= thread2Thread1of1ForFork2_~i~1 0)]) [2022-11-02 21:07:43,917 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2022-11-02 21:07:43,918 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:43,918 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-11-02 21:07:43,918 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-11-02 21:07:43,918 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([261] thread3ENTRY-->L58-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2][83], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 1217#(= thread3Thread1of1ForFork0_~i~2 0), 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 49#L42-4true, Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 1783#true, 26#L58-5true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 116#true, 40#L51true, Black: 1773#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1769#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1775#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true, Black: 182#(= thread2Thread1of1ForFork2_~i~1 0)]) [2022-11-02 21:07:43,918 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2022-11-02 21:07:43,919 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-11-02 21:07:43,919 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 21:07:43,919 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-11-02 21:07:43,943 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][61], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 706#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 26#L58-5true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 62#L43true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 116#true, 40#L51true, Black: 1773#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1769#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1775#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true]) [2022-11-02 21:07:43,944 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-11-02 21:07:43,944 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 21:07:43,944 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 21:07:43,944 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 21:07:43,955 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][156], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 6#L42-6true, 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 1231#(and (<= (+ ~x_1~0 ~b~0) ~x_3~0) (= ~x_2~0 0) (<= ~x_3~0 (+ ~x_1~0 ~b~0))), Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 40#L51true, 116#true, Black: 1773#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1769#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1775#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 64#L59true, Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true]) [2022-11-02 21:07:43,955 INFO L383 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2022-11-02 21:07:43,955 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:43,955 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:43,956 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:43,960 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][61], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 701#true, 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 1783#true, 26#L58-5true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 62#L43true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 116#true, 40#L51true, Black: 1773#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1769#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1775#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true, Black: 182#(= thread2Thread1of1ForFork2_~i~1 0)]) [2022-11-02 21:07:43,960 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-11-02 21:07:43,961 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 21:07:43,961 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 21:07:43,961 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 21:07:44,020 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][61], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 6#L42-6true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 116#true, 40#L51true, Black: 1773#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1769#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1775#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true, Black: 182#(= thread2Thread1of1ForFork2_~i~1 0)]) [2022-11-02 21:07:44,020 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 21:07:44,021 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:44,021 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:44,021 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:44,053 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([244] L42-5-->L43: Formula: (< (mod v_thread1Thread1of1ForFork1_~i~0_5 4294967296) (mod v_~c~0_2 4294967296)) InVars {~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[][44], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 706#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 62#L43true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 116#true, Black: 1773#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1769#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1775#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 89#L75-4true, Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:44,053 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 21:07:44,053 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:44,054 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:44,054 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:44,091 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][122], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), 1204#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), 118#(= ~x_1~0 0), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1785#(= ~x_1~0 0), 62#L43true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1773#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1769#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1775#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true]) [2022-11-02 21:07:44,092 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 21:07:44,092 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:44,092 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:44,092 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:44,141 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][61], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), 118#(= ~x_1~0 0), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 69#L58-4true, 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1785#(= ~x_1~0 0), 62#L43true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 40#L51true, Black: 1773#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1769#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1775#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 89#L75-4true, Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:44,141 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2022-11-02 21:07:44,141 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-11-02 21:07:44,141 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-11-02 21:07:44,142 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-11-02 21:07:44,146 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][178], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 94#L76-2true, 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, 68#L58-2true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 116#true, Black: 1773#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1769#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1775#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:44,147 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-11-02 21:07:44,147 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:44,147 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:44,147 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:44,267 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][178], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 94#L76-2true, 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 116#true, Black: 1773#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1769#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1775#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:44,267 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is not cut-off event [2022-11-02 21:07:44,267 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2022-11-02 21:07:44,267 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2022-11-02 21:07:44,268 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2022-11-02 21:07:44,295 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][178], [Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), 113#true, Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 94#L76-2true, 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, 68#L58-2true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1771#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 116#true, Black: 1773#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1769#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1775#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:44,295 INFO L383 tUnfolder$Statistics]: this new event has 67 ancestors and is not cut-off event [2022-11-02 21:07:44,295 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-11-02 21:07:44,295 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-11-02 21:07:44,296 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2022-11-02 21:07:44,296 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-11-02 21:07:44,670 INFO L130 PetriNetUnfolder]: 2287/7246 cut-off events. [2022-11-02 21:07:44,670 INFO L131 PetriNetUnfolder]: For 26064/29025 co-relation queries the response was YES. [2022-11-02 21:07:44,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25895 conditions, 7246 events. 2287/7246 cut-off events. For 26064/29025 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 75554 event pairs, 306 based on Foata normal form. 318/7237 useless extension candidates. Maximal degree in co-relation 25861. Up to 1465 conditions per place. [2022-11-02 21:07:44,772 INFO L137 encePairwiseOnDemand]: 95/107 looper letters, 59 selfloop transitions, 30 changer transitions 8/261 dead transitions. [2022-11-02 21:07:44,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 261 transitions, 2320 flow [2022-11-02 21:07:44,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 21:07:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-02 21:07:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1461 transitions. [2022-11-02 21:07:44,776 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8031885651456845 [2022-11-02 21:07:44,777 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1461 transitions. [2022-11-02 21:07:44,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1461 transitions. [2022-11-02 21:07:44,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:44,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1461 transitions. [2022-11-02 21:07:44,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 85.94117647058823) internal successors, (1461), 17 states have internal predecessors, (1461), 0 states have call successors, (0), 0 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 21:07:44,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 0 states have call successors, (0), 0 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 21:07:44,786 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 0 states have call successors, (0), 0 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 21:07:44,787 INFO L175 Difference]: Start difference. First operand has 163 places, 211 transitions, 1895 flow. Second operand 17 states and 1461 transitions. [2022-11-02 21:07:44,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 261 transitions, 2320 flow [2022-11-02 21:07:44,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 261 transitions, 2151 flow, removed 68 selfloop flow, removed 13 redundant places. [2022-11-02 21:07:44,881 INFO L231 Difference]: Finished difference. Result has 168 places, 226 transitions, 1936 flow [2022-11-02 21:07:44,882 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1790, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1936, PETRI_PLACES=168, PETRI_TRANSITIONS=226} [2022-11-02 21:07:44,882 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 72 predicate places. [2022-11-02 21:07:44,882 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 226 transitions, 1936 flow [2022-11-02 21:07:44,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 83.52941176470588) internal successors, (1420), 17 states have internal predecessors, (1420), 0 states have call successors, (0), 0 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 21:07:44,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:44,884 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] [2022-11-02 21:07:44,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:45,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:45,097 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:07:45,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:45,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1033789266, now seen corresponding path program 3 times [2022-11-02 21:07:45,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:45,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519239998] [2022-11-02 21:07:45,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:45,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:45,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:45,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519239998] [2022-11-02 21:07:45,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519239998] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:45,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770375060] [2022-11-02 21:07:45,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 21:07:45,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:45,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:45,532 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:45,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 21:07:45,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-02 21:07:45,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:07:45,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 21:07:45,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:46,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:46,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770375060] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:46,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:46,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 17 [2022-11-02 21:07:46,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542287422] [2022-11-02 21:07:46,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:46,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 21:07:46,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:46,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 21:07:46,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:07:46,517 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2022-11-02 21:07:46,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 226 transitions, 1936 flow. Second operand has 17 states, 17 states have (on average 83.52941176470588) internal successors, (1420), 17 states have internal predecessors, (1420), 0 states have call successors, (0), 0 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 21:07:46,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:46,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2022-11-02 21:07:46,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:47,255 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][158], [113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2327#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1783#true, Black: 2331#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 6#L42-6true, 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 1231#(and (<= (+ ~x_1~0 ~b~0) ~x_3~0) (= ~x_2~0 0) (<= ~x_3~0 (+ ~x_1~0 ~b~0))), 40#L51true, Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true]) [2022-11-02 21:07:47,256 INFO L383 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2022-11-02 21:07:47,256 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:47,256 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:47,256 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:47,491 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 94#L76-2true, 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, 68#L58-2true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2327#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2331#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1783#true, Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0)]) [2022-11-02 21:07:47,492 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-11-02 21:07:47,492 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:47,492 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:47,492 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:47,531 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][158], [113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2327#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2331#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1783#true, Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2341#true, 6#L42-6true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 64#L59true, Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 89#L75-4true, Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:47,532 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 21:07:47,532 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:47,532 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:47,532 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:47,644 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 94#L76-2true, 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2327#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2331#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1783#true, Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0)]) [2022-11-02 21:07:47,644 INFO L383 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-11-02 21:07:47,644 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:47,644 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:47,644 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:47,649 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 94#L76-2true, 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2327#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2331#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1783#true, Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0)]) [2022-11-02 21:07:47,649 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is not cut-off event [2022-11-02 21:07:47,649 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2022-11-02 21:07:47,649 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2022-11-02 21:07:47,649 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-11-02 21:07:47,649 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2022-11-02 21:07:47,675 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 94#L76-2true, 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 45#L50-2true, 1225#true, 68#L58-2true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2327#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2331#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1783#true, Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0)]) [2022-11-02 21:07:47,676 INFO L383 tUnfolder$Statistics]: this new event has 67 ancestors and is not cut-off event [2022-11-02 21:07:47,676 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-11-02 21:07:47,676 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2022-11-02 21:07:47,676 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-11-02 21:07:47,676 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-11-02 21:07:47,876 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][158], [113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2327#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 2329#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2331#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1783#true, Black: 2333#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 6#L42-6true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 2736#(< (* (div (+ (* ~x_3~0 4294967295) ~x_2~0 ~x_1~0 4294967295 (* 4294967295 ~b~0)) 4294967296) 4294967296) (+ (* ~x_3~0 4294967295) ~x_2~0 ~x_1~0 (* 4294967295 ~b~0) 1)), 40#L51true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 64#L59true, Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true, Black: 182#(= thread2Thread1of1ForFork2_~i~1 0)]) [2022-11-02 21:07:47,876 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-11-02 21:07:47,876 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:47,876 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-02 21:07:47,876 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:48,067 INFO L130 PetriNetUnfolder]: 2668/8445 cut-off events. [2022-11-02 21:07:48,068 INFO L131 PetriNetUnfolder]: For 28414/32246 co-relation queries the response was YES. [2022-11-02 21:07:48,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29464 conditions, 8445 events. 2668/8445 cut-off events. For 28414/32246 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 89935 event pairs, 453 based on Foata normal form. 255/8299 useless extension candidates. Maximal degree in co-relation 29430. Up to 1826 conditions per place. [2022-11-02 21:07:48,192 INFO L137 encePairwiseOnDemand]: 96/107 looper letters, 76 selfloop transitions, 29 changer transitions 8/277 dead transitions. [2022-11-02 21:07:48,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 277 transitions, 2407 flow [2022-11-02 21:07:48,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 21:07:48,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-02 21:07:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1378 transitions. [2022-11-02 21:07:48,196 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8049065420560748 [2022-11-02 21:07:48,197 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1378 transitions. [2022-11-02 21:07:48,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1378 transitions. [2022-11-02 21:07:48,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:48,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1378 transitions. [2022-11-02 21:07:48,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 86.125) internal successors, (1378), 16 states have internal predecessors, (1378), 0 states have call successors, (0), 0 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 21:07:48,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 0 states have call successors, (0), 0 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 21:07:48,206 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 0 states have call successors, (0), 0 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 21:07:48,207 INFO L175 Difference]: Start difference. First operand has 168 places, 226 transitions, 1936 flow. Second operand 16 states and 1378 transitions. [2022-11-02 21:07:48,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 277 transitions, 2407 flow [2022-11-02 21:07:48,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 277 transitions, 2320 flow, removed 31 selfloop flow, removed 10 redundant places. [2022-11-02 21:07:48,278 INFO L231 Difference]: Finished difference. Result has 176 places, 244 transitions, 2069 flow [2022-11-02 21:07:48,279 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1874, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2069, PETRI_PLACES=176, PETRI_TRANSITIONS=244} [2022-11-02 21:07:48,279 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 80 predicate places. [2022-11-02 21:07:48,280 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 244 transitions, 2069 flow [2022-11-02 21:07:48,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 83.52941176470588) internal successors, (1420), 17 states have internal predecessors, (1420), 0 states have call successors, (0), 0 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 21:07:48,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:48,281 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] [2022-11-02 21:07:48,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:48,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 21:07:48,497 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:07:48,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:48,497 INFO L85 PathProgramCache]: Analyzing trace with hash 104990682, now seen corresponding path program 4 times [2022-11-02 21:07:48,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:48,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523531140] [2022-11-02 21:07:48,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:48,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:48,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:48,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523531140] [2022-11-02 21:07:48,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523531140] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:48,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488856682] [2022-11-02 21:07:48,931 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 21:07:48,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:48,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:48,933 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:48,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 21:07:49,088 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 21:07:49,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:07:49,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 21:07:49,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:49,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:07:49,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488856682] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:49,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:49,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 15 [2022-11-02 21:07:49,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999626663] [2022-11-02 21:07:49,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:49,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 21:07:49,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:49,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 21:07:49,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:07:49,761 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2022-11-02 21:07:49,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 244 transitions, 2069 flow. Second operand has 15 states, 15 states have (on average 83.53333333333333) internal successors, (1253), 15 states have internal predecessors, (1253), 0 states have call successors, (0), 0 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 21:07:49,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:49,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2022-11-02 21:07:49,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:50,472 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][77], [113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 69#L58-4true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 61#L42-5true, Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 40#L51true, Black: 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 2900#(= ~x_1~0 0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 2343#(= ~x_1~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true, 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:50,473 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2022-11-02 21:07:50,473 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 21:07:50,473 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-11-02 21:07:50,473 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 21:07:50,540 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2341#true, 6#L42-6true, 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 1231#(and (<= (+ ~x_1~0 ~b~0) ~x_3~0) (= ~x_2~0 0) (<= ~x_3~0 (+ ~x_1~0 ~b~0))), 40#L51true, Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2898#true, Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true]) [2022-11-02 21:07:50,540 INFO L383 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2022-11-02 21:07:50,540 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:50,540 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:50,540 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:50,552 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 69#L58-4true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 62#L43true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 40#L51true, 2900#(= ~x_1~0 0), Black: 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 2343#(= ~x_1~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true, 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:50,552 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2022-11-02 21:07:50,552 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-11-02 21:07:50,552 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-11-02 21:07:50,552 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:50,555 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, 2900#(= ~x_1~0 0), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 76#thread1ENTRYtrue, 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 2343#(= ~x_1~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true]) [2022-11-02 21:07:50,555 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2022-11-02 21:07:50,555 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:50,555 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-11-02 21:07:50,555 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-11-02 21:07:50,557 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 69#L58-4true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 62#L43true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 40#L51true, Black: 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 2900#(= ~x_1~0 0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 2343#(= ~x_1~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true, 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:50,558 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2022-11-02 21:07:50,558 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-11-02 21:07:50,558 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-11-02 21:07:50,558 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:50,558 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:50,597 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1204#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 61#L42-5true, Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, 2900#(= ~x_1~0 0), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 64#L59true, Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 2343#(= ~x_1~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true, Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:50,597 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-11-02 21:07:50,597 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 21:07:50,597 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 21:07:50,597 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 21:07:50,616 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1204#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 61#L42-5true, Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, 2900#(= ~x_1~0 0), Black: 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 2343#(= ~x_1~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true]) [2022-11-02 21:07:50,616 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-11-02 21:07:50,616 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 21:07:50,616 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 21:07:50,616 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 21:07:50,618 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][77], [113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1204#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 61#L42-5true, Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, 2900#(= ~x_1~0 0), Black: 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 2343#(= ~x_1~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true]) [2022-11-02 21:07:50,618 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-11-02 21:07:50,618 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 21:07:50,618 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 21:07:50,619 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 21:07:50,661 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1204#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 62#L43true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, 2900#(= ~x_1~0 0), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 2343#(= ~x_1~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true, Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:50,662 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 21:07:50,662 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:50,662 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:50,662 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:50,684 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1204#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 62#L43true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, 2900#(= ~x_1~0 0), Black: 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 2343#(= ~x_1~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true]) [2022-11-02 21:07:50,684 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 21:07:50,684 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:50,684 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:50,684 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:50,695 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 94#L76-2true, Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, 1225#true, 45#L50-2true, 68#L58-2true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2898#true, Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:50,695 INFO L383 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-11-02 21:07:50,696 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:50,696 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:50,696 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:50,760 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 94#L76-2true, Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, 68#L58-2true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 2898#true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:50,760 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2022-11-02 21:07:50,761 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:50,761 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:50,761 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:50,779 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 94#L76-2true, Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, 68#L58-2true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 2898#true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0)]) [2022-11-02 21:07:50,779 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-11-02 21:07:50,780 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:50,780 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:50,780 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:50,836 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2341#true, 6#L42-6true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2898#true, Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true, Black: 182#(= thread2Thread1of1ForFork2_~i~1 0)]) [2022-11-02 21:07:50,836 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 21:07:50,836 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:50,837 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:50,837 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:50,875 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 6#L42-6true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2898#true, 64#L59true, Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true, Black: 182#(= thread2Thread1of1ForFork2_~i~1 0)]) [2022-11-02 21:07:50,875 INFO L383 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-11-02 21:07:50,875 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:50,876 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:50,876 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:50,876 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:50,909 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([244] L42-5-->L43: Formula: (< (mod v_thread1Thread1of1ForFork1_~i~0_5 4294967296) (mod v_~c~0_2 4294967296)) InVars {~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[][44], [113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 68#L58-2true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 62#L43true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 2898#true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true, Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:50,909 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2022-11-02 21:07:50,909 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 21:07:50,910 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2022-11-02 21:07:50,910 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2022-11-02 21:07:50,945 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 94#L76-2true, Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, 1225#true, 45#L50-2true, 68#L58-2true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 2898#true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:50,945 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-11-02 21:07:50,945 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:50,945 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:50,945 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:50,945 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:50,948 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 94#L76-2true, Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 2898#true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 64#L59true, Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0)]) [2022-11-02 21:07:50,948 INFO L383 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-11-02 21:07:50,948 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:50,948 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:50,948 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:50,954 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 94#L76-2true, Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 64#L59true, 2898#true, Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0)]) [2022-11-02 21:07:50,954 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is not cut-off event [2022-11-02 21:07:50,954 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2022-11-02 21:07:50,954 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2022-11-02 21:07:50,954 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2022-11-02 21:07:50,954 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-11-02 21:07:50,960 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][122], [113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1204#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 96#L42-2true, 1225#true, 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, 2341#true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 2898#true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 64#L59true, Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 89#L75-4true, Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:50,960 INFO L383 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-11-02 21:07:50,960 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2022-11-02 21:07:50,960 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 21:07:50,960 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 21:07:50,991 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 94#L76-2true, Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, 68#L58-2true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2898#true, Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0)]) [2022-11-02 21:07:50,992 INFO L383 tUnfolder$Statistics]: this new event has 67 ancestors and is not cut-off event [2022-11-02 21:07:50,992 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2022-11-02 21:07:50,992 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-11-02 21:07:50,992 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-11-02 21:07:50,992 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-11-02 21:07:51,220 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 3267#(< (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0 4294967295 (* (- 1) ~x_3~0) (* (- 1) ~b~0)) 4294967296)) ~x_3~0 ~b~0) (+ ~x_2~0 ~x_1~0 1)), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2341#true, 6#L42-6true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 89#L75-4true, Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:51,221 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-11-02 21:07:51,221 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:51,221 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-02 21:07:51,221 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:51,401 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2887#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2885#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2883#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 6#L42-6true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 2736#(< (* (div (+ (* ~x_3~0 4294967295) ~x_2~0 ~x_1~0 4294967295 (* 4294967295 ~b~0)) 4294967296) 4294967296) (+ (* ~x_3~0 4294967295) ~x_2~0 ~x_1~0 (* 4294967295 ~b~0) 1)), 40#L51true, Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 64#L59true, 2898#true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true, Black: 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:51,401 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-11-02 21:07:51,401 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:51,401 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:51,401 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-02 21:07:51,773 INFO L130 PetriNetUnfolder]: 2946/9440 cut-off events. [2022-11-02 21:07:51,773 INFO L131 PetriNetUnfolder]: For 33400/37667 co-relation queries the response was YES. [2022-11-02 21:07:51,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33819 conditions, 9440 events. 2946/9440 cut-off events. For 33400/37667 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 102782 event pairs, 536 based on Foata normal form. 355/9318 useless extension candidates. Maximal degree in co-relation 33781. Up to 2150 conditions per place. [2022-11-02 21:07:51,865 INFO L137 encePairwiseOnDemand]: 94/107 looper letters, 86 selfloop transitions, 31 changer transitions 8/289 dead transitions. [2022-11-02 21:07:51,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 289 transitions, 2582 flow [2022-11-02 21:07:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 21:07:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-02 21:07:51,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1537 transitions. [2022-11-02 21:07:51,869 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7980269989615784 [2022-11-02 21:07:51,870 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1537 transitions. [2022-11-02 21:07:51,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1537 transitions. [2022-11-02 21:07:51,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:51,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1537 transitions. [2022-11-02 21:07:51,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 85.38888888888889) internal successors, (1537), 18 states have internal predecessors, (1537), 0 states have call successors, (0), 0 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 21:07:51,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 107.0) internal successors, (2033), 19 states have internal predecessors, (2033), 0 states have call successors, (0), 0 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 21:07:51,879 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 107.0) internal successors, (2033), 19 states have internal predecessors, (2033), 0 states have call successors, (0), 0 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 21:07:51,879 INFO L175 Difference]: Start difference. First operand has 176 places, 244 transitions, 2069 flow. Second operand 18 states and 1537 transitions. [2022-11-02 21:07:51,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 289 transitions, 2582 flow [2022-11-02 21:07:51,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 289 transitions, 2473 flow, removed 48 selfloop flow, removed 7 redundant places. [2022-11-02 21:07:51,941 INFO L231 Difference]: Finished difference. Result has 189 places, 259 transitions, 2195 flow [2022-11-02 21:07:51,941 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1984, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2195, PETRI_PLACES=189, PETRI_TRANSITIONS=259} [2022-11-02 21:07:51,942 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 93 predicate places. [2022-11-02 21:07:51,942 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 259 transitions, 2195 flow [2022-11-02 21:07:51,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 83.53333333333333) internal successors, (1253), 15 states have internal predecessors, (1253), 0 states have call successors, (0), 0 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 21:07:51,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:51,943 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] [2022-11-02 21:07:51,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-02 21:07:52,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 21:07:52,157 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:07:52,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:52,157 INFO L85 PathProgramCache]: Analyzing trace with hash 551695832, now seen corresponding path program 5 times [2022-11-02 21:07:52,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:52,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158812772] [2022-11-02 21:07:52,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:52,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:52,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:52,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158812772] [2022-11-02 21:07:52,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158812772] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:52,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37980691] [2022-11-02 21:07:52,582 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 21:07:52,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:52,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:52,584 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:52,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 21:07:52,747 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-11-02 21:07:52,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:07:52,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 21:07:52,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:53,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:53,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:53,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37980691] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:53,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:53,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2022-11-02 21:07:53,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776748703] [2022-11-02 21:07:53,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:53,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 21:07:53,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:53,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 21:07:53,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:07:53,602 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2022-11-02 21:07:53,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 259 transitions, 2195 flow. Second operand has 16 states, 16 states have (on average 83.5625) internal successors, (1337), 16 states have internal predecessors, (1337), 0 states have call successors, (0), 0 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 21:07:53,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:53,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2022-11-02 21:07:53,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:54,404 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][77], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 69#L58-4true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 61#L42-5true, Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 40#L51true, Black: 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 2900#(= ~x_1~0 0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 3459#(= ~x_1~0 0), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 3446#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2343#(= ~x_1~0 0), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true, 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:54,404 INFO L383 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2022-11-02 21:07:54,404 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 21:07:54,405 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-11-02 21:07:54,405 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 21:07:54,457 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][160], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2341#true, 6#L42-6true, 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 1231#(and (<= (+ ~x_1~0 ~b~0) ~x_3~0) (= ~x_2~0 0) (<= ~x_3~0 (+ ~x_1~0 ~b~0))), 40#L51true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2898#true, Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3446#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 89#L75-4true, Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:54,457 INFO L383 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2022-11-02 21:07:54,457 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:54,457 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:54,457 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:54,472 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 69#L58-4true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 62#L43true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 40#L51true, 2900#(= ~x_1~0 0), Black: 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 3459#(= ~x_1~0 0), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 3446#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 2343#(= ~x_1~0 0), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true, Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0))), 703#(= thread1Thread1of1ForFork1_~i~0 0)]) [2022-11-02 21:07:54,472 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2022-11-02 21:07:54,472 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-11-02 21:07:54,472 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:54,472 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-11-02 21:07:54,476 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, 2900#(= ~x_1~0 0), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 3459#(= ~x_1~0 0), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 76#thread1ENTRYtrue, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 64#L59true, Black: 3446#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 2343#(= ~x_1~0 0), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true, Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:54,476 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2022-11-02 21:07:54,476 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-11-02 21:07:54,476 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-02 21:07:54,476 INFO L386 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-11-02 21:07:54,641 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, 1204#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 61#L42-5true, Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, 2900#(= ~x_1~0 0), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 3459#(= ~x_1~0 0), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 64#L59true, Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3446#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2343#(= ~x_1~0 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true, Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:54,641 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-11-02 21:07:54,641 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 21:07:54,641 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 21:07:54,641 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 21:07:54,663 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1204#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 61#L42-5true, Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, 2900#(= ~x_1~0 0), Black: 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 3459#(= ~x_1~0 0), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 64#L59true, Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3446#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 2343#(= ~x_1~0 0), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true, Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:54,663 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-11-02 21:07:54,663 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 21:07:54,663 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 21:07:54,664 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 21:07:54,665 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][77], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, 1204#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 61#L42-5true, Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, Black: 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 2900#(= ~x_1~0 0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 3459#(= ~x_1~0 0), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 64#L59true, Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3446#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 2343#(= ~x_1~0 0), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true, Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:54,665 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-11-02 21:07:54,665 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 21:07:54,665 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 21:07:54,665 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 21:07:54,712 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, 1204#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 62#L43true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, 2900#(= ~x_1~0 0), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 3459#(= ~x_1~0 0), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 64#L59true, Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3446#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2343#(= ~x_1~0 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true, Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:54,712 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 21:07:54,712 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:54,712 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:54,712 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:54,730 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1204#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1227#(= ~x_1~0 0), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 196#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 62#L43true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, 2900#(= ~x_1~0 0), Black: 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 3459#(= ~x_1~0 0), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3446#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 2343#(= ~x_1~0 0), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true, Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:54,730 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 21:07:54,730 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:54,730 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:54,730 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:54,810 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 94#L76-2true, Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, 68#L58-2true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2898#true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 3446#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:54,810 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-11-02 21:07:54,810 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:54,810 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:54,810 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:54,842 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][160], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 6#L42-6true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2898#true, 64#L59true, Black: 3446#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 89#L75-4true, Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:54,842 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 21:07:54,842 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:54,842 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:54,842 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:54,873 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][160], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 6#L42-6true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2898#true, 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 3446#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 89#L75-4true, Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:54,873 INFO L383 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-11-02 21:07:54,873 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:54,873 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:54,873 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:54,873 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:55,057 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 94#L76-2true, Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 64#L59true, 2898#true, Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3446#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:55,057 INFO L383 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-11-02 21:07:55,057 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:55,057 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:55,058 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:55,070 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 94#L76-2true, Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 45#L50-2true, 1225#true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2898#true, 64#L59true, Black: 3446#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:55,071 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is not cut-off event [2022-11-02 21:07:55,071 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2022-11-02 21:07:55,071 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2022-11-02 21:07:55,071 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-11-02 21:07:55,071 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2022-11-02 21:07:55,111 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 94#L76-2true, Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, 68#L58-2true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 2341#true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 2898#true, Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 3446#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:55,111 INFO L383 tUnfolder$Statistics]: this new event has 67 ancestors and is not cut-off event [2022-11-02 21:07:55,111 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2022-11-02 21:07:55,111 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-11-02 21:07:55,111 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-11-02 21:07:55,111 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-11-02 21:07:55,386 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][160], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 6#L42-6true, Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 2736#(< (* (div (+ (* ~x_3~0 4294967295) ~x_2~0 ~x_1~0 4294967295 (* 4294967295 ~b~0)) 4294967296) 4294967296) (+ (* ~x_3~0 4294967295) ~x_2~0 ~x_1~0 (* 4294967295 ~b~0) 1)), 40#L51true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 64#L59true, 2898#true, Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 3446#(and (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 3448#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3442#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 89#L75-4true, Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:55,387 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-11-02 21:07:55,387 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:55,387 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:55,387 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-02 21:07:55,746 INFO L130 PetriNetUnfolder]: 3313/10585 cut-off events. [2022-11-02 21:07:55,746 INFO L131 PetriNetUnfolder]: For 40538/43906 co-relation queries the response was YES. [2022-11-02 21:07:55,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39006 conditions, 10585 events. 3313/10585 cut-off events. For 40538/43906 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 117551 event pairs, 615 based on Foata normal form. 318/10407 useless extension candidates. Maximal degree in co-relation 38964. Up to 2371 conditions per place. [2022-11-02 21:07:55,904 INFO L137 encePairwiseOnDemand]: 96/107 looper letters, 104 selfloop transitions, 31 changer transitions 8/307 dead transitions. [2022-11-02 21:07:55,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 307 transitions, 2814 flow [2022-11-02 21:07:55,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 21:07:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-02 21:07:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1375 transitions. [2022-11-02 21:07:55,908 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8031542056074766 [2022-11-02 21:07:55,908 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1375 transitions. [2022-11-02 21:07:55,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1375 transitions. [2022-11-02 21:07:55,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:55,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1375 transitions. [2022-11-02 21:07:55,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 85.9375) internal successors, (1375), 16 states have internal predecessors, (1375), 0 states have call successors, (0), 0 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 21:07:55,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 0 states have call successors, (0), 0 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 21:07:55,918 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 0 states have call successors, (0), 0 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 21:07:55,919 INFO L175 Difference]: Start difference. First operand has 189 places, 259 transitions, 2195 flow. Second operand 16 states and 1375 transitions. [2022-11-02 21:07:55,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 307 transitions, 2814 flow [2022-11-02 21:07:55,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 307 transitions, 2671 flow, removed 56 selfloop flow, removed 11 redundant places. [2022-11-02 21:07:56,003 INFO L231 Difference]: Finished difference. Result has 196 places, 277 transitions, 2339 flow [2022-11-02 21:07:56,004 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=2079, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2339, PETRI_PLACES=196, PETRI_TRANSITIONS=277} [2022-11-02 21:07:56,004 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 100 predicate places. [2022-11-02 21:07:56,004 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 277 transitions, 2339 flow [2022-11-02 21:07:56,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 83.5625) internal successors, (1337), 16 states have internal predecessors, (1337), 0 states have call successors, (0), 0 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 21:07:56,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:56,006 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] [2022-11-02 21:07:56,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:56,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-02 21:07:56,222 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:07:56,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash 657720660, now seen corresponding path program 6 times [2022-11-02 21:07:56,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:56,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118478351] [2022-11-02 21:07:56,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:56,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:56,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:56,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:56,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118478351] [2022-11-02 21:07:56,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118478351] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:56,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576910618] [2022-11-02 21:07:56,767 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-02 21:07:56,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:56,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:56,769 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:56,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 21:07:56,946 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-02 21:07:56,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:07:56,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 21:07:56,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:57,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:07:57,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576910618] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:57,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:57,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2022-11-02 21:07:57,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740266829] [2022-11-02 21:07:57,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:57,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 21:07:57,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:57,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 21:07:57,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:07:57,710 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2022-11-02 21:07:57,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 277 transitions, 2339 flow. Second operand has 16 states, 16 states have (on average 83.625) internal successors, (1338), 16 states have internal predecessors, (1338), 0 states have call successors, (0), 0 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 21:07:57,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:57,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2022-11-02 21:07:57,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:58,631 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][159], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 4013#true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3462#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 3671#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3998#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2341#true, 6#L42-6true, Black: 3747#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 4004#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 4000#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 4002#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1231#(and (<= (+ ~x_1~0 ~b~0) ~x_3~0) (= ~x_2~0 0) (<= ~x_3~0 (+ ~x_1~0 ~b~0))), 40#L51true, Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2898#true, Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 89#L75-4true, Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:58,632 INFO L383 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2022-11-02 21:07:58,632 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:58,632 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:58,632 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-02 21:07:58,976 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][153], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 94#L76-2true, Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 45#L50-2true, 1225#true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 4013#true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3462#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 3671#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3998#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2341#true, Black: 3747#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 4004#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 4000#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 4002#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2898#true, Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:58,976 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-11-02 21:07:58,976 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:58,976 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 21:07:58,976 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:59,013 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][153], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 94#L76-2true, Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 45#L50-2true, 1225#true, 68#L58-2true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 4013#true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3462#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 3671#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3998#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2341#true, Black: 3747#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 4004#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 4000#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 4002#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2898#true, Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:59,013 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-11-02 21:07:59,013 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:59,013 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:59,013 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:59,060 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([244] L42-5-->L43: Formula: (< (mod v_thread1Thread1of1ForFork1_~i~0_5 4294967296) (mod v_~c~0_2 4294967296)) InVars {~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[][44], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 4013#true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3462#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 3671#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3998#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3747#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 62#L43true, Black: 4004#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 4000#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 4002#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 40#L51true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true, Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2341#true, Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 64#L59true, Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2898#true, Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:59,060 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-02 21:07:59,060 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:59,060 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:59,060 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 21:07:59,071 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([269] L58-3-->L58-4: Formula: (= v_thread3Thread1of1ForFork0_~i~2_9 (+ |v_thread3Thread1of1ForFork0_#t~post3_3| 1)) InVars {thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_3|} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2][171], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 45#L50-2true, 1225#true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 4013#true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3462#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 3671#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3998#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3747#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 4004#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 4000#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 4002#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true, Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 701#true, 69#L58-4true, Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 49#L42-4true, 2341#true, 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2898#true, Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:59,071 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-11-02 21:07:59,071 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 21:07:59,072 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 21:07:59,072 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 21:07:59,072 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([269] L58-3-->L58-4: Formula: (= v_thread3Thread1of1ForFork0_~i~2_9 (+ |v_thread3Thread1of1ForFork0_#t~post3_3| 1)) InVars {thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_3|} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2][138], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 45#L50-2true, 1225#true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 4013#true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3462#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 3671#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3998#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3747#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 6#L42-6true, Black: 4004#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 4000#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 4002#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true, Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 701#true, 69#L58-4true, Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2341#true, 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2898#true, Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:59,072 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-02 21:07:59,072 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 21:07:59,072 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 21:07:59,072 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 21:07:59,187 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][159], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 4013#true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3462#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 3671#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3998#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 6#L42-6true, Black: 3747#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 4004#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4000#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 4002#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 89#L75-4true, Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2341#true, Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 64#L59true, Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2898#true, Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:59,187 INFO L383 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-11-02 21:07:59,187 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:59,187 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:59,187 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:59,211 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][153], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 94#L76-2true, Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 4013#true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3462#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 3671#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3998#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2341#true, Black: 3747#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 4004#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4000#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 4002#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2898#true, 64#L59true, Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:59,212 INFO L383 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-11-02 21:07:59,212 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:59,212 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 21:07:59,212 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:59,212 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:07:59,218 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][153], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 94#L76-2true, Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 45#L50-2true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 4013#true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3462#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 3671#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3998#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2341#true, Black: 3747#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 4004#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4000#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 4002#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 64#L59true, 2898#true, Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:59,219 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is not cut-off event [2022-11-02 21:07:59,219 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2022-11-02 21:07:59,219 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-11-02 21:07:59,219 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2022-11-02 21:07:59,219 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-11-02 21:07:59,219 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2022-11-02 21:07:59,219 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][153], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 94#L76-2true, Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 45#L50-2true, 1225#true, 68#L58-2true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 4013#true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3462#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 3671#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3998#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2341#true, Black: 3747#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 4004#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4000#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 4002#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 1220#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2898#true, Black: 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:59,219 INFO L383 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-11-02 21:07:59,219 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:59,220 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 21:07:59,220 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:59,220 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 21:07:59,271 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][159], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 4013#true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3462#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 3671#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 3998#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3747#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 6#L42-6true, Black: 4004#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 4000#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4002#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), 40#L51true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true, Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2341#true, Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 64#L59true, 2898#true, Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:59,271 INFO L383 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-11-02 21:07:59,271 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:59,271 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:59,271 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:59,271 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:59,760 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][159], [Black: 2905#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 145#true, Black: 148#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), 1225#true, 3457#true, Black: 2074#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1968#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 4013#true, 1783#true, Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3462#(and (= ~x_2~0 0) (<= (+ ~b~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~b~0 ~a~0))), Black: 3671#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 995#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3998#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3747#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 6#L42-6true, Black: 4004#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4000#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 169#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 168#(= thread2Thread1of1ForFork2_~i~1 0), Black: 4002#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 40#L51true, Black: 176#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 701#true, Black: 1068#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)), 175#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 704#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 203#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), Black: 1202#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) 1)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 182#(= thread2Thread1of1ForFork2_~i~1 0), 89#L75-4true, Black: 703#(= thread1Thread1of1ForFork1_~i~0 0), 113#true, Black: 195#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1217#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1219#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) thread1Thread1of1ForFork1_~i~0 1) (+ (* (div thread1Thread1of1ForFork1_~i~0 4294967296) 4294967296) ~c~0)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2346#(and (<= ~b~0 ~x_2~0) (<= ~x_2~0 ~b~0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2565#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2736#(< (* (div (+ (* ~x_3~0 4294967295) ~x_2~0 ~x_1~0 4294967295 (* 4294967295 ~b~0)) 4294967296) 4294967296) (+ (* ~x_3~0 4294967295) ~x_2~0 ~x_1~0 (* 4294967295 ~b~0) 1)), Black: 1433#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), Black: 1232#(= (+ ~x_2~0 ~x_1~0 (* (div ~x_3~0 4294967296) 4294967296)) (+ ~x_3~0 (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)))), 64#L59true, Black: 3082#(and (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~x_2~0 ~x_1~0))), 2898#true, Black: 2904#(and (<= (+ ~x_2~0 ~a~0) ~x_3~0) (= ~x_1~0 0) (<= ~x_3~0 (+ ~x_2~0 ~a~0)))]) [2022-11-02 21:07:59,760 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-11-02 21:07:59,760 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:59,760 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:07:59,761 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-02 21:08:00,055 INFO L130 PetriNetUnfolder]: 3608/11435 cut-off events. [2022-11-02 21:08:00,055 INFO L131 PetriNetUnfolder]: For 47069/50720 co-relation queries the response was YES. [2022-11-02 21:08:00,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43120 conditions, 11435 events. 3608/11435 cut-off events. For 47069/50720 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 128405 event pairs, 718 based on Foata normal form. 298/11170 useless extension candidates. Maximal degree in co-relation 43074. Up to 2659 conditions per place. [2022-11-02 21:08:00,352 INFO L137 encePairwiseOnDemand]: 95/107 looper letters, 117 selfloop transitions, 32 changer transitions 8/321 dead transitions. [2022-11-02 21:08:00,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 321 transitions, 3000 flow [2022-11-02 21:08:00,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 21:08:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-02 21:08:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1455 transitions. [2022-11-02 21:08:00,355 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.799890049477735 [2022-11-02 21:08:00,355 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1455 transitions. [2022-11-02 21:08:00,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1455 transitions. [2022-11-02 21:08:00,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:00,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1455 transitions. [2022-11-02 21:08:00,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 85.58823529411765) internal successors, (1455), 17 states have internal predecessors, (1455), 0 states have call successors, (0), 0 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 21:08:00,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 0 states have call successors, (0), 0 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 21:08:00,363 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 0 states have call successors, (0), 0 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 21:08:00,364 INFO L175 Difference]: Start difference. First operand has 196 places, 277 transitions, 2339 flow. Second operand 17 states and 1455 transitions. [2022-11-02 21:08:00,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 321 transitions, 3000 flow [2022-11-02 21:08:00,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 321 transitions, 2829 flow, removed 77 selfloop flow, removed 7 redundant places. [2022-11-02 21:08:00,481 INFO L231 Difference]: Finished difference. Result has 208 places, 292 transitions, 2460 flow [2022-11-02 21:08:00,481 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=2193, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2460, PETRI_PLACES=208, PETRI_TRANSITIONS=292} [2022-11-02 21:08:00,482 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 112 predicate places. [2022-11-02 21:08:00,482 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 292 transitions, 2460 flow [2022-11-02 21:08:00,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 83.625) internal successors, (1338), 16 states have internal predecessors, (1338), 0 states have call successors, (0), 0 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 21:08:00,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:00,483 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:00,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 21:08:00,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 21:08:00,684 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:08:00,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:00,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1883165631, now seen corresponding path program 7 times [2022-11-02 21:08:00,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:00,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79594606] [2022-11-02 21:08:00,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:00,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:00,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:00,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79594606] [2022-11-02 21:08:00,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79594606] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:08:00,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275938628] [2022-11-02 21:08:00,944 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-02 21:08:00,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:00,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:00,945 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:08:00,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 21:08:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:01,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 21:08:01,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:08:01,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:08:01,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:08:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:08:01,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275938628] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:08:01,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:08:01,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-02 21:08:01,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101936745] [2022-11-02 21:08:01,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:08:01,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 21:08:01,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:01,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 21:08:01,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-11-02 21:08:01,493 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 107 [2022-11-02 21:08:01,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 292 transitions, 2460 flow. Second operand has 18 states, 18 states have (on average 80.05555555555556) internal successors, (1441), 18 states have internal predecessors, (1441), 0 states have call successors, (0), 0 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 21:08:01,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:01,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 107 [2022-11-02 21:08:01,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:08:31,329 INFO L130 PetriNetUnfolder]: 54430/99657 cut-off events. [2022-11-02 21:08:31,330 INFO L131 PetriNetUnfolder]: For 433301/438912 co-relation queries the response was YES. [2022-11-02 21:08:32,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388030 conditions, 99657 events. 54430/99657 cut-off events. For 433301/438912 co-relation queries the response was YES. Maximal size of possible extension queue 3052. Compared 1013556 event pairs, 2905 based on Foata normal form. 1155/99711 useless extension candidates. Maximal degree in co-relation 387980. Up to 15323 conditions per place. [2022-11-02 21:08:32,879 INFO L137 encePairwiseOnDemand]: 91/107 looper letters, 1052 selfloop transitions, 985 changer transitions 0/2207 dead transitions. [2022-11-02 21:08:32,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 2207 transitions, 22514 flow [2022-11-02 21:08:32,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2022-11-02 21:08:32,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2022-11-02 21:08:33,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 16676 transitions. [2022-11-02 21:08:33,106 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.775375459152834 [2022-11-02 21:08:33,107 INFO L72 ComplementDD]: Start complementDD. Operand 201 states and 16676 transitions. [2022-11-02 21:08:33,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 16676 transitions. [2022-11-02 21:08:33,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:33,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 201 states and 16676 transitions. [2022-11-02 21:08:33,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 202 states, 201 states have (on average 82.96517412935323) internal successors, (16676), 201 states have internal predecessors, (16676), 0 states have call successors, (0), 0 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 21:08:33,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 202 states, 202 states have (on average 107.0) internal successors, (21614), 202 states have internal predecessors, (21614), 0 states have call successors, (0), 0 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 21:08:33,198 INFO L81 ComplementDD]: Finished complementDD. Result has 202 states, 202 states have (on average 107.0) internal successors, (21614), 202 states have internal predecessors, (21614), 0 states have call successors, (0), 0 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 21:08:33,199 INFO L175 Difference]: Start difference. First operand has 208 places, 292 transitions, 2460 flow. Second operand 201 states and 16676 transitions. [2022-11-02 21:08:33,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 2207 transitions, 22514 flow [2022-11-02 21:08:35,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 2207 transitions, 22355 flow, removed 70 selfloop flow, removed 9 redundant places. [2022-11-02 21:08:35,514 INFO L231 Difference]: Finished difference. Result has 548 places, 1329 transitions, 15863 flow [2022-11-02 21:08:35,515 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=2301, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=201, PETRI_FLOW=15863, PETRI_PLACES=548, PETRI_TRANSITIONS=1329} [2022-11-02 21:08:35,515 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 452 predicate places. [2022-11-02 21:08:35,516 INFO L495 AbstractCegarLoop]: Abstraction has has 548 places, 1329 transitions, 15863 flow [2022-11-02 21:08:35,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 80.05555555555556) internal successors, (1441), 18 states have internal predecessors, (1441), 0 states have call successors, (0), 0 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 21:08:35,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:35,517 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:35,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 21:08:35,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:35,722 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:08:35,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:35,723 INFO L85 PathProgramCache]: Analyzing trace with hash -434702857, now seen corresponding path program 8 times [2022-11-02 21:08:35,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:35,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955341696] [2022-11-02 21:08:35,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:35,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:08:35,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:35,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955341696] [2022-11-02 21:08:35,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955341696] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:08:35,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22486046] [2022-11-02 21:08:35,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:08:36,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:36,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:36,001 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:08:36,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb14445-44a3-47f0-b85b-8c62c918d5b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 21:08:36,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:08:36,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:08:36,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 21:08:36,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:08:36,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:08:36,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:08:36,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:08:36,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22486046] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:08:36,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:08:36,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-11-02 21:08:36,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832933577] [2022-11-02 21:08:36,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:08:36,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 21:08:36,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:36,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 21:08:36,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:08:36,530 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-11-02 21:08:36,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 1329 transitions, 15863 flow. Second operand has 17 states, 17 states have (on average 82.70588235294117) internal successors, (1406), 17 states have internal predecessors, (1406), 0 states have call successors, (0), 0 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 21:08:36,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:36,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-11-02 21:08:36,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand