./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/test-hard1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/test-hard1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP --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 782f6af95152c43f9bba17dfd450d57dc3073723e35aa3f98da1f0b96067f4d1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:10:24,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:10:24,438 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:10:24,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:10:24,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:10:24,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:10:24,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:10:24,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:10:24,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:10:24,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:10:24,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:10:24,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:10:24,474 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:10:24,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:10:24,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:10:24,476 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:10:24,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:10:24,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:10:24,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:10:24,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:10:24,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:10:24,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:10:24,480 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:10:24,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:10:24,481 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:10:24,482 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:10:24,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:10:24,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:10:24,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:10:24,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:10:24,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:10:24,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:10:24,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:10:24,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:10:24,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:10:24,486 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:10:24,487 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:10:24,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:10:24,487 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:10:24,488 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/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_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP 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 -> 782f6af95152c43f9bba17dfd450d57dc3073723e35aa3f98da1f0b96067f4d1 [2023-11-06 22:10:24,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:10:24,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:10:24,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:10:24,858 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:10:24,858 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:10:24,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/weaver/test-hard1.wvr.c [2023-11-06 22:10:28,071 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:10:28,269 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:10:28,270 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/sv-benchmarks/c/weaver/test-hard1.wvr.c [2023-11-06 22:10:28,280 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/data/db3732249/9f98234c4a2b4c7a986e5c0196d93835/FLAG61c62d8b4 [2023-11-06 22:10:28,301 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/data/db3732249/9f98234c4a2b4c7a986e5c0196d93835 [2023-11-06 22:10:28,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:10:28,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:10:28,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:10:28,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:10:28,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:10:28,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:10:28" (1/1) ... [2023-11-06 22:10:28,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c386499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:28, skipping insertion in model container [2023-11-06 22:10:28,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:10:28" (1/1) ... [2023-11-06 22:10:28,361 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:10:28,593 WARN L240 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_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/sv-benchmarks/c/weaver/test-hard1.wvr.c[3373,3386] [2023-11-06 22:10:28,598 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:28,610 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:10:28,639 WARN L240 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_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/sv-benchmarks/c/weaver/test-hard1.wvr.c[3373,3386] [2023-11-06 22:10:28,640 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:28,649 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:10:28,650 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:10:28,657 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:10:28,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:28 WrapperNode [2023-11-06 22:10:28,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:10:28,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:10:28,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:10:28,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:10:28,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:28" (1/1) ... [2023-11-06 22:10:28,677 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:28" (1/1) ... [2023-11-06 22:10:28,702 INFO L138 Inliner]: procedures = 24, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2023-11-06 22:10:28,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:10:28,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:10:28,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:10:28,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:10:28,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:28" (1/1) ... [2023-11-06 22:10:28,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:28" (1/1) ... [2023-11-06 22:10:28,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:28" (1/1) ... [2023-11-06 22:10:28,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:28" (1/1) ... [2023-11-06 22:10:28,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:28" (1/1) ... [2023-11-06 22:10:28,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:28" (1/1) ... [2023-11-06 22:10:28,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:28" (1/1) ... [2023-11-06 22:10:28,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:28" (1/1) ... [2023-11-06 22:10:28,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:10:28,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:10:28,740 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:10:28,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:10:28,741 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:28" (1/1) ... [2023-11-06 22:10:28,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:10:28,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:28,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:10:28,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:10:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:10:28,827 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-06 22:10:28,827 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-06 22:10:28,827 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-06 22:10:28,827 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-06 22:10:28,827 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-06 22:10:28,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-06 22:10:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-06 22:10:28,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-06 22:10:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:10:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:10:28,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:10:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:10:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:10:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:10:28,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:10:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:10:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:10:28,835 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:10:28,988 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:10:28,993 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:10:29,342 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:10:29,406 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:10:29,406 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 22:10:29,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:29 BoogieIcfgContainer [2023-11-06 22:10:29,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:10:29,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:10:29,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:10:29,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:10:29,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:10:28" (1/3) ... [2023-11-06 22:10:29,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58203244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:10:29, skipping insertion in model container [2023-11-06 22:10:29,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:28" (2/3) ... [2023-11-06 22:10:29,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58203244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:10:29, skipping insertion in model container [2023-11-06 22:10:29,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:29" (3/3) ... [2023-11-06 22:10:29,418 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2023-11-06 22:10:29,427 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:10:29,447 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:10:29,447 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:10:29,447 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:10:29,585 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-06 22:10:29,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 136 transitions, 300 flow [2023-11-06 22:10:29,766 INFO L124 PetriNetUnfolderBase]: 10/132 cut-off events. [2023-11-06 22:10:29,766 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 22:10:29,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 132 events. 10/132 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-06 22:10:29,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 136 transitions, 300 flow [2023-11-06 22:10:29,782 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 119 transitions, 262 flow [2023-11-06 22:10:29,786 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:10:29,801 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 119 transitions, 262 flow [2023-11-06 22:10:29,810 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 119 transitions, 262 flow [2023-11-06 22:10:29,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 119 transitions, 262 flow [2023-11-06 22:10:29,880 INFO L124 PetriNetUnfolderBase]: 10/119 cut-off events. [2023-11-06 22:10:29,880 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 22:10:29,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 119 events. 10/119 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-06 22:10:29,887 INFO L119 LiptonReduction]: Number of co-enabled transitions 1824 [2023-11-06 22:10:34,777 INFO L134 LiptonReduction]: Checked pairs total: 3486 [2023-11-06 22:10:34,777 INFO L136 LiptonReduction]: Total number of compositions: 98 [2023-11-06 22:10:34,806 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:10:34,813 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;@677ebc6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:10:34,814 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-06 22:10:34,836 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:10:34,841 INFO L124 PetriNetUnfolderBase]: 4/32 cut-off events. [2023-11-06 22:10:34,842 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 22:10:34,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:34,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:34,843 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:10:34,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:34,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2039646060, now seen corresponding path program 1 times [2023-11-06 22:10:34,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:34,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516668510] [2023-11-06 22:10:34,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:34,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:35,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:35,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516668510] [2023-11-06 22:10:35,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516668510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:35,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:35,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:10:35,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053726287] [2023-11-06 22:10:35,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:35,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:10:35,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:35,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:10:35,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:35,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 234 [2023-11-06 22:10:35,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:35,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:35,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 234 [2023-11-06 22:10:35,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:35,949 INFO L124 PetriNetUnfolderBase]: 1537/2184 cut-off events. [2023-11-06 22:10:35,949 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2023-11-06 22:10:35,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4286 conditions, 2184 events. 1537/2184 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9217 event pairs, 141 based on Foata normal form. 1/1361 useless extension candidates. Maximal degree in co-relation 3271. Up to 1733 conditions per place. [2023-11-06 22:10:35,977 INFO L140 encePairwiseOnDemand]: 228/234 looper letters, 41 selfloop transitions, 5 changer transitions 1/55 dead transitions. [2023-11-06 22:10:35,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 249 flow [2023-11-06 22:10:35,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:10:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:10:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-11-06 22:10:36,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2023-11-06 22:10:36,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-11-06 22:10:36,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-11-06 22:10:36,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:36,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-11-06 22:10:36,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:36,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:36,026 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:36,028 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 90 flow. Second operand 3 states and 387 transitions. [2023-11-06 22:10:36,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 249 flow [2023-11-06 22:10:36,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 55 transitions, 219 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-06 22:10:36,038 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 107 flow [2023-11-06 22:10:36,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2023-11-06 22:10:36,045 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2023-11-06 22:10:36,045 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 107 flow [2023-11-06 22:10:36,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:36,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:36,047 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] [2023-11-06 22:10:36,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:10:36,048 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:10:36,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:36,059 INFO L85 PathProgramCache]: Analyzing trace with hash -420003886, now seen corresponding path program 1 times [2023-11-06 22:10:36,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:36,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313780990] [2023-11-06 22:10:36,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:36,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:36,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:36,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:36,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313780990] [2023-11-06 22:10:36,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313780990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:36,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:36,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:10:36,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001077076] [2023-11-06 22:10:36,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:36,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:10:36,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:36,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:10:36,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:10:36,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 234 [2023-11-06 22:10:36,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:36,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:36,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 234 [2023-11-06 22:10:36,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:37,380 INFO L124 PetriNetUnfolderBase]: 2729/3838 cut-off events. [2023-11-06 22:10:37,380 INFO L125 PetriNetUnfolderBase]: For 959/959 co-relation queries the response was YES. [2023-11-06 22:10:37,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9115 conditions, 3838 events. 2729/3838 cut-off events. For 959/959 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 19633 event pairs, 856 based on Foata normal form. 40/3780 useless extension candidates. Maximal degree in co-relation 2368. Up to 1800 conditions per place. [2023-11-06 22:10:37,421 INFO L140 encePairwiseOnDemand]: 227/234 looper letters, 88 selfloop transitions, 9 changer transitions 0/101 dead transitions. [2023-11-06 22:10:37,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 101 transitions, 490 flow [2023-11-06 22:10:37,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:10:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:10:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 631 transitions. [2023-11-06 22:10:37,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5393162393162393 [2023-11-06 22:10:37,426 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 631 transitions. [2023-11-06 22:10:37,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 631 transitions. [2023-11-06 22:10:37,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:37,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 631 transitions. [2023-11-06 22:10:37,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:37,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:37,437 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:37,438 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 107 flow. Second operand 5 states and 631 transitions. [2023-11-06 22:10:37,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 101 transitions, 490 flow [2023-11-06 22:10:37,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 101 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:10:37,449 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 166 flow [2023-11-06 22:10:37,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2023-11-06 22:10:37,451 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-11-06 22:10:37,451 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 166 flow [2023-11-06 22:10:37,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:37,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:37,452 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] [2023-11-06 22:10:37,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:10:37,453 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:10:37,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:37,453 INFO L85 PathProgramCache]: Analyzing trace with hash -376381494, now seen corresponding path program 2 times [2023-11-06 22:10:37,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:37,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356809754] [2023-11-06 22:10:37,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:37,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:37,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:37,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:37,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356809754] [2023-11-06 22:10:37,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356809754] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:10:37,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444133614] [2023-11-06 22:10:37,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:10:37,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:37,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:37,934 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:37,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:10:38,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:10:38,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:10:38,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:10:38,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:38,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:38,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444133614] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:38,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:10:38,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-11-06 22:10:38,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241407691] [2023-11-06 22:10:38,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:38,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:10:38,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:38,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:10:38,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:10:39,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 234 [2023-11-06 22:10:39,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 166 flow. Second operand has 14 states, 14 states have (on average 105.07142857142857) internal successors, (1471), 14 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:39,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:39,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 234 [2023-11-06 22:10:39,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:42,070 INFO L124 PetriNetUnfolderBase]: 11401/15739 cut-off events. [2023-11-06 22:10:42,070 INFO L125 PetriNetUnfolderBase]: For 12661/14290 co-relation queries the response was YES. [2023-11-06 22:10:42,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44256 conditions, 15739 events. 11401/15739 cut-off events. For 12661/14290 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 89313 event pairs, 181 based on Foata normal form. 1771/17498 useless extension candidates. Maximal degree in co-relation 26657. Up to 5269 conditions per place. [2023-11-06 22:10:42,244 INFO L140 encePairwiseOnDemand]: 222/234 looper letters, 285 selfloop transitions, 101 changer transitions 3/393 dead transitions. [2023-11-06 22:10:42,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 393 transitions, 2225 flow [2023-11-06 22:10:42,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:10:42,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-06 22:10:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2254 transitions. [2023-11-06 22:10:42,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069725596041386 [2023-11-06 22:10:42,255 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2254 transitions. [2023-11-06 22:10:42,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2254 transitions. [2023-11-06 22:10:42,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:42,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2254 transitions. [2023-11-06 22:10:42,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 118.63157894736842) internal successors, (2254), 19 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:42,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 234.0) internal successors, (4680), 20 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:42,282 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 234.0) internal successors, (4680), 20 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:42,283 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 166 flow. Second operand 19 states and 2254 transitions. [2023-11-06 22:10:42,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 393 transitions, 2225 flow [2023-11-06 22:10:42,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 393 transitions, 2191 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:10:42,321 INFO L231 Difference]: Finished difference. Result has 74 places, 166 transitions, 1273 flow [2023-11-06 22:10:42,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1273, PETRI_PLACES=74, PETRI_TRANSITIONS=166} [2023-11-06 22:10:42,323 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places. [2023-11-06 22:10:42,323 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 166 transitions, 1273 flow [2023-11-06 22:10:42,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 105.07142857142857) internal successors, (1471), 14 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:42,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:42,325 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] [2023-11-06 22:10:42,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:10:42,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:42,534 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:10:42,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:42,535 INFO L85 PathProgramCache]: Analyzing trace with hash 790402387, now seen corresponding path program 1 times [2023-11-06 22:10:42,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:42,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273562463] [2023-11-06 22:10:42,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:42,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:42,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:42,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273562463] [2023-11-06 22:10:42,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273562463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:42,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:42,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:10:42,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72217220] [2023-11-06 22:10:42,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:42,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:10:42,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:42,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:10:42,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:10:43,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 234 [2023-11-06 22:10:43,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 166 transitions, 1273 flow. Second operand has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:43,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:43,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 234 [2023-11-06 22:10:43,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:46,712 INFO L124 PetriNetUnfolderBase]: 14428/20221 cut-off events. [2023-11-06 22:10:46,712 INFO L125 PetriNetUnfolderBase]: For 61687/62708 co-relation queries the response was YES. [2023-11-06 22:10:46,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76075 conditions, 20221 events. 14428/20221 cut-off events. For 61687/62708 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 119764 event pairs, 1181 based on Foata normal form. 649/20453 useless extension candidates. Maximal degree in co-relation 73385. Up to 10068 conditions per place. [2023-11-06 22:10:46,946 INFO L140 encePairwiseOnDemand]: 226/234 looper letters, 256 selfloop transitions, 55 changer transitions 0/341 dead transitions. [2023-11-06 22:10:46,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 341 transitions, 3017 flow [2023-11-06 22:10:46,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:10:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:10:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 986 transitions. [2023-11-06 22:10:46,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5267094017094017 [2023-11-06 22:10:46,951 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 986 transitions. [2023-11-06 22:10:46,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 986 transitions. [2023-11-06 22:10:46,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:46,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 986 transitions. [2023-11-06 22:10:46,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.25) internal successors, (986), 8 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:46,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 234.0) internal successors, (2106), 9 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:46,960 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 234.0) internal successors, (2106), 9 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:46,960 INFO L175 Difference]: Start difference. First operand has 74 places, 166 transitions, 1273 flow. Second operand 8 states and 986 transitions. [2023-11-06 22:10:46,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 341 transitions, 3017 flow [2023-11-06 22:10:47,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 341 transitions, 2768 flow, removed 112 selfloop flow, removed 1 redundant places. [2023-11-06 22:10:47,536 INFO L231 Difference]: Finished difference. Result has 86 places, 192 transitions, 1531 flow [2023-11-06 22:10:47,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1531, PETRI_PLACES=86, PETRI_TRANSITIONS=192} [2023-11-06 22:10:47,538 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2023-11-06 22:10:47,538 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 192 transitions, 1531 flow [2023-11-06 22:10:47,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:47,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:47,539 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] [2023-11-06 22:10:47,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:10:47,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:10:47,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:47,540 INFO L85 PathProgramCache]: Analyzing trace with hash -776812615, now seen corresponding path program 2 times [2023-11-06 22:10:47,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:47,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087656240] [2023-11-06 22:10:47,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:47,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:47,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:47,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087656240] [2023-11-06 22:10:47,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087656240] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:10:47,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519355537] [2023-11-06 22:10:47,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:10:47,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:47,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:47,969 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:47,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:10:48,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:10:48,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:10:48,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:10:48,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:48,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:49,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519355537] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:49,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:10:49,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-11-06 22:10:49,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217171370] [2023-11-06 22:10:49,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:49,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 22:10:49,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:49,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:10:49,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:10:49,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 234 [2023-11-06 22:10:49,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 192 transitions, 1531 flow. Second operand has 15 states, 15 states have (on average 105.4) internal successors, (1581), 15 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:49,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:49,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 234 [2023-11-06 22:10:49,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:52,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:55,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:10:57,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:11:04,867 INFO L124 PetriNetUnfolderBase]: 36216/52076 cut-off events. [2023-11-06 22:11:04,867 INFO L125 PetriNetUnfolderBase]: For 231539/237162 co-relation queries the response was YES. [2023-11-06 22:11:05,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214304 conditions, 52076 events. 36216/52076 cut-off events. For 231539/237162 co-relation queries the response was YES. Maximal size of possible extension queue 2313. Compared 357924 event pairs, 1389 based on Foata normal form. 6035/57656 useless extension candidates. Maximal degree in co-relation 205155. Up to 13313 conditions per place. [2023-11-06 22:11:05,476 INFO L140 encePairwiseOnDemand]: 222/234 looper letters, 402 selfloop transitions, 532 changer transitions 7/981 dead transitions. [2023-11-06 22:11:05,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 981 transitions, 9233 flow [2023-11-06 22:11:05,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:11:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-06 22:11:05,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2714 transitions. [2023-11-06 22:11:05,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042735042735043 [2023-11-06 22:11:05,489 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2714 transitions. [2023-11-06 22:11:05,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2714 transitions. [2023-11-06 22:11:05,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:11:05,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2714 transitions. [2023-11-06 22:11:05,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 118.0) internal successors, (2714), 23 states have internal predecessors, (2714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:05,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 234.0) internal successors, (5616), 24 states have internal predecessors, (5616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:05,518 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 234.0) internal successors, (5616), 24 states have internal predecessors, (5616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:05,519 INFO L175 Difference]: Start difference. First operand has 86 places, 192 transitions, 1531 flow. Second operand 23 states and 2714 transitions. [2023-11-06 22:11:05,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 981 transitions, 9233 flow [2023-11-06 22:11:13,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 981 transitions, 8972 flow, removed 40 selfloop flow, removed 1 redundant places. [2023-11-06 22:11:13,513 INFO L231 Difference]: Finished difference. Result has 122 places, 682 transitions, 7684 flow [2023-11-06 22:11:13,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7684, PETRI_PLACES=122, PETRI_TRANSITIONS=682} [2023-11-06 22:11:13,514 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 80 predicate places. [2023-11-06 22:11:13,515 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 682 transitions, 7684 flow [2023-11-06 22:11:13,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 105.4) internal successors, (1581), 15 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:13,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:11:13,516 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] [2023-11-06 22:11:13,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 22:11:13,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_987c9ce7-9de2-4112-8bde-dd2dc4a9080d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:11:13,717 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:11:13,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:13,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1485927794, now seen corresponding path program 3 times [2023-11-06 22:11:13,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:13,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800771164] [2023-11-06 22:11:13,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:13,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:14,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:11:14,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:14,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800771164] [2023-11-06 22:11:14,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800771164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:14,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:14,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:11:14,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812076360] [2023-11-06 22:11:14,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:14,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:11:14,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:14,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:11:14,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:11:14,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 234 [2023-11-06 22:11:14,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 682 transitions, 7684 flow. Second operand has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:14,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:11:14,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 234 [2023-11-06 22:11:14,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:11:16,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([443] L74-->L67-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork3_~cond~1_13 256) 0)) (or (and (= (+ (* v_~m~0_39 2) v_~p1~0_44) v_~p1~0_43) (< 1 v_~n1~0_43) (= v_~n1~0_43 (+ v_~n1~0_42 2))) (and (<= v_~n1~0_43 1) (= v_~p1~0_44 v_~p1~0_43) (= v_~n1~0_43 v_~n1~0_42)))) InVars {~m~0=v_~m~0_39, ~p1~0=v_~p1~0_44, ~n1~0=v_~n1~0_43, thread2Thread1of1ForFork3_~cond~1=v_thread2Thread1of1ForFork3_~cond~1_13} OutVars{~m~0=v_~m~0_39, ~p1~0=v_~p1~0_43, ~n1~0=v_~n1~0_42, thread2Thread1of1ForFork3_~cond~1=v_thread2Thread1of1ForFork3_~cond~1_13} AuxVars[] AssignedVars[~p1~0, ~n1~0][80], [Black: 378#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 382#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 380#(and (= thread2Thread1of1ForFork3_~cond~1 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 44#L48-1true, 376#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 ~n2~0)), Black: 384#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 371#(<= ~n1~0 ~n2~0), 79#$Ultimate##0true, Black: 572#(and (or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 511#(or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), Black: 397#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 144#(= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)), Black: 582#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= 1 ~n2~0) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 564#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 586#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 588#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 574#(and (<= 1 ~n2~0) (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (or (and (<= 2 ~n2~0) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (and (= ~n2~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 576#(and (or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 590#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (and (<= ~n1~0 1) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0)) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 578#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 566#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 392#true, Black: 531#(or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (and (<= ~n1~0 1) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0)), Black: 149#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 580#(and (<= 1 ~n2~0) (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (or (and (<= 2 ~n2~0) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (and (= ~n2~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 153#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 155#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= thread1Thread1of1ForFork1_~cond~0 (* (div thread1Thread1of1ForFork1_~cond~0 256) 256))), Black: 201#(= thread3Thread1of1ForFork0_~cond~2 1), Black: 349#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 331#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 341#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))), Black: 343#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 337#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0)), Black: 353#(and (= thread3Thread1of1ForFork0_~cond~2 1) (or (and (<= ~n1~0 0) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0))), Black: 347#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))), 339#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 71#L67-1true, Black: 160#true, Black: 335#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0)), Black: 351#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 296#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), Black: 333#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 116#L132-4true, 396#(< 0 ~n2~0), 609#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), 129#L93true]) [2023-11-06 22:11:16,189 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2023-11-06 22:11:16,189 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-06 22:11:16,189 INFO L297 olderBase$Statistics]: existing Event has 13 ancestors and is cut-off event [2023-11-06 22:11:16,189 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-06 22:11:16,189 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L93-->L86-1: Formula: (and (or (and (= v_~n2~0_45 (+ v_~n2~0_44 1)) (< 0 v_~n2~0_45) (= (+ v_~m~0_41 v_~p2~0_44) v_~p2~0_43)) (and (= |v_thread3Thread1of1ForFork0_#t~post2_8| |v_thread3Thread1of1ForFork0_#t~post2_7|) (<= v_~n2~0_45 0) (= v_~n2~0_45 v_~n2~0_44) (= v_~p2~0_44 v_~p2~0_43))) (not (= (mod v_thread3Thread1of1ForFork0_~cond~2_13 256) 0))) InVars {~m~0=v_~m~0_41, ~n2~0=v_~n2~0_45, ~p2~0=v_~p2~0_44, thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_13, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_8|} OutVars{~m~0=v_~m~0_41, ~n2~0=v_~n2~0_44, ~p2~0=v_~p2~0_43, thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_13, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_7|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork0_#t~post2][83], [201#(= thread3Thread1of1ForFork0_~cond~2 1), Black: 378#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 382#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 376#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 ~n2~0)), Black: 380#(and (= thread2Thread1of1ForFork3_~cond~1 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 44#L48-1true, Black: 384#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 371#(<= ~n1~0 ~n2~0), 79#$Ultimate##0true, Black: 572#(and (or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 511#(or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), Black: 397#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 144#(= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)), Black: 582#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= 1 ~n2~0) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 564#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 586#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 588#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 574#(and (<= 1 ~n2~0) (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (or (and (<= 2 ~n2~0) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (and (= ~n2~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 576#(and (or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 590#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (and (<= ~n1~0 1) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0)) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 578#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 566#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 531#(or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (and (<= ~n1~0 1) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0)), 392#true, Black: 580#(and (<= 1 ~n2~0) (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (or (and (<= 2 ~n2~0) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (and (= ~n2~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 153#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 155#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= thread1Thread1of1ForFork1_~cond~0 (* (div thread1Thread1of1ForFork1_~cond~0 256) 256))), 607#true, 120#L74true, Black: 349#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 339#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 331#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 110#L86-1true, Black: 341#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))), Black: 343#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 337#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0)), Black: 353#(and (= thread3Thread1of1ForFork0_~cond~2 1) (or (and (<= ~n1~0 0) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0))), Black: 347#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))), 149#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 160#true, Black: 335#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0)), Black: 351#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 296#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), Black: 333#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 116#L132-4true]) [2023-11-06 22:11:16,190 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2023-11-06 22:11:16,190 INFO L297 olderBase$Statistics]: existing Event has 13 ancestors and is cut-off event [2023-11-06 22:11:16,190 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-06 22:11:16,190 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-11-06 22:11:17,346 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([443] L74-->L67-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork3_~cond~1_13 256) 0)) (or (and (= (+ (* v_~m~0_39 2) v_~p1~0_44) v_~p1~0_43) (< 1 v_~n1~0_43) (= v_~n1~0_43 (+ v_~n1~0_42 2))) (and (<= v_~n1~0_43 1) (= v_~p1~0_44 v_~p1~0_43) (= v_~n1~0_43 v_~n1~0_42)))) InVars {~m~0=v_~m~0_39, ~p1~0=v_~p1~0_44, ~n1~0=v_~n1~0_43, thread2Thread1of1ForFork3_~cond~1=v_thread2Thread1of1ForFork3_~cond~1_13} OutVars{~m~0=v_~m~0_39, ~p1~0=v_~p1~0_43, ~n1~0=v_~n1~0_42, thread2Thread1of1ForFork3_~cond~1=v_thread2Thread1of1ForFork3_~cond~1_13} AuxVars[] AssignedVars[~p1~0, ~n1~0][80], [Black: 378#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 382#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 380#(and (= thread2Thread1of1ForFork3_~cond~1 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 44#L48-1true, 376#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 ~n2~0)), Black: 384#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 371#(<= ~n1~0 ~n2~0), 79#$Ultimate##0true, Black: 572#(and (or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 511#(or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), Black: 397#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 144#(= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)), Black: 582#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= 1 ~n2~0) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 564#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 586#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 588#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 574#(and (<= 1 ~n2~0) (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (or (and (<= 2 ~n2~0) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (and (= ~n2~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 576#(and (or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), 67#L133-1true, Black: 590#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (and (<= ~n1~0 1) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0)) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 578#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 566#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 392#true, Black: 531#(or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (and (<= ~n1~0 1) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0)), Black: 149#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 580#(and (<= 1 ~n2~0) (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (or (and (<= 2 ~n2~0) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (and (= ~n2~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 153#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 155#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= thread1Thread1of1ForFork1_~cond~0 (* (div thread1Thread1of1ForFork1_~cond~0 256) 256))), Black: 201#(= thread3Thread1of1ForFork0_~cond~2 1), Black: 349#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 331#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 341#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))), Black: 343#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 337#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0)), Black: 353#(and (= thread3Thread1of1ForFork0_~cond~2 1) (or (and (<= ~n1~0 0) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0))), 339#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 71#L67-1true, Black: 347#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))), Black: 160#true, Black: 335#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0)), Black: 351#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 296#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), Black: 333#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 396#(< 0 ~n2~0), 609#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), 129#L93true]) [2023-11-06 22:11:17,347 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-11-06 22:11:17,347 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-06 22:11:17,347 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-11-06 22:11:17,347 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-06 22:11:17,348 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L93-->L86-1: Formula: (and (or (and (= v_~n2~0_45 (+ v_~n2~0_44 1)) (< 0 v_~n2~0_45) (= (+ v_~m~0_41 v_~p2~0_44) v_~p2~0_43)) (and (= |v_thread3Thread1of1ForFork0_#t~post2_8| |v_thread3Thread1of1ForFork0_#t~post2_7|) (<= v_~n2~0_45 0) (= v_~n2~0_45 v_~n2~0_44) (= v_~p2~0_44 v_~p2~0_43))) (not (= (mod v_thread3Thread1of1ForFork0_~cond~2_13 256) 0))) InVars {~m~0=v_~m~0_41, ~n2~0=v_~n2~0_45, ~p2~0=v_~p2~0_44, thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_13, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_8|} OutVars{~m~0=v_~m~0_41, ~n2~0=v_~n2~0_44, ~p2~0=v_~p2~0_43, thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_13, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_7|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork0_#t~post2][83], [201#(= thread3Thread1of1ForFork0_~cond~2 1), Black: 378#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 382#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 376#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 ~n2~0)), Black: 380#(and (= thread2Thread1of1ForFork3_~cond~1 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 44#L48-1true, Black: 384#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 371#(<= ~n1~0 ~n2~0), 79#$Ultimate##0true, Black: 572#(and (or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 511#(or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), Black: 397#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 144#(= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)), Black: 582#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= 1 ~n2~0) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 564#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 586#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 588#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 574#(and (<= 1 ~n2~0) (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (or (and (<= 2 ~n2~0) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (and (= ~n2~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 576#(and (or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), 67#L133-1true, Black: 590#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (and (<= ~n1~0 1) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0)) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 578#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 566#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 531#(or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (and (<= ~n1~0 1) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0)), 392#true, Black: 580#(and (<= 1 ~n2~0) (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (or (and (<= 2 ~n2~0) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (and (= ~n2~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 153#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 155#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= thread1Thread1of1ForFork1_~cond~0 (* (div thread1Thread1of1ForFork1_~cond~0 256) 256))), 607#true, 120#L74true, Black: 349#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 339#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 331#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 110#L86-1true, Black: 341#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))), Black: 343#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 337#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0)), Black: 353#(and (= thread3Thread1of1ForFork0_~cond~2 1) (or (and (<= ~n1~0 0) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0))), 149#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 347#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))), Black: 160#true, Black: 335#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0)), Black: 351#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 296#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), Black: 333#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2023-11-06 22:11:17,348 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-11-06 22:11:17,348 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-06 22:11:17,349 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-11-06 22:11:17,349 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-06 22:11:30,555 INFO L124 PetriNetUnfolderBase]: 50343/72472 cut-off events. [2023-11-06 22:11:30,555 INFO L125 PetriNetUnfolderBase]: For 622288/631029 co-relation queries the response was YES. [2023-11-06 22:11:31,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379009 conditions, 72472 events. 50343/72472 cut-off events. For 622288/631029 co-relation queries the response was YES. Maximal size of possible extension queue 3364. Compared 524693 event pairs, 7386 based on Foata normal form. 7738/79238 useless extension candidates. Maximal degree in co-relation 370662. Up to 26058 conditions per place. [2023-11-06 22:11:31,712 INFO L140 encePairwiseOnDemand]: 223/234 looper letters, 758 selfloop transitions, 739 changer transitions 0/1538 dead transitions. [2023-11-06 22:11:31,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 1538 transitions, 20560 flow [2023-11-06 22:11:31,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:11:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:11:31,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 967 transitions. [2023-11-06 22:11:31,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5165598290598291 [2023-11-06 22:11:31,720 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 967 transitions. [2023-11-06 22:11:31,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 967 transitions. [2023-11-06 22:11:31,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:11:31,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 967 transitions. [2023-11-06 22:11:31,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.875) internal successors, (967), 8 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:31,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 234.0) internal successors, (2106), 9 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:31,729 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 234.0) internal successors, (2106), 9 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:31,729 INFO L175 Difference]: Start difference. First operand has 122 places, 682 transitions, 7684 flow. Second operand 8 states and 967 transitions. [2023-11-06 22:11:31,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 1538 transitions, 20560 flow [2023-11-06 22:11:47,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 1538 transitions, 19998 flow, removed 281 selfloop flow, removed 0 redundant places. [2023-11-06 22:11:47,736 INFO L231 Difference]: Finished difference. Result has 135 places, 1291 transitions, 18135 flow [2023-11-06 22:11:47,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=7394, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=281, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=18135, PETRI_PLACES=135, PETRI_TRANSITIONS=1291} [2023-11-06 22:11:47,737 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places. [2023-11-06 22:11:47,738 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 1291 transitions, 18135 flow [2023-11-06 22:11:47,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:47,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:11:47,739 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] [2023-11-06 22:11:47,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:11:47,739 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:11:47,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:47,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1970210714, now seen corresponding path program 4 times [2023-11-06 22:11:47,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:47,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146247665] [2023-11-06 22:11:47,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:47,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:11:48,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:48,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146247665] [2023-11-06 22:11:48,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146247665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:48,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:48,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:11:48,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388570316] [2023-11-06 22:11:48,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:48,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:11:48,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:48,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:11:48,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:11:48,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 234 [2023-11-06 22:11:48,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 1291 transitions, 18135 flow. Second operand has 7 states, 7 states have (on average 109.71428571428571) internal successors, (768), 7 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:48,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:11:48,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 234 [2023-11-06 22:11:48,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:11:59,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L74-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res.offset_9| 0) (= (mod v_thread2Thread1of1ForFork3_~cond~1_15 256) 0) (= |v_thread2Thread1of1ForFork3_#res.base_9| 0)) InVars {thread2Thread1of1ForFork3_~cond~1=v_thread2Thread1of1ForFork3_~cond~1_15} OutVars{thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_9|, thread2Thread1of1ForFork3_~cond~1=v_thread2Thread1of1ForFork3_~cond~1_15, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset][217], [Black: 378#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 382#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 376#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 ~n2~0)), Black: 380#(and (= thread2Thread1of1ForFork3_~cond~1 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 384#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 371#(<= ~n1~0 ~n2~0), 153#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 144#(= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)), Black: 149#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 155#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= thread1Thread1of1ForFork1_~cond~0 (* (div thread1Thread1of1ForFork1_~cond~0 256) 256))), 52#thread2EXITtrue, 116#L132-4true, 160#true, 531#(or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (and (<= ~n1~0 1) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0)), 42#thread1EXITtrue, 94#L112true, Black: 572#(and (or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 511#(or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), Black: 397#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 582#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= 1 ~n2~0) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 564#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 586#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 588#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 574#(and (<= 1 ~n2~0) (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (or (and (<= 2 ~n2~0) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (and (= ~n2~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 576#(and (or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 590#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (and (<= ~n1~0 1) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0)) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 578#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 566#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 392#true, Black: 580#(and (<= 1 ~n2~0) (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (or (and (<= 2 ~n2~0) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (and (= ~n2~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 201#(= thread3Thread1of1ForFork0_~cond~2 1), Black: 349#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 339#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 331#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 341#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))), Black: 343#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 337#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0)), Black: 353#(and (= thread3Thread1of1ForFork0_~cond~2 1) (or (and (<= ~n1~0 0) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0))), 631#true, Black: 347#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))), Black: 335#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0)), Black: 351#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 296#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), Black: 333#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 623#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 609#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 617#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 615#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 619#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork2_~cond~3 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), 621#(and (<= ~n1~0 0) (or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork2_~cond~3 0))) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 129#L93true]) [2023-11-06 22:11:59,384 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 22:11:59,384 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-06 22:11:59,384 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-06 22:11:59,384 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:11:59,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L112-->L105-1: Formula: (and (or (and (= (+ v_~p2~0_40 (* v_~m~0_37 2)) v_~p2~0_39) (= v_~n2~0_41 (+ v_~n2~0_40 2)) (< 1 v_~n2~0_41)) (and (<= v_~n2~0_41 1) (= v_~p2~0_40 v_~p2~0_39) (= v_~n2~0_41 v_~n2~0_40))) (not (= 0 (mod v_thread4Thread1of1ForFork2_~cond~3_13 256)))) InVars {~m~0=v_~m~0_37, ~n2~0=v_~n2~0_41, ~p2~0=v_~p2~0_40, thread4Thread1of1ForFork2_~cond~3=v_thread4Thread1of1ForFork2_~cond~3_13} OutVars{~m~0=v_~m~0_37, ~n2~0=v_~n2~0_40, ~p2~0=v_~p2~0_39, thread4Thread1of1ForFork2_~cond~3=v_thread4Thread1of1ForFork2_~cond~3_13} AuxVars[] AssignedVars[~n2~0, ~p2~0][658], [30#L105-1true, Black: 378#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 382#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 376#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 ~n2~0)), Black: 380#(and (= thread2Thread1of1ForFork3_~cond~1 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 384#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 371#(<= ~n1~0 ~n2~0), Black: 144#(= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)), Black: 153#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 155#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= thread1Thread1of1ForFork1_~cond~0 (* (div thread1Thread1of1ForFork1_~cond~0 256) 256))), 617#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 116#L132-4true, 160#true, 42#thread1EXITtrue, Black: 572#(and (or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 397#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 582#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= 1 ~n2~0) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 564#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 586#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 588#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 574#(and (<= 1 ~n2~0) (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (or (and (<= 2 ~n2~0) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (and (= ~n2~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 576#(and (or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 590#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (and (<= ~n1~0 1) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0)) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 578#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 566#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 392#true, Black: 531#(or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (and (<= ~n1~0 1) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0)), Black: 580#(and (<= 1 ~n2~0) (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (or (and (<= 2 ~n2~0) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (and (= ~n2~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), 120#L74true, Black: 201#(= thread3Thread1of1ForFork0_~cond~2 1), 511#(or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), Black: 349#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 339#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 331#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 341#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))), Black: 343#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 337#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0)), Black: 353#(and (= thread3Thread1of1ForFork0_~cond~2 1) (or (and (<= ~n1~0 0) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0))), 631#true, Black: 347#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))), 149#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 335#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0)), Black: 351#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 296#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), Black: 333#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 623#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 609#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 615#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 621#(and (<= ~n1~0 0) (or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork2_~cond~3 0))) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 619#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork2_~cond~3 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), 129#L93true]) [2023-11-06 22:11:59,386 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 22:11:59,386 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:11:59,386 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-06 22:11:59,386 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-06 22:11:59,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L93-->L86-1: Formula: (and (or (and (= v_~n2~0_45 (+ v_~n2~0_44 1)) (< 0 v_~n2~0_45) (= (+ v_~m~0_41 v_~p2~0_44) v_~p2~0_43)) (and (= |v_thread3Thread1of1ForFork0_#t~post2_8| |v_thread3Thread1of1ForFork0_#t~post2_7|) (<= v_~n2~0_45 0) (= v_~n2~0_45 v_~n2~0_44) (= v_~p2~0_44 v_~p2~0_43))) (not (= (mod v_thread3Thread1of1ForFork0_~cond~2_13 256) 0))) InVars {~m~0=v_~m~0_41, ~n2~0=v_~n2~0_45, ~p2~0=v_~p2~0_44, thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_13, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_8|} OutVars{~m~0=v_~m~0_41, ~n2~0=v_~n2~0_44, ~p2~0=v_~p2~0_43, thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_13, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_7|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork0_#t~post2][659], [Black: 378#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 382#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 376#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 ~n2~0)), Black: 380#(and (= thread2Thread1of1ForFork3_~cond~1 0) (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 384#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 371#(<= ~n1~0 ~n2~0), Black: 144#(= (+ ~p1~0 (* (div ~p2~0 4294967296) 4294967296)) (+ (* (div ~p1~0 4294967296) 4294967296) ~p2~0)), 296#(or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), Black: 153#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 155#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= thread1Thread1of1ForFork1_~cond~0 (* (div thread1Thread1of1ForFork1_~cond~0 256) 256))), 617#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 116#L132-4true, 42#thread1EXITtrue, 94#L112true, Black: 572#(and (or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 511#(or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), Black: 397#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 582#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= 1 ~n2~0) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 564#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 586#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 588#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 574#(and (<= 1 ~n2~0) (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (or (and (<= 2 ~n2~0) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (and (= ~n2~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 576#(and (or (< 0 (mod thread4Thread1of1ForFork2_~cond~3 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 590#(and (<= 1 thread4Thread1of1ForFork2_~cond~3) (or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (and (<= ~n1~0 1) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0)) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 578#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 566#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 531#(or (= (mod thread2Thread1of1ForFork3_~cond~1 256) 0) (and (<= ~n1~0 1) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0)), 392#true, Black: 580#(and (<= 1 ~n2~0) (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (or (and (<= 2 ~n2~0) (exists ((~m~0 Int)) (= (mod (+ ~p1~0 (* 4294967294 ~m~0)) 4294967296) (mod ~p2~0 4294967296)))) (and (= ~n2~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), 120#L74true, Black: 201#(= thread3Thread1of1ForFork0_~cond~2 1), Black: 349#(and (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 339#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 331#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 110#L86-1true, Black: 341#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))), Black: 343#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 337#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0)), Black: 353#(and (= thread3Thread1of1ForFork0_~cond~2 1) (or (and (<= ~n1~0 0) (= (+ (* (div ~p1~0 4294967296) 4294967296) (mod ~p2~0 4294967296)) ~p1~0)) (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0))), 631#true, Black: 347#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (< 0 (mod thread3Thread1of1ForFork0_~cond~2 256)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)))), 149#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 160#true, Black: 335#(and (or (< 0 ~n2~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0)), Black: 351#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 333#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 623#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 609#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 615#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 621#(and (<= ~n1~0 0) (or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork2_~cond~3 0))) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 619#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)) (and (<= ~n2~0 0) (= thread4Thread1of1ForFork2_~cond~3 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))))]) [2023-11-06 22:11:59,389 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 22:11:59,389 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:11:59,389 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-06 22:11:59,389 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event