./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --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 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:03:46,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:03:46,662 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:03:46,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:03:46,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:03:46,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:03:46,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:03:46,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:03:46,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:03:46,716 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:03:46,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:03:46,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:03:46,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:03:46,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:03:46,717 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:03:46,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:03:46,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:03:46,719 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:03:46,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:03:46,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:03:46,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:03:46,720 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:03:46,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:03:46,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:03:46,720 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:03:46,721 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:03:46,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:03:46,721 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:03:46,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:03:46,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:03:46,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:03:46,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:03:46,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:03:46,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:03:46,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:03:46,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:03:46,722 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:03:46,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:03:46,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:03:46,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:03:46,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:03:46,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:03:46,723 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 [2024-11-13 15:03:47,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:03:47,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:03:47,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:03:47,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:03:47,091 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:03:47,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c Unable to find full path for "g++" [2024-11-13 15:03:49,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:03:49,372 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:03:49,373 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2024-11-13 15:03:49,381 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/data/7672c9d06/220c7f4e4a3548a491ebf77d8e2f024b/FLAG7007442bb [2024-11-13 15:03:49,397 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/data/7672c9d06/220c7f4e4a3548a491ebf77d8e2f024b [2024-11-13 15:03:49,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:03:49,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:03:49,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:03:49,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:03:49,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:03:49,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:03:49" (1/1) ... [2024-11-13 15:03:49,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e601d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:49, skipping insertion in model container [2024-11-13 15:03:49,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:03:49" (1/1) ... [2024-11-13 15:03:49,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:03:49,638 WARN L250 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_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2024-11-13 15:03:49,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:03:49,654 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:03:49,679 WARN L250 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_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2024-11-13 15:03:49,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:03:49,705 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:03:49,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:49 WrapperNode [2024-11-13 15:03:49,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:03:49,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:03:49,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:03:49,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:03:49,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:49" (1/1) ... [2024-11-13 15:03:49,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:49" (1/1) ... [2024-11-13 15:03:49,751 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2024-11-13 15:03:49,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:03:49,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:03:49,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:03:49,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:03:49,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:49" (1/1) ... [2024-11-13 15:03:49,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:49" (1/1) ... [2024-11-13 15:03:49,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:49" (1/1) ... [2024-11-13 15:03:49,790 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 15:03:49,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:49" (1/1) ... [2024-11-13 15:03:49,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:49" (1/1) ... [2024-11-13 15:03:49,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:49" (1/1) ... [2024-11-13 15:03:49,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:49" (1/1) ... [2024-11-13 15:03:49,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:49" (1/1) ... [2024-11-13 15:03:49,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:49" (1/1) ... [2024-11-13 15:03:49,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:03:49,820 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:03:49,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:03:49,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:03:49,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:49" (1/1) ... [2024-11-13 15:03:49,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:03:49,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:03:49,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:03:49,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:03:49,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:03:49,907 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-13 15:03:49,907 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-13 15:03:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-13 15:03:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-13 15:03:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-13 15:03:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-13 15:03:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:03:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 15:03:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 15:03:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:03:49,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:03:49,911 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 15:03:50,034 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:03:50,036 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:03:50,279 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 15:03:50,279 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:03:50,466 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:03:50,467 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-13 15:03:50,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:03:50 BoogieIcfgContainer [2024-11-13 15:03:50,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:03:50,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:03:50,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:03:50,478 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:03:50,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:03:49" (1/3) ... [2024-11-13 15:03:50,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9fbe7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:03:50, skipping insertion in model container [2024-11-13 15:03:50,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:49" (2/3) ... [2024-11-13 15:03:50,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9fbe7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:03:50, skipping insertion in model container [2024-11-13 15:03:50,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:03:50" (3/3) ... [2024-11-13 15:03:50,481 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2024-11-13 15:03:50,498 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:03:50,500 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-mult-equiv.wvr.c that has 4 procedures, 30 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2024-11-13 15:03:50,500 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 15:03:50,603 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-13 15:03:50,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 85 flow [2024-11-13 15:03:50,710 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2024-11-13 15:03:50,718 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-13 15:03:50,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-11-13 15:03:50,723 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 85 flow [2024-11-13 15:03:50,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 28 transitions, 74 flow [2024-11-13 15:03:50,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:03:50,746 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5e53cd7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:03:50,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-13 15:03:50,763 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 15:03:50,763 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2024-11-13 15:03:50,763 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-13 15:03:50,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:03:50,764 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:03:50,764 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:03:50,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:50,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1061729196, now seen corresponding path program 1 times [2024-11-13 15:03:50,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:50,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546543127] [2024-11-13 15:03:50,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:50,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:03:51,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:51,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546543127] [2024-11-13 15:03:51,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546543127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:51,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:51,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:03:51,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933441368] [2024-11-13 15:03:51,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:51,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:51,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:51,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:51,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:51,639 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-13 15:03:51,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:03:51,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:03:51,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-13 15:03:51,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:03:51,955 INFO L124 PetriNetUnfolderBase]: 321/552 cut-off events. [2024-11-13 15:03:51,956 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-13 15:03:51,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 552 events. 321/552 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2513 event pairs, 34 based on Foata normal form. 1/532 useless extension candidates. Maximal degree in co-relation 896. Up to 376 conditions per place. [2024-11-13 15:03:51,965 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 26 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2024-11-13 15:03:51,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 179 flow [2024-11-13 15:03:51,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:51,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:03:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-11-13 15:03:51,981 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2024-11-13 15:03:51,983 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 74 flow. Second operand 3 states and 74 transitions. [2024-11-13 15:03:51,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 179 flow [2024-11-13 15:03:51,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 42 transitions, 157 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-13 15:03:51,993 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 88 flow [2024-11-13 15:03:51,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2024-11-13 15:03:52,000 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2024-11-13 15:03:52,001 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 88 flow [2024-11-13 15:03:52,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:03:52,001 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:03:52,001 INFO L204 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] [2024-11-13 15:03:52,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:03:52,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:03:52,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:52,002 INFO L85 PathProgramCache]: Analyzing trace with hash 74504100, now seen corresponding path program 1 times [2024-11-13 15:03:52,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:52,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271484377] [2024-11-13 15:03:52,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:52,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:52,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:03:52,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:52,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271484377] [2024-11-13 15:03:52,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271484377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:52,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:52,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:03:52,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185108390] [2024-11-13 15:03:52,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:52,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:03:52,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:52,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:03:52,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:03:52,630 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-13 15:03:52,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:03:52,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:03:52,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-13 15:03:52,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:03:53,134 INFO L124 PetriNetUnfolderBase]: 577/914 cut-off events. [2024-11-13 15:03:53,134 INFO L125 PetriNetUnfolderBase]: For 198/221 co-relation queries the response was YES. [2024-11-13 15:03:53,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2076 conditions, 914 events. 577/914 cut-off events. For 198/221 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4309 event pairs, 20 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 619. Up to 436 conditions per place. [2024-11-13 15:03:53,150 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 62 selfloop transitions, 14 changer transitions 0/84 dead transitions. [2024-11-13 15:03:53,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 84 transitions, 389 flow [2024-11-13 15:03:53,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:03:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 15:03:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-11-13 15:03:53,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2024-11-13 15:03:53,153 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 88 flow. Second operand 7 states and 150 transitions. [2024-11-13 15:03:53,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 84 transitions, 389 flow [2024-11-13 15:03:53,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 84 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 15:03:53,159 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 184 flow [2024-11-13 15:03:53,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=41, PETRI_TRANSITIONS=43} [2024-11-13 15:03:53,161 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2024-11-13 15:03:53,162 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 184 flow [2024-11-13 15:03:53,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:03:53,163 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:03:53,163 INFO L204 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] [2024-11-13 15:03:53,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:03:53,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:03:53,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:53,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1811578990, now seen corresponding path program 2 times [2024-11-13 15:03:53,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:53,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298103810] [2024-11-13 15:03:53,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:53,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:03:53,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:53,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298103810] [2024-11-13 15:03:53,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298103810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:53,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:53,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:03:53,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118037556] [2024-11-13 15:03:53,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:53,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:03:53,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:53,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:03:53,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:03:53,594 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-13 15:03:53,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:03:53,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:03:53,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-13 15:03:53,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:03:54,019 INFO L124 PetriNetUnfolderBase]: 782/1221 cut-off events. [2024-11-13 15:03:54,020 INFO L125 PetriNetUnfolderBase]: For 787/827 co-relation queries the response was YES. [2024-11-13 15:03:54,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3328 conditions, 1221 events. 782/1221 cut-off events. For 787/827 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6064 event pairs, 109 based on Foata normal form. 31/1210 useless extension candidates. Maximal degree in co-relation 3108. Up to 704 conditions per place. [2024-11-13 15:03:54,031 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 63 selfloop transitions, 20 changer transitions 2/93 dead transitions. [2024-11-13 15:03:54,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 93 transitions, 560 flow [2024-11-13 15:03:54,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:03:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 15:03:54,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-11-13 15:03:54,033 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6822916666666666 [2024-11-13 15:03:54,034 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 184 flow. Second operand 6 states and 131 transitions. [2024-11-13 15:03:54,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 93 transitions, 560 flow [2024-11-13 15:03:54,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 93 transitions, 560 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 15:03:54,040 INFO L231 Difference]: Finished difference. Result has 50 places, 57 transitions, 350 flow [2024-11-13 15:03:54,040 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=50, PETRI_TRANSITIONS=57} [2024-11-13 15:03:54,041 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2024-11-13 15:03:54,041 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 57 transitions, 350 flow [2024-11-13 15:03:54,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:03:54,042 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:03:54,042 INFO L204 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] [2024-11-13 15:03:54,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:03:54,043 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:03:54,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:54,043 INFO L85 PathProgramCache]: Analyzing trace with hash 569064926, now seen corresponding path program 3 times [2024-11-13 15:03:54,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:54,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745770996] [2024-11-13 15:03:54,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:54,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:03:54,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:54,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745770996] [2024-11-13 15:03:54,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745770996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:54,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:54,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:03:54,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391808108] [2024-11-13 15:03:54,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:54,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:03:54,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:54,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:03:54,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:03:54,506 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-11-13 15:03:54,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 57 transitions, 350 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:03:54,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:03:54,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-11-13 15:03:54,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:03:55,231 INFO L124 PetriNetUnfolderBase]: 1516/2291 cut-off events. [2024-11-13 15:03:55,231 INFO L125 PetriNetUnfolderBase]: For 3762/3856 co-relation queries the response was YES. [2024-11-13 15:03:55,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7619 conditions, 2291 events. 1516/2291 cut-off events. For 3762/3856 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 12061 event pairs, 160 based on Foata normal form. 37/2293 useless extension candidates. Maximal degree in co-relation 5699. Up to 984 conditions per place. [2024-11-13 15:03:55,251 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 91 selfloop transitions, 38 changer transitions 2/138 dead transitions. [2024-11-13 15:03:55,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 138 transitions, 959 flow [2024-11-13 15:03:55,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:03:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 15:03:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2024-11-13 15:03:55,254 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-11-13 15:03:55,254 INFO L175 Difference]: Start difference. First operand has 50 places, 57 transitions, 350 flow. Second operand 9 states and 198 transitions. [2024-11-13 15:03:55,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 138 transitions, 959 flow [2024-11-13 15:03:55,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 138 transitions, 910 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-11-13 15:03:55,270 INFO L231 Difference]: Finished difference. Result has 62 places, 74 transitions, 596 flow [2024-11-13 15:03:55,270 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=596, PETRI_PLACES=62, PETRI_TRANSITIONS=74} [2024-11-13 15:03:55,271 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 27 predicate places. [2024-11-13 15:03:55,271 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 74 transitions, 596 flow [2024-11-13 15:03:55,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:03:55,271 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:03:55,271 INFO L204 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] [2024-11-13 15:03:55,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:03:55,272 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:03:55,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:55,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1420463663, now seen corresponding path program 1 times [2024-11-13 15:03:55,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:55,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565362071] [2024-11-13 15:03:55,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:55,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:03:55,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:55,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565362071] [2024-11-13 15:03:55,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565362071] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:03:55,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548751076] [2024-11-13 15:03:55,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:55,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:03:55,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:03:55,584 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:03:55,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:03:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:55,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 15:03:55,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:03:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:03:56,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:03:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:03:56,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548751076] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:03:56,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:03:56,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2024-11-13 15:03:56,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912013421] [2024-11-13 15:03:56,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:03:56,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:03:56,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:56,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:03:56,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:03:56,796 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-11-13 15:03:56,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 74 transitions, 596 flow. Second operand has 12 states, 12 states have (on average 14.5) internal successors, (174), 12 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:03:56,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:03:56,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-11-13 15:03:56,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:03:57,688 INFO L124 PetriNetUnfolderBase]: 1876/2909 cut-off events. [2024-11-13 15:03:57,688 INFO L125 PetriNetUnfolderBase]: For 7166/7299 co-relation queries the response was YES. [2024-11-13 15:03:57,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10941 conditions, 2909 events. 1876/2909 cut-off events. For 7166/7299 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 16914 event pairs, 148 based on Foata normal form. 52/2921 useless extension candidates. Maximal degree in co-relation 9040. Up to 953 conditions per place. [2024-11-13 15:03:57,721 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 123 selfloop transitions, 36 changer transitions 4/170 dead transitions. [2024-11-13 15:03:57,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 170 transitions, 1455 flow [2024-11-13 15:03:57,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:03:57,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 15:03:57,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2024-11-13 15:03:57,724 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.66875 [2024-11-13 15:03:57,724 INFO L175 Difference]: Start difference. First operand has 62 places, 74 transitions, 596 flow. Second operand 10 states and 214 transitions. [2024-11-13 15:03:57,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 170 transitions, 1455 flow [2024-11-13 15:03:57,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 170 transitions, 1430 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-11-13 15:03:57,769 INFO L231 Difference]: Finished difference. Result has 75 places, 85 transitions, 791 flow [2024-11-13 15:03:57,769 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=791, PETRI_PLACES=75, PETRI_TRANSITIONS=85} [2024-11-13 15:03:57,770 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 40 predicate places. [2024-11-13 15:03:57,770 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 85 transitions, 791 flow [2024-11-13 15:03:57,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.5) internal successors, (174), 12 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:03:57,770 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:03:57,770 INFO L204 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] [2024-11-13 15:03:57,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:03:57,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:03:57,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:03:57,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:57,974 INFO L85 PathProgramCache]: Analyzing trace with hash -135280637, now seen corresponding path program 2 times [2024-11-13 15:03:57,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:57,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907907563] [2024-11-13 15:03:57,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:57,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:03:58,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:58,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907907563] [2024-11-13 15:03:58,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907907563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:58,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:58,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:03:58,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036852345] [2024-11-13 15:03:58,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:58,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:03:58,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:58,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:03:58,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:03:58,372 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-13 15:03:58,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 85 transitions, 791 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:03:58,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:03:58,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-13 15:03:58,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:03:58,972 INFO L124 PetriNetUnfolderBase]: 1676/2757 cut-off events. [2024-11-13 15:03:58,972 INFO L125 PetriNetUnfolderBase]: For 10197/10560 co-relation queries the response was YES. [2024-11-13 15:03:58,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11500 conditions, 2757 events. 1676/2757 cut-off events. For 10197/10560 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 16919 event pairs, 297 based on Foata normal form. 50/2714 useless extension candidates. Maximal degree in co-relation 8821. Up to 2234 conditions per place. [2024-11-13 15:03:59,001 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 75 selfloop transitions, 24 changer transitions 0/113 dead transitions. [2024-11-13 15:03:59,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 113 transitions, 1113 flow [2024-11-13 15:03:59,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:03:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:03:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-11-13 15:03:59,004 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.69375 [2024-11-13 15:03:59,004 INFO L175 Difference]: Start difference. First operand has 75 places, 85 transitions, 791 flow. Second operand 5 states and 111 transitions. [2024-11-13 15:03:59,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 113 transitions, 1113 flow [2024-11-13 15:03:59,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 113 transitions, 1080 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-11-13 15:03:59,040 INFO L231 Difference]: Finished difference. Result has 80 places, 87 transitions, 865 flow [2024-11-13 15:03:59,041 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=865, PETRI_PLACES=80, PETRI_TRANSITIONS=87} [2024-11-13 15:03:59,041 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 45 predicate places. [2024-11-13 15:03:59,042 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 87 transitions, 865 flow [2024-11-13 15:03:59,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:03:59,042 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:03:59,042 INFO L204 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] [2024-11-13 15:03:59,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:03:59,042 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:03:59,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:59,043 INFO L85 PathProgramCache]: Analyzing trace with hash 170325149, now seen corresponding path program 1 times [2024-11-13 15:03:59,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:59,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16274081] [2024-11-13 15:03:59,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:59,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:03:59,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:59,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16274081] [2024-11-13 15:03:59,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16274081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:59,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:59,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:03:59,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656612008] [2024-11-13 15:03:59,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:59,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:03:59,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:59,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:03:59,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:03:59,414 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-13 15:03:59,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 87 transitions, 865 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:03:59,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:03:59,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-13 15:03:59,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:04:00,676 INFO L124 PetriNetUnfolderBase]: 4387/6725 cut-off events. [2024-11-13 15:04:00,677 INFO L125 PetriNetUnfolderBase]: For 30696/31408 co-relation queries the response was YES. [2024-11-13 15:04:00,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28806 conditions, 6725 events. 4387/6725 cut-off events. For 30696/31408 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 40299 event pairs, 1062 based on Foata normal form. 70/6181 useless extension candidates. Maximal degree in co-relation 20675. Up to 3609 conditions per place. [2024-11-13 15:04:00,746 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 112 selfloop transitions, 74 changer transitions 0/197 dead transitions. [2024-11-13 15:04:00,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 197 transitions, 2196 flow [2024-11-13 15:04:00,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:04:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 15:04:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2024-11-13 15:04:00,748 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6614583333333334 [2024-11-13 15:04:00,748 INFO L175 Difference]: Start difference. First operand has 80 places, 87 transitions, 865 flow. Second operand 6 states and 127 transitions. [2024-11-13 15:04:00,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 197 transitions, 2196 flow [2024-11-13 15:04:00,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 197 transitions, 2131 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-11-13 15:04:00,966 INFO L231 Difference]: Finished difference. Result has 86 places, 129 transitions, 1528 flow [2024-11-13 15:04:00,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1528, PETRI_PLACES=86, PETRI_TRANSITIONS=129} [2024-11-13 15:04:00,967 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 51 predicate places. [2024-11-13 15:04:00,968 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 129 transitions, 1528 flow [2024-11-13 15:04:00,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:00,968 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:04:00,968 INFO L204 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] [2024-11-13 15:04:00,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:04:00,969 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:04:00,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:04:00,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1210846041, now seen corresponding path program 2 times [2024-11-13 15:04:00,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:04:00,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986591788] [2024-11-13 15:04:00,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:00,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:04:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:01,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:04:01,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986591788] [2024-11-13 15:04:01,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986591788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:04:01,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:04:01,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:04:01,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674923241] [2024-11-13 15:04:01,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:04:01,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:04:01,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:04:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:04:01,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:04:01,273 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-13 15:04:01,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 129 transitions, 1528 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:01,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:04:01,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-13 15:04:01,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:04:02,867 INFO L124 PetriNetUnfolderBase]: 4817/7633 cut-off events. [2024-11-13 15:04:02,867 INFO L125 PetriNetUnfolderBase]: For 47218/47839 co-relation queries the response was YES. [2024-11-13 15:04:02,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37486 conditions, 7633 events. 4817/7633 cut-off events. For 47218/47839 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 50180 event pairs, 704 based on Foata normal form. 130/7626 useless extension candidates. Maximal degree in co-relation 27492. Up to 3292 conditions per place. [2024-11-13 15:04:02,955 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 134 selfloop transitions, 126 changer transitions 0/280 dead transitions. [2024-11-13 15:04:02,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 280 transitions, 3892 flow [2024-11-13 15:04:02,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:04:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:04:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-11-13 15:04:02,957 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.63125 [2024-11-13 15:04:02,957 INFO L175 Difference]: Start difference. First operand has 86 places, 129 transitions, 1528 flow. Second operand 5 states and 101 transitions. [2024-11-13 15:04:02,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 280 transitions, 3892 flow [2024-11-13 15:04:03,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 280 transitions, 3892 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 15:04:03,139 INFO L231 Difference]: Finished difference. Result has 93 places, 208 transitions, 3143 flow [2024-11-13 15:04:03,140 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3143, PETRI_PLACES=93, PETRI_TRANSITIONS=208} [2024-11-13 15:04:03,142 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 58 predicate places. [2024-11-13 15:04:03,142 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 208 transitions, 3143 flow [2024-11-13 15:04:03,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:03,144 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:04:03,144 INFO L204 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] [2024-11-13 15:04:03,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:04:03,144 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:04:03,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:04:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1356650775, now seen corresponding path program 3 times [2024-11-13 15:04:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:04:03,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424721673] [2024-11-13 15:04:03,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:03,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:04:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:03,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:04:03,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424721673] [2024-11-13 15:04:03,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424721673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:04:03,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:04:03,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:04:03,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104517576] [2024-11-13 15:04:03,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:04:03,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:04:03,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:04:03,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:04:03,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:04:03,438 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-13 15:04:03,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 208 transitions, 3143 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:03,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:04:03,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-13 15:04:03,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:04:05,008 INFO L124 PetriNetUnfolderBase]: 5008/8077 cut-off events. [2024-11-13 15:04:05,009 INFO L125 PetriNetUnfolderBase]: For 62985/64154 co-relation queries the response was YES. [2024-11-13 15:04:05,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44525 conditions, 8077 events. 5008/8077 cut-off events. For 62985/64154 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 54081 event pairs, 1192 based on Foata normal form. 205/8136 useless extension candidates. Maximal degree in co-relation 31568. Up to 3874 conditions per place. [2024-11-13 15:04:05,114 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 101 selfloop transitions, 141 changer transitions 4/266 dead transitions. [2024-11-13 15:04:05,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 266 transitions, 4082 flow [2024-11-13 15:04:05,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:04:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:04:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-11-13 15:04:05,115 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-11-13 15:04:05,115 INFO L175 Difference]: Start difference. First operand has 93 places, 208 transitions, 3143 flow. Second operand 5 states and 108 transitions. [2024-11-13 15:04:05,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 266 transitions, 4082 flow [2024-11-13 15:04:05,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 266 transitions, 4082 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 15:04:05,462 INFO L231 Difference]: Finished difference. Result has 100 places, 219 transitions, 3767 flow [2024-11-13 15:04:05,463 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3143, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3767, PETRI_PLACES=100, PETRI_TRANSITIONS=219} [2024-11-13 15:04:05,464 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 65 predicate places. [2024-11-13 15:04:05,464 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 219 transitions, 3767 flow [2024-11-13 15:04:05,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:05,464 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:04:05,464 INFO L204 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] [2024-11-13 15:04:05,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:04:05,464 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:04:05,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:04:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash 342761231, now seen corresponding path program 4 times [2024-11-13 15:04:05,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:04:05,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378693062] [2024-11-13 15:04:05,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:05,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:04:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:05,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:04:05,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378693062] [2024-11-13 15:04:05,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378693062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:04:05,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:04:05,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:04:05,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256003454] [2024-11-13 15:04:05,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:04:05,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:04:05,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:04:05,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:04:05,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:04:05,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-13 15:04:05,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 219 transitions, 3767 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:05,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:04:05,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-13 15:04:05,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:04:07,215 INFO L124 PetriNetUnfolderBase]: 5641/8820 cut-off events. [2024-11-13 15:04:07,216 INFO L125 PetriNetUnfolderBase]: For 82251/83305 co-relation queries the response was YES. [2024-11-13 15:04:07,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52264 conditions, 8820 events. 5641/8820 cut-off events. For 82251/83305 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 56996 event pairs, 795 based on Foata normal form. 123/8863 useless extension candidates. Maximal degree in co-relation 36658. Up to 3693 conditions per place. [2024-11-13 15:04:07,302 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 138 selfloop transitions, 151 changer transitions 3/303 dead transitions. [2024-11-13 15:04:07,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 303 transitions, 5247 flow [2024-11-13 15:04:07,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:04:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:04:07,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-11-13 15:04:07,304 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6625 [2024-11-13 15:04:07,304 INFO L175 Difference]: Start difference. First operand has 100 places, 219 transitions, 3767 flow. Second operand 5 states and 106 transitions. [2024-11-13 15:04:07,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 303 transitions, 5247 flow [2024-11-13 15:04:07,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 303 transitions, 5074 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-11-13 15:04:07,716 INFO L231 Difference]: Finished difference. Result has 106 places, 237 transitions, 4428 flow [2024-11-13 15:04:07,717 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3620, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4428, PETRI_PLACES=106, PETRI_TRANSITIONS=237} [2024-11-13 15:04:07,719 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 71 predicate places. [2024-11-13 15:04:07,719 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 237 transitions, 4428 flow [2024-11-13 15:04:07,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:07,720 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:04:07,720 INFO L204 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] [2024-11-13 15:04:07,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:04:07,721 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:04:07,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:04:07,721 INFO L85 PathProgramCache]: Analyzing trace with hash -486760583, now seen corresponding path program 5 times [2024-11-13 15:04:07,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:04:07,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007118729] [2024-11-13 15:04:07,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:07,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:04:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:08,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:04:08,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007118729] [2024-11-13 15:04:08,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007118729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:04:08,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:04:08,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:04:08,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72564183] [2024-11-13 15:04:08,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:04:08,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:04:08,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:04:08,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:04:08,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:04:08,114 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-13 15:04:08,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 237 transitions, 4428 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:08,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:04:08,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-13 15:04:08,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:04:09,364 INFO L124 PetriNetUnfolderBase]: 5689/8880 cut-off events. [2024-11-13 15:04:09,364 INFO L125 PetriNetUnfolderBase]: For 94721/95903 co-relation queries the response was YES. [2024-11-13 15:04:09,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55662 conditions, 8880 events. 5689/8880 cut-off events. For 94721/95903 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 56629 event pairs, 1408 based on Foata normal form. 119/8911 useless extension candidates. Maximal degree in co-relation 40348. Up to 4606 conditions per place. [2024-11-13 15:04:09,441 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 109 selfloop transitions, 171 changer transitions 5/296 dead transitions. [2024-11-13 15:04:09,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 296 transitions, 5424 flow [2024-11-13 15:04:09,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:04:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:04:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2024-11-13 15:04:09,443 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-11-13 15:04:09,443 INFO L175 Difference]: Start difference. First operand has 106 places, 237 transitions, 4428 flow. Second operand 5 states and 112 transitions. [2024-11-13 15:04:09,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 296 transitions, 5424 flow [2024-11-13 15:04:09,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 296 transitions, 5301 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-13 15:04:09,799 INFO L231 Difference]: Finished difference. Result has 112 places, 241 transitions, 4887 flow [2024-11-13 15:04:09,800 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4241, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4887, PETRI_PLACES=112, PETRI_TRANSITIONS=241} [2024-11-13 15:04:09,800 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 77 predicate places. [2024-11-13 15:04:09,800 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 241 transitions, 4887 flow [2024-11-13 15:04:09,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:09,801 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:04:09,801 INFO L204 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] [2024-11-13 15:04:09,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:04:09,801 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:04:09,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:04:09,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1973250805, now seen corresponding path program 6 times [2024-11-13 15:04:09,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:04:09,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756508238] [2024-11-13 15:04:09,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:09,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:04:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:10,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:04:10,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756508238] [2024-11-13 15:04:10,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756508238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:04:10,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863765426] [2024-11-13 15:04:10,083 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-13 15:04:10,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:04:10,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:04:10,086 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:04:10,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:04:10,193 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-13 15:04:10,193 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:04:10,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 15:04:10,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:04:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:10,644 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:04:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:11,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863765426] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:04:11,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:04:11,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2024-11-13 15:04:11,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427965761] [2024-11-13 15:04:11,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:04:11,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:04:11,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:04:11,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:04:11,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:04:11,238 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-13 15:04:11,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 241 transitions, 4887 flow. Second operand has 12 states, 12 states have (on average 12.75) internal successors, (153), 12 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:11,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:04:11,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-13 15:04:11,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:04:13,768 INFO L124 PetriNetUnfolderBase]: 7292/11355 cut-off events. [2024-11-13 15:04:13,768 INFO L125 PetriNetUnfolderBase]: For 134126/135667 co-relation queries the response was YES. [2024-11-13 15:04:13,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72755 conditions, 11355 events. 7292/11355 cut-off events. For 134126/135667 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 74163 event pairs, 639 based on Foata normal form. 319/11619 useless extension candidates. Maximal degree in co-relation 61685. Up to 3138 conditions per place. [2024-11-13 15:04:13,879 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 199 selfloop transitions, 233 changer transitions 12/455 dead transitions. [2024-11-13 15:04:13,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 455 transitions, 7724 flow [2024-11-13 15:04:13,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 15:04:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-13 15:04:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 330 transitions. [2024-11-13 15:04:13,882 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.64453125 [2024-11-13 15:04:13,882 INFO L175 Difference]: Start difference. First operand has 112 places, 241 transitions, 4887 flow. Second operand 16 states and 330 transitions. [2024-11-13 15:04:13,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 455 transitions, 7724 flow [2024-11-13 15:04:14,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 455 transitions, 7543 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-13 15:04:14,274 INFO L231 Difference]: Finished difference. Result has 132 places, 292 transitions, 6233 flow [2024-11-13 15:04:14,275 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4723, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6233, PETRI_PLACES=132, PETRI_TRANSITIONS=292} [2024-11-13 15:04:14,276 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 97 predicate places. [2024-11-13 15:04:14,276 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 292 transitions, 6233 flow [2024-11-13 15:04:14,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.75) internal successors, (153), 12 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:14,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:04:14,276 INFO L204 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] [2024-11-13 15:04:14,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 15:04:14,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 15:04:14,481 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:04:14,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:04:14,481 INFO L85 PathProgramCache]: Analyzing trace with hash 976270689, now seen corresponding path program 7 times [2024-11-13 15:04:14,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:04:14,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711762652] [2024-11-13 15:04:14,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:14,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:04:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:14,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:04:14,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711762652] [2024-11-13 15:04:14,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711762652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:04:14,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:04:14,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:04:14,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120645399] [2024-11-13 15:04:14,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:04:14,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:04:14,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:04:14,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:04:14,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:04:14,767 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-13 15:04:14,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 292 transitions, 6233 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:14,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:04:14,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-13 15:04:14,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:04:16,773 INFO L124 PetriNetUnfolderBase]: 5923/9595 cut-off events. [2024-11-13 15:04:16,773 INFO L125 PetriNetUnfolderBase]: For 158403/159793 co-relation queries the response was YES. [2024-11-13 15:04:16,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69347 conditions, 9595 events. 5923/9595 cut-off events. For 158403/159793 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 66771 event pairs, 829 based on Foata normal form. 384/9812 useless extension candidates. Maximal degree in co-relation 59073. Up to 4034 conditions per place. [2024-11-13 15:04:16,876 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 146 selfloop transitions, 165 changer transitions 9/348 dead transitions. [2024-11-13 15:04:16,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 348 transitions, 7377 flow [2024-11-13 15:04:16,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:04:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:04:16,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2024-11-13 15:04:16,877 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-11-13 15:04:16,877 INFO L175 Difference]: Start difference. First operand has 132 places, 292 transitions, 6233 flow. Second operand 5 states and 104 transitions. [2024-11-13 15:04:16,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 348 transitions, 7377 flow [2024-11-13 15:04:17,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 348 transitions, 7115 flow, removed 29 selfloop flow, removed 5 redundant places. [2024-11-13 15:04:17,328 INFO L231 Difference]: Finished difference. Result has 133 places, 287 transitions, 6308 flow [2024-11-13 15:04:17,328 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5903, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6308, PETRI_PLACES=133, PETRI_TRANSITIONS=287} [2024-11-13 15:04:17,329 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 98 predicate places. [2024-11-13 15:04:17,329 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 287 transitions, 6308 flow [2024-11-13 15:04:17,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:17,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:04:17,329 INFO L204 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] [2024-11-13 15:04:17,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 15:04:17,330 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:04:17,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:04:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1581526809, now seen corresponding path program 3 times [2024-11-13 15:04:17,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:04:17,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080030126] [2024-11-13 15:04:17,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:17,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:04:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:17,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:04:17,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080030126] [2024-11-13 15:04:17,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080030126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:04:17,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:04:17,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:04:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938409089] [2024-11-13 15:04:17,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:04:17,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:04:17,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:04:17,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:04:17,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:04:17,539 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-13 15:04:17,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 287 transitions, 6308 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:17,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:04:17,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-13 15:04:17,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:04:19,066 INFO L124 PetriNetUnfolderBase]: 4889/7992 cut-off events. [2024-11-13 15:04:19,066 INFO L125 PetriNetUnfolderBase]: For 156733/158481 co-relation queries the response was YES. [2024-11-13 15:04:19,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59466 conditions, 7992 events. 4889/7992 cut-off events. For 156733/158481 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 54555 event pairs, 922 based on Foata normal form. 303/8092 useless extension candidates. Maximal degree in co-relation 53041. Up to 6535 conditions per place. [2024-11-13 15:04:19,156 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 225 selfloop transitions, 55 changer transitions 6/315 dead transitions. [2024-11-13 15:04:19,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 315 transitions, 7030 flow [2024-11-13 15:04:19,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:04:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:04:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-11-13 15:04:19,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-13 15:04:19,158 INFO L175 Difference]: Start difference. First operand has 133 places, 287 transitions, 6308 flow. Second operand 5 states and 105 transitions. [2024-11-13 15:04:19,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 315 transitions, 7030 flow [2024-11-13 15:04:19,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 315 transitions, 6785 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-13 15:04:19,643 INFO L231 Difference]: Finished difference. Result has 135 places, 276 transitions, 5878 flow [2024-11-13 15:04:19,644 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5799, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5878, PETRI_PLACES=135, PETRI_TRANSITIONS=276} [2024-11-13 15:04:19,644 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 100 predicate places. [2024-11-13 15:04:19,644 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 276 transitions, 5878 flow [2024-11-13 15:04:19,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:19,645 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:04:19,645 INFO L204 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] [2024-11-13 15:04:19,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 15:04:19,645 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:04:19,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:04:19,646 INFO L85 PathProgramCache]: Analyzing trace with hash -520172547, now seen corresponding path program 8 times [2024-11-13 15:04:19,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:04:19,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588055752] [2024-11-13 15:04:19,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:19,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:04:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:19,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:19,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:04:19,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588055752] [2024-11-13 15:04:19,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588055752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:04:19,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:04:19,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:04:19,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169930743] [2024-11-13 15:04:19,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:04:19,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:04:19,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:04:19,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:04:19,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:04:19,853 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-13 15:04:19,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 276 transitions, 5878 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:19,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:04:19,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-13 15:04:19,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:04:21,486 INFO L124 PetriNetUnfolderBase]: 5341/8699 cut-off events. [2024-11-13 15:04:21,486 INFO L125 PetriNetUnfolderBase]: For 144821/146418 co-relation queries the response was YES. [2024-11-13 15:04:21,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61717 conditions, 8699 events. 5341/8699 cut-off events. For 144821/146418 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 59005 event pairs, 1057 based on Foata normal form. 312/8790 useless extension candidates. Maximal degree in co-relation 52779. Up to 7050 conditions per place. [2024-11-13 15:04:21,568 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 160 selfloop transitions, 52 changer transitions 16/311 dead transitions. [2024-11-13 15:04:21,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 311 transitions, 6639 flow [2024-11-13 15:04:21,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:04:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:04:21,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-11-13 15:04:21,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-13 15:04:21,570 INFO L175 Difference]: Start difference. First operand has 135 places, 276 transitions, 5878 flow. Second operand 5 states and 105 transitions. [2024-11-13 15:04:21,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 311 transitions, 6639 flow [2024-11-13 15:04:22,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 311 transitions, 6531 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-13 15:04:22,007 INFO L231 Difference]: Finished difference. Result has 138 places, 273 transitions, 5780 flow [2024-11-13 15:04:22,008 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5739, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5780, PETRI_PLACES=138, PETRI_TRANSITIONS=273} [2024-11-13 15:04:22,008 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 103 predicate places. [2024-11-13 15:04:22,008 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 273 transitions, 5780 flow [2024-11-13 15:04:22,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:22,008 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:04:22,009 INFO L204 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] [2024-11-13 15:04:22,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 15:04:22,009 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:04:22,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:04:22,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1057527055, now seen corresponding path program 9 times [2024-11-13 15:04:22,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:04:22,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455168492] [2024-11-13 15:04:22,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:22,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:04:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:22,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:04:22,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455168492] [2024-11-13 15:04:22,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455168492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:04:22,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:04:22,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:04:22,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213925754] [2024-11-13 15:04:22,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:04:22,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:04:22,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:04:22,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:04:22,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:04:22,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-13 15:04:22,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 273 transitions, 5780 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:22,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:04:22,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-13 15:04:22,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:04:23,671 INFO L124 PetriNetUnfolderBase]: 5271/8541 cut-off events. [2024-11-13 15:04:23,671 INFO L125 PetriNetUnfolderBase]: For 145579/147161 co-relation queries the response was YES. [2024-11-13 15:04:23,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61869 conditions, 8541 events. 5271/8541 cut-off events. For 145579/147161 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 57256 event pairs, 1010 based on Foata normal form. 296/8668 useless extension candidates. Maximal degree in co-relation 52993. Up to 7091 conditions per place. [2024-11-13 15:04:23,747 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 150 selfloop transitions, 65 changer transitions 1/299 dead transitions. [2024-11-13 15:04:23,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 299 transitions, 6449 flow [2024-11-13 15:04:23,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:04:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 15:04:23,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-11-13 15:04:23,748 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.61875 [2024-11-13 15:04:23,749 INFO L175 Difference]: Start difference. First operand has 138 places, 273 transitions, 5780 flow. Second operand 5 states and 99 transitions. [2024-11-13 15:04:23,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 299 transitions, 6449 flow [2024-11-13 15:04:24,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 299 transitions, 6136 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-11-13 15:04:24,148 INFO L231 Difference]: Finished difference. Result has 138 places, 285 transitions, 5869 flow [2024-11-13 15:04:24,148 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5505, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5869, PETRI_PLACES=138, PETRI_TRANSITIONS=285} [2024-11-13 15:04:24,149 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 103 predicate places. [2024-11-13 15:04:24,149 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 285 transitions, 5869 flow [2024-11-13 15:04:24,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:24,149 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:04:24,149 INFO L204 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] [2024-11-13 15:04:24,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 15:04:24,149 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:04:24,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:04:24,150 INFO L85 PathProgramCache]: Analyzing trace with hash 423424171, now seen corresponding path program 10 times [2024-11-13 15:04:24,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:04:24,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761424584] [2024-11-13 15:04:24,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:24,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:04:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:24,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:04:24,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761424584] [2024-11-13 15:04:24,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761424584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:04:24,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:04:24,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:04:24,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757862488] [2024-11-13 15:04:24,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:04:24,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:04:24,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:04:24,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:04:24,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:04:24,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-13 15:04:24,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 285 transitions, 5869 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:24,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:04:24,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-13 15:04:24,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:04:25,938 INFO L124 PetriNetUnfolderBase]: 5311/8607 cut-off events. [2024-11-13 15:04:25,938 INFO L125 PetriNetUnfolderBase]: For 147327/149032 co-relation queries the response was YES. [2024-11-13 15:04:25,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62685 conditions, 8607 events. 5311/8607 cut-off events. For 147327/149032 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 57801 event pairs, 1061 based on Foata normal form. 334/8764 useless extension candidates. Maximal degree in co-relation 59176. Up to 6947 conditions per place. [2024-11-13 15:04:26,017 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 167 selfloop transitions, 75 changer transitions 5/326 dead transitions. [2024-11-13 15:04:26,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 326 transitions, 6827 flow [2024-11-13 15:04:26,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:04:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 15:04:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-11-13 15:04:26,018 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.640625 [2024-11-13 15:04:26,019 INFO L175 Difference]: Start difference. First operand has 138 places, 285 transitions, 5869 flow. Second operand 6 states and 123 transitions. [2024-11-13 15:04:26,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 326 transitions, 6827 flow [2024-11-13 15:04:26,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 326 transitions, 6699 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-11-13 15:04:26,487 INFO L231 Difference]: Finished difference. Result has 140 places, 290 transitions, 6077 flow [2024-11-13 15:04:26,487 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5594, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6077, PETRI_PLACES=140, PETRI_TRANSITIONS=290} [2024-11-13 15:04:26,488 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 105 predicate places. [2024-11-13 15:04:26,488 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 290 transitions, 6077 flow [2024-11-13 15:04:26,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:26,488 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:04:26,488 INFO L204 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] [2024-11-13 15:04:26,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 15:04:26,489 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:04:26,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:04:26,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1067810685, now seen corresponding path program 1 times [2024-11-13 15:04:26,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:04:26,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432122483] [2024-11-13 15:04:26,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:26,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:04:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:26,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:04:26,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432122483] [2024-11-13 15:04:26,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432122483] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:04:26,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465961994] [2024-11-13 15:04:26,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:26,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:04:26,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:04:26,810 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:04:26,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:04:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:26,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 15:04:26,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:04:27,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:27,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:04:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465961994] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:04:28,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:04:28,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2024-11-13 15:04:28,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423798364] [2024-11-13 15:04:28,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:04:28,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 15:04:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:04:28,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 15:04:28,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:04:28,164 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-11-13 15:04:28,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 290 transitions, 6077 flow. Second operand has 15 states, 15 states have (on average 14.0) internal successors, (210), 15 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:28,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:04:28,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-11-13 15:04:28,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:04:32,816 INFO L124 PetriNetUnfolderBase]: 12753/20165 cut-off events. [2024-11-13 15:04:32,816 INFO L125 PetriNetUnfolderBase]: For 340986/342740 co-relation queries the response was YES. [2024-11-13 15:04:32,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144851 conditions, 20165 events. 12753/20165 cut-off events. For 340986/342740 co-relation queries the response was YES. Maximal size of possible extension queue 1324. Compared 149103 event pairs, 815 based on Foata normal form. 428/20499 useless extension candidates. Maximal degree in co-relation 135073. Up to 7756 conditions per place. [2024-11-13 15:04:33,056 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 426 selfloop transitions, 402 changer transitions 8/861 dead transitions. [2024-11-13 15:04:33,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 861 transitions, 18419 flow [2024-11-13 15:04:33,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:04:33,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-13 15:04:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 325 transitions. [2024-11-13 15:04:33,059 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2024-11-13 15:04:33,059 INFO L175 Difference]: Start difference. First operand has 140 places, 290 transitions, 6077 flow. Second operand 15 states and 325 transitions. [2024-11-13 15:04:33,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 861 transitions, 18419 flow [2024-11-13 15:04:34,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 861 transitions, 18188 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-11-13 15:04:34,544 INFO L231 Difference]: Finished difference. Result has 149 places, 579 transitions, 13650 flow [2024-11-13 15:04:34,544 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5869, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13650, PETRI_PLACES=149, PETRI_TRANSITIONS=579} [2024-11-13 15:04:34,545 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 114 predicate places. [2024-11-13 15:04:34,545 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 579 transitions, 13650 flow [2024-11-13 15:04:34,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 14.0) internal successors, (210), 15 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:34,545 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:04:34,545 INFO L204 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] [2024-11-13 15:04:34,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 15:04:34,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 15:04:34,746 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:04:34,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:04:34,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1195889527, now seen corresponding path program 2 times [2024-11-13 15:04:34,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:04:34,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906525491] [2024-11-13 15:04:34,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:34,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:04:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:35,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:04:35,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906525491] [2024-11-13 15:04:35,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906525491] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:04:35,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764924287] [2024-11-13 15:04:35,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:04:35,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:04:35,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:04:35,047 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:04:35,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 15:04:35,118 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:04:35,118 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:04:35,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 15:04:35,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:04:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:35,259 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:04:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:36,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764924287] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:04:36,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:04:36,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-11-13 15:04:36,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794227631] [2024-11-13 15:04:36,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:04:36,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 15:04:36,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:04:36,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 15:04:36,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:04:36,227 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-11-13 15:04:36,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 579 transitions, 13650 flow. Second operand has 13 states, 13 states have (on average 14.538461538461538) internal successors, (189), 13 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:36,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:04:36,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-11-13 15:04:36,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:04:37,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:04:39,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L64-->L69: Formula: (let ((.cse0 (mod v_~N~0_72 4294967296))) (or (and (= (+ 2 v_~N~0_71) v_~N~0_72) (= v_~p~0_57 (+ v_~p~0_58 (* 2 v_~M~0_52))) (< 1 .cse0)) (and (= v_~N~0_72 v_~N~0_71) (<= .cse0 1) (= v_~p~0_58 v_~p~0_57)))) InVars {~M~0=v_~M~0_52, ~p~0=v_~p~0_58, ~N~0=v_~N~0_72} OutVars{~M~0=v_~M~0_52, ~p~0=v_~p~0_57, ~N~0=v_~N~0_71} AuxVars[] AssignedVars[~p~0, ~N~0][392], [Black: 253#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 518#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 265#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 262#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 517#(= ~N~0 ~L~0), Black: 261#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 534#true, 15#L99-4true, Black: 528#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 278#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 276#(or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))), Black: 272#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), 46#true, Black: 288#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 290#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 284#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 6#L83true, Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 297#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 300#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 296#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 310#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)) (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~N~0 4294967296) 1))) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 307#(and (or (< 0 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 0)) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), 28#L45true, Black: 306#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 89#true, Black: 61#(< 0 (mod ~N~0 4294967296)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 319#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 62#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 33#L69true, Black: 640#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), 259#true, Black: 700#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (<= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0) (<= 1 (mod ~N~0 4294967296))))), Black: 706#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 636#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 710#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 69#true, Black: 74#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 73#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)), 270#true, Black: 314#true, Black: 475#(and (= ~p~0 0) (= ~q~0 0) (or (< 0 thread1Thread1of1ForFork0_~cond~0) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (= thread1Thread1of1ForFork0_~cond~0 1) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 470#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 thread1Thread1of1ForFork0_~cond~0) (< (mod ~N~0 4294967296) 2)) (= ~q~0 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)) (and (= ~p~0 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 421#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork0_~cond~0 256))), Black: 468#(and (= ~q~0 0) (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)), Black: 488#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 491#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), 719#true, Black: 240#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 244#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 98#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 234#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 238#(and (= ~q~0 0) (<= 1 (mod ~L~0 4294967296)))]) [2024-11-13 15:04:39,694 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-11-13 15:04:39,695 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-13 15:04:39,695 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-13 15:04:39,695 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-13 15:04:39,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([238] L45-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_1| |v_thread1Thread1of1ForFork0_#t~post1_2|)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~p~0, ~N~0][513], [Black: 253#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 518#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 265#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 262#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 517#(= ~N~0 ~L~0), Black: 261#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 534#true, 15#L99-4true, Black: 528#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 278#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 276#(or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))), Black: 272#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), 46#true, Black: 288#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 290#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 284#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 6#L83true, Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 297#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 300#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 296#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), 25#L50true, 27#L64true, Black: 310#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)) (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~N~0 4294967296) 1))) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 307#(and (or (< 0 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 0)) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 306#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 89#true, Black: 61#(< 0 (mod ~N~0 4294967296)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 319#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 62#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 640#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), 259#true, Black: 700#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (<= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0) (<= 1 (mod ~N~0 4294967296))))), Black: 706#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 636#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 710#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 69#true, Black: 74#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 73#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)), 270#true, Black: 314#true, Black: 475#(and (= ~p~0 0) (= ~q~0 0) (or (< 0 thread1Thread1of1ForFork0_~cond~0) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (= thread1Thread1of1ForFork0_~cond~0 1) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 470#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 thread1Thread1of1ForFork0_~cond~0) (< (mod ~N~0 4294967296) 2)) (= ~q~0 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)) (and (= ~p~0 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 421#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork0_~cond~0 256))), Black: 468#(and (= ~q~0 0) (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)), Black: 488#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 491#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), 719#true, Black: 240#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 244#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 98#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 234#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 238#(and (= ~q~0 0) (<= 1 (mod ~L~0 4294967296)))]) [2024-11-13 15:04:39,696 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-11-13 15:04:39,696 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-13 15:04:39,696 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-13 15:04:39,696 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-13 15:04:40,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L64-->L69: Formula: (let ((.cse0 (mod v_~N~0_72 4294967296))) (or (and (= (+ 2 v_~N~0_71) v_~N~0_72) (= v_~p~0_57 (+ v_~p~0_58 (* 2 v_~M~0_52))) (< 1 .cse0)) (and (= v_~N~0_72 v_~N~0_71) (<= .cse0 1) (= v_~p~0_58 v_~p~0_57)))) InVars {~M~0=v_~M~0_52, ~p~0=v_~p~0_58, ~N~0=v_~N~0_72} OutVars{~M~0=v_~M~0_52, ~p~0=v_~p~0_57, ~N~0=v_~N~0_71} AuxVars[] AssignedVars[~p~0, ~N~0][392], [Black: 253#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 518#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 265#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 262#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 517#(= ~N~0 ~L~0), Black: 261#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 534#true, Black: 528#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 278#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 276#(or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))), Black: 272#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), 46#true, 26#L100true, Black: 288#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 290#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 284#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 6#L83true, Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 297#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 300#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 296#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 310#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)) (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~N~0 4294967296) 1))) (= thread2Thread1of1ForFork1_~cond~1 0)), 28#L45true, Black: 307#(and (or (< 0 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 0)) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 306#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 89#true, Black: 61#(< 0 (mod ~N~0 4294967296)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 319#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 62#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 33#L69true, Black: 640#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), 259#true, Black: 700#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (<= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0) (<= 1 (mod ~N~0 4294967296))))), Black: 706#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 636#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 710#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 69#true, Black: 74#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 73#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)), 270#true, Black: 314#true, Black: 475#(and (= ~p~0 0) (= ~q~0 0) (or (< 0 thread1Thread1of1ForFork0_~cond~0) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (= thread1Thread1of1ForFork0_~cond~0 1) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 470#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 thread1Thread1of1ForFork0_~cond~0) (< (mod ~N~0 4294967296) 2)) (= ~q~0 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)) (and (= ~p~0 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 421#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork0_~cond~0 256))), Black: 468#(and (= ~q~0 0) (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)), Black: 488#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 491#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), 719#true, Black: 240#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 244#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 98#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 234#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 238#(and (= ~q~0 0) (<= 1 (mod ~L~0 4294967296)))]) [2024-11-13 15:04:40,334 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-13 15:04:40,334 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-13 15:04:40,334 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-13 15:04:40,334 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-13 15:04:40,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([238] L45-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_1| |v_thread1Thread1of1ForFork0_#t~post1_2|)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~p~0, ~N~0][513], [Black: 253#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 518#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 265#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 262#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 517#(= ~N~0 ~L~0), Black: 261#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 534#true, Black: 528#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 278#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 276#(or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))), Black: 272#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), 46#true, 26#L100true, Black: 288#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 290#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 284#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 6#L83true, Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 297#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 300#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 296#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), 27#L64true, 25#L50true, Black: 310#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)) (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~N~0 4294967296) 1))) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 307#(and (or (< 0 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 0)) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 306#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 89#true, Black: 61#(< 0 (mod ~N~0 4294967296)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 319#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 62#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 640#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), 259#true, Black: 700#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (<= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0) (<= 1 (mod ~N~0 4294967296))))), Black: 706#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 636#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 710#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 69#true, Black: 74#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 73#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)), 270#true, Black: 314#true, Black: 475#(and (= ~p~0 0) (= ~q~0 0) (or (< 0 thread1Thread1of1ForFork0_~cond~0) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (= thread1Thread1of1ForFork0_~cond~0 1) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 470#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 thread1Thread1of1ForFork0_~cond~0) (< (mod ~N~0 4294967296) 2)) (= ~q~0 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)) (and (= ~p~0 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 421#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork0_~cond~0 256))), Black: 468#(and (= ~q~0 0) (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)), Black: 488#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 491#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), 719#true, Black: 240#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 244#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 98#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 234#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 238#(and (= ~q~0 0) (<= 1 (mod ~L~0 4294967296)))]) [2024-11-13 15:04:40,335 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-13 15:04:40,335 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-13 15:04:40,335 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-13 15:04:40,335 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-13 15:04:40,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L64-->L69: Formula: (let ((.cse0 (mod v_~N~0_72 4294967296))) (or (and (= (+ 2 v_~N~0_71) v_~N~0_72) (= v_~p~0_57 (+ v_~p~0_58 (* 2 v_~M~0_52))) (< 1 .cse0)) (and (= v_~N~0_72 v_~N~0_71) (<= .cse0 1) (= v_~p~0_58 v_~p~0_57)))) InVars {~M~0=v_~M~0_52, ~p~0=v_~p~0_58, ~N~0=v_~N~0_72} OutVars{~M~0=v_~M~0_52, ~p~0=v_~p~0_57, ~N~0=v_~N~0_71} AuxVars[] AssignedVars[~p~0, ~N~0][514], [Black: 253#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 518#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 265#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 262#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 517#(= ~N~0 ~L~0), Black: 261#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 15#L99-4true, Black: 528#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 278#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 276#(or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))), Black: 272#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 288#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 290#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 284#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 73#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0))), 640#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 297#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 300#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 296#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 310#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)) (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~N~0 4294967296) 1))) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 307#(and (or (< 0 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 0)) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), 28#L45true, Black: 306#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 89#true, Black: 61#(< 0 (mod ~N~0 4294967296)), 319#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 62#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 33#L69true, Black: 534#true, 259#true, Black: 700#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (<= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0) (<= 1 (mod ~N~0 4294967296))))), Black: 706#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 636#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 710#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 51#(<= (mod ~L~0 4294967296) 0), Black: 69#true, Black: 74#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)), 270#true, 23#thread3EXITtrue, Black: 314#true, Black: 475#(and (= ~p~0 0) (= ~q~0 0) (or (< 0 thread1Thread1of1ForFork0_~cond~0) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (= thread1Thread1of1ForFork0_~cond~0 1) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 470#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 thread1Thread1of1ForFork0_~cond~0) (< (mod ~N~0 4294967296) 2)) (= ~q~0 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)) (and (= ~p~0 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 421#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork0_~cond~0 256))), Black: 468#(and (= ~q~0 0) (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)), Black: 488#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 491#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), 719#true, Black: 240#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 244#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 98#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 234#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 238#(and (= ~q~0 0) (<= 1 (mod ~L~0 4294967296)))]) [2024-11-13 15:04:40,429 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-13 15:04:40,429 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-13 15:04:40,429 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-13 15:04:40,429 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-13 15:04:40,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([238] L45-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_1| |v_thread1Thread1of1ForFork0_#t~post1_2|)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~p~0, ~N~0][624], [Black: 253#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 518#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 265#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 262#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 517#(= ~N~0 ~L~0), Black: 261#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 15#L99-4true, Black: 528#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 278#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 276#(or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))), Black: 272#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 288#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 290#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 284#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 73#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0))), 640#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 297#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 300#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 296#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), 25#L50true, 27#L64true, Black: 310#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)) (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~N~0 4294967296) 1))) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 307#(and (or (< 0 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 0)) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 306#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 89#true, Black: 61#(< 0 (mod ~N~0 4294967296)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 319#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 62#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 534#true, 259#true, Black: 700#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (<= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0) (<= 1 (mod ~N~0 4294967296))))), Black: 706#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 636#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 710#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 51#(<= (mod ~L~0 4294967296) 0), Black: 69#true, Black: 74#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)), 270#true, 23#thread3EXITtrue, Black: 314#true, Black: 475#(and (= ~p~0 0) (= ~q~0 0) (or (< 0 thread1Thread1of1ForFork0_~cond~0) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (= thread1Thread1of1ForFork0_~cond~0 1) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 470#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 thread1Thread1of1ForFork0_~cond~0) (< (mod ~N~0 4294967296) 2)) (= ~q~0 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)) (and (= ~p~0 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 421#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork0_~cond~0 256))), Black: 468#(and (= ~q~0 0) (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)), Black: 488#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 491#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), 719#true, Black: 240#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 244#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 98#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 234#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 238#(and (= ~q~0 0) (<= 1 (mod ~L~0 4294967296)))]) [2024-11-13 15:04:40,429 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-13 15:04:40,430 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-13 15:04:40,430 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-13 15:04:40,430 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-13 15:04:40,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([238] L45-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_1| |v_thread1Thread1of1ForFork0_#t~post1_2|)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~p~0, ~N~0][479], [Black: 253#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 518#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 265#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 262#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 517#(= ~N~0 ~L~0), Black: 261#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 534#true, 15#L99-4true, Black: 528#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 278#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 276#(or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))), Black: 272#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), 46#true, Black: 288#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 290#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 284#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 297#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 300#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 296#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), 25#L50true, 27#L64true, Black: 310#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)) (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~N~0 4294967296) 1))) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 307#(and (or (< 0 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 0)) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 306#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 61#(< 0 (mod ~N~0 4294967296)), 319#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 62#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 640#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), 259#true, Black: 700#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (<= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0) (<= 1 (mod ~N~0 4294967296))))), Black: 706#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 636#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 710#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 94#(<= 1 (mod ~L~0 4294967296)), 69#true, Black: 74#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 73#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)), 270#true, Black: 314#true, Black: 475#(and (= ~p~0 0) (= ~q~0 0) (or (< 0 thread1Thread1of1ForFork0_~cond~0) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (= thread1Thread1of1ForFork0_~cond~0 1) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 470#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 thread1Thread1of1ForFork0_~cond~0) (< (mod ~N~0 4294967296) 2)) (= ~q~0 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)) (and (= ~p~0 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 421#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork0_~cond~0 256))), Black: 468#(and (= ~q~0 0) (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)), Black: 488#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 491#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), 17#L80true, 719#true, Black: 240#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 244#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 98#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 234#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 238#(and (= ~q~0 0) (<= 1 (mod ~L~0 4294967296)))]) [2024-11-13 15:04:40,431 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-13 15:04:40,431 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-13 15:04:40,431 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-13 15:04:40,431 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-13 15:04:40,431 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L64-->L69: Formula: (let ((.cse0 (mod v_~N~0_72 4294967296))) (or (and (= (+ 2 v_~N~0_71) v_~N~0_72) (= v_~p~0_57 (+ v_~p~0_58 (* 2 v_~M~0_52))) (< 1 .cse0)) (and (= v_~N~0_72 v_~N~0_71) (<= .cse0 1) (= v_~p~0_58 v_~p~0_57)))) InVars {~M~0=v_~M~0_52, ~p~0=v_~p~0_58, ~N~0=v_~N~0_72} OutVars{~M~0=v_~M~0_52, ~p~0=v_~p~0_57, ~N~0=v_~N~0_71} AuxVars[] AssignedVars[~p~0, ~N~0][362], [Black: 253#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 518#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 265#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 262#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 517#(= ~N~0 ~L~0), Black: 261#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 534#true, 15#L99-4true, Black: 528#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 278#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 276#(or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))), Black: 272#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), 46#true, Black: 288#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 290#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 284#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 297#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 300#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 296#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 310#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)) (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~N~0 4294967296) 1))) (= thread2Thread1of1ForFork1_~cond~1 0)), 28#L45true, Black: 307#(and (or (< 0 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 0)) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 306#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 61#(< 0 (mod ~N~0 4294967296)), 319#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 62#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 33#L69true, Black: 640#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), 259#true, Black: 700#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (<= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0) (<= 1 (mod ~N~0 4294967296))))), Black: 706#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 636#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 710#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 94#(<= 1 (mod ~L~0 4294967296)), 69#true, Black: 74#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 73#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)), 270#true, Black: 314#true, Black: 475#(and (= ~p~0 0) (= ~q~0 0) (or (< 0 thread1Thread1of1ForFork0_~cond~0) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (= thread1Thread1of1ForFork0_~cond~0 1) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 470#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 thread1Thread1of1ForFork0_~cond~0) (< (mod ~N~0 4294967296) 2)) (= ~q~0 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)) (and (= ~p~0 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 421#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork0_~cond~0 256))), Black: 468#(and (= ~q~0 0) (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)), Black: 488#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 491#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), 17#L80true, 719#true, Black: 240#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 244#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 98#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 234#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 238#(and (= ~q~0 0) (<= 1 (mod ~L~0 4294967296)))]) [2024-11-13 15:04:40,431 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-13 15:04:40,431 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-13 15:04:40,431 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-13 15:04:40,431 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-13 15:04:41,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L64-->L69: Formula: (let ((.cse0 (mod v_~N~0_72 4294967296))) (or (and (= (+ 2 v_~N~0_71) v_~N~0_72) (= v_~p~0_57 (+ v_~p~0_58 (* 2 v_~M~0_52))) (< 1 .cse0)) (and (= v_~N~0_72 v_~N~0_71) (<= .cse0 1) (= v_~p~0_58 v_~p~0_57)))) InVars {~M~0=v_~M~0_52, ~p~0=v_~p~0_58, ~N~0=v_~N~0_72} OutVars{~M~0=v_~M~0_52, ~p~0=v_~p~0_57, ~N~0=v_~N~0_71} AuxVars[] AssignedVars[~p~0, ~N~0][514], [Black: 253#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 518#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 265#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 262#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 517#(= ~N~0 ~L~0), Black: 261#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 528#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 278#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 276#(or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))), Black: 272#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), 26#L100true, Black: 288#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 290#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 284#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 73#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0))), 640#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 297#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 300#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 296#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 310#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)) (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~N~0 4294967296) 1))) (= thread2Thread1of1ForFork1_~cond~1 0)), 28#L45true, Black: 307#(and (or (< 0 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 0)) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 306#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 89#true, Black: 61#(< 0 (mod ~N~0 4294967296)), 319#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 62#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 33#L69true, Black: 534#true, 259#true, Black: 700#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (<= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0) (<= 1 (mod ~N~0 4294967296))))), Black: 706#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 636#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 710#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 51#(<= (mod ~L~0 4294967296) 0), Black: 69#true, Black: 74#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)), 270#true, 23#thread3EXITtrue, Black: 314#true, Black: 475#(and (= ~p~0 0) (= ~q~0 0) (or (< 0 thread1Thread1of1ForFork0_~cond~0) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (= thread1Thread1of1ForFork0_~cond~0 1) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 470#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 thread1Thread1of1ForFork0_~cond~0) (< (mod ~N~0 4294967296) 2)) (= ~q~0 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)) (and (= ~p~0 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 421#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork0_~cond~0 256))), Black: 468#(and (= ~q~0 0) (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)), Black: 488#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 491#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), 719#true, Black: 240#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 244#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 98#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 234#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 238#(and (= ~q~0 0) (<= 1 (mod ~L~0 4294967296)))]) [2024-11-13 15:04:41,033 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-11-13 15:04:41,033 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-13 15:04:41,033 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-13 15:04:41,033 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-13 15:04:41,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([238] L45-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_1| |v_thread1Thread1of1ForFork0_#t~post1_2|)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~p~0, ~N~0][624], [Black: 253#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 518#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 265#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 262#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 517#(= ~N~0 ~L~0), Black: 261#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 528#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 278#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 276#(or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))), Black: 272#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), 26#L100true, Black: 288#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 290#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 284#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 73#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0))), 640#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 297#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 300#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 296#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), 27#L64true, 25#L50true, Black: 310#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)) (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~N~0 4294967296) 1))) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 307#(and (or (< 0 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 0)) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 306#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 89#true, Black: 61#(< 0 (mod ~N~0 4294967296)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 319#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 62#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 534#true, 259#true, Black: 700#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (<= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0) (<= 1 (mod ~N~0 4294967296))))), Black: 706#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 636#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 710#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 51#(<= (mod ~L~0 4294967296) 0), Black: 69#true, Black: 74#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)), 270#true, 23#thread3EXITtrue, Black: 314#true, Black: 475#(and (= ~p~0 0) (= ~q~0 0) (or (< 0 thread1Thread1of1ForFork0_~cond~0) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (= thread1Thread1of1ForFork0_~cond~0 1) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 470#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 thread1Thread1of1ForFork0_~cond~0) (< (mod ~N~0 4294967296) 2)) (= ~q~0 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)) (and (= ~p~0 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 421#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork0_~cond~0 256))), Black: 468#(and (= ~q~0 0) (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)), Black: 488#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 491#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), 719#true, Black: 240#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 244#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 98#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 234#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 238#(and (= ~q~0 0) (<= 1 (mod ~L~0 4294967296)))]) [2024-11-13 15:04:41,034 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-11-13 15:04:41,034 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-13 15:04:41,034 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-13 15:04:41,034 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-13 15:04:41,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([238] L45-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_1| |v_thread1Thread1of1ForFork0_#t~post1_2|)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~p~0, ~N~0][479], [Black: 253#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 518#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 265#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 262#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 517#(= ~N~0 ~L~0), Black: 261#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 534#true, Black: 528#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 278#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 276#(or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))), Black: 272#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), 46#true, 26#L100true, Black: 288#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 290#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 284#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 297#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 300#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 296#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), 27#L64true, 25#L50true, Black: 310#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)) (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~N~0 4294967296) 1))) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 307#(and (or (< 0 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 0)) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 306#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 61#(< 0 (mod ~N~0 4294967296)), 319#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 62#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 640#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), 259#true, Black: 700#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (<= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0) (<= 1 (mod ~N~0 4294967296))))), Black: 706#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 636#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 710#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 94#(<= 1 (mod ~L~0 4294967296)), 69#true, Black: 74#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 73#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)), 270#true, Black: 314#true, Black: 475#(and (= ~p~0 0) (= ~q~0 0) (or (< 0 thread1Thread1of1ForFork0_~cond~0) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (= thread1Thread1of1ForFork0_~cond~0 1) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 470#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 thread1Thread1of1ForFork0_~cond~0) (< (mod ~N~0 4294967296) 2)) (= ~q~0 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)) (and (= ~p~0 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 421#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork0_~cond~0 256))), Black: 468#(and (= ~q~0 0) (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)), Black: 488#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 491#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), 17#L80true, 719#true, Black: 240#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 244#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 98#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 234#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 238#(and (= ~q~0 0) (<= 1 (mod ~L~0 4294967296)))]) [2024-11-13 15:04:41,036 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-11-13 15:04:41,036 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-13 15:04:41,036 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-13 15:04:41,036 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-13 15:04:41,037 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L64-->L69: Formula: (let ((.cse0 (mod v_~N~0_72 4294967296))) (or (and (= (+ 2 v_~N~0_71) v_~N~0_72) (= v_~p~0_57 (+ v_~p~0_58 (* 2 v_~M~0_52))) (< 1 .cse0)) (and (= v_~N~0_72 v_~N~0_71) (<= .cse0 1) (= v_~p~0_58 v_~p~0_57)))) InVars {~M~0=v_~M~0_52, ~p~0=v_~p~0_58, ~N~0=v_~N~0_72} OutVars{~M~0=v_~M~0_52, ~p~0=v_~p~0_57, ~N~0=v_~N~0_71} AuxVars[] AssignedVars[~p~0, ~N~0][362], [Black: 253#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 518#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 265#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 262#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 517#(= ~N~0 ~L~0), Black: 261#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 534#true, Black: 528#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0)), Black: 278#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 276#(or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))), Black: 272#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), 46#true, 26#L100true, Black: 288#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 290#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), Black: 284#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 297#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 300#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork0_~cond~0 1)), Black: 296#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), Black: 310#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)) (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~N~0 4294967296) 1))) (= thread2Thread1of1ForFork1_~cond~1 0)), Black: 307#(and (or (< 0 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 0)) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), 28#L45true, Black: 306#(or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 61#(< 0 (mod ~N~0 4294967296)), 319#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 64#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 62#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 33#L69true, 259#true, Black: 640#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), Black: 700#(and (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (<= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0) (<= 1 (mod ~N~0 4294967296))))), Black: 706#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 636#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 710#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 94#(<= 1 (mod ~L~0 4294967296)), 69#true, Black: 74#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 73#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)), 270#true, Black: 314#true, Black: 475#(and (= ~p~0 0) (= ~q~0 0) (or (< 0 thread1Thread1of1ForFork0_~cond~0) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (= thread1Thread1of1ForFork0_~cond~0 1) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 470#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 thread1Thread1of1ForFork0_~cond~0) (< (mod ~N~0 4294967296) 2)) (= ~q~0 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)) (and (= ~p~0 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 421#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork0_~cond~0 256))), Black: 468#(and (= ~q~0 0) (= thread1Thread1of1ForFork0_~cond~0 1) (= (mod ~p~0 2) 0)), Black: 488#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 491#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork0_~cond~0 0)), 719#true, 17#L80true, Black: 240#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 244#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 98#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 234#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork0_~cond~0 1)) (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 238#(and (= ~q~0 0) (<= 1 (mod ~L~0 4294967296)))]) [2024-11-13 15:04:41,037 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-11-13 15:04:41,037 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-13 15:04:41,037 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-13 15:04:41,037 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-13 15:04:42,672 INFO L124 PetriNetUnfolderBase]: 14786/23274 cut-off events. [2024-11-13 15:04:42,672 INFO L125 PetriNetUnfolderBase]: For 475719/478187 co-relation queries the response was YES. [2024-11-13 15:04:42,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181731 conditions, 23274 events. 14786/23274 cut-off events. For 475719/478187 co-relation queries the response was YES. Maximal size of possible extension queue 1637. Compared 174499 event pairs, 2067 based on Foata normal form. 625/23689 useless extension candidates. Maximal degree in co-relation 174172. Up to 16043 conditions per place. [2024-11-13 15:04:42,890 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 450 selfloop transitions, 395 changer transitions 5/875 dead transitions. [2024-11-13 15:04:42,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 875 transitions, 21718 flow [2024-11-13 15:04:42,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:04:42,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-13 15:04:42,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 217 transitions. [2024-11-13 15:04:42,892 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6164772727272727 [2024-11-13 15:04:42,892 INFO L175 Difference]: Start difference. First operand has 149 places, 579 transitions, 13650 flow. Second operand 11 states and 217 transitions. [2024-11-13 15:04:42,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 875 transitions, 21718 flow [2024-11-13 15:04:45,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 875 transitions, 20480 flow, removed 582 selfloop flow, removed 2 redundant places. [2024-11-13 15:04:45,898 INFO L231 Difference]: Finished difference. Result has 160 places, 749 transitions, 18172 flow [2024-11-13 15:04:45,898 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=12676, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18172, PETRI_PLACES=160, PETRI_TRANSITIONS=749} [2024-11-13 15:04:45,899 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 125 predicate places. [2024-11-13 15:04:45,899 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 749 transitions, 18172 flow [2024-11-13 15:04:45,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.538461538461538) internal successors, (189), 13 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:45,899 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:04:45,900 INFO L204 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] [2024-11-13 15:04:45,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 15:04:46,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:04:46,104 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:04:46,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:04:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash 276611243, now seen corresponding path program 1 times [2024-11-13 15:04:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:04:46,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81119288] [2024-11-13 15:04:46,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:46,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:04:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:04:46,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:04:46,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81119288] [2024-11-13 15:04:46,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81119288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:04:46,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415699769] [2024-11-13 15:04:46,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:46,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:04:46,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:04:46,270 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:04:46,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 15:04:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:46,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 15:04:46,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:04:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:04:46,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:04:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:04:46,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415699769] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:04:46,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:04:46,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 18 [2024-11-13 15:04:46,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082847433] [2024-11-13 15:04:46,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:04:46,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 15:04:46,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:04:46,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 15:04:46,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2024-11-13 15:04:46,795 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-13 15:04:46,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 749 transitions, 18172 flow. Second operand has 18 states, 18 states have (on average 9.38888888888889) internal successors, (169), 18 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:04:46,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:04:46,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-13 15:04:46,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:04:51,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:04:56,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:05:00,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:05:05,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:05:09,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:05:14,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:05:18,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:05:22,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:05:27,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:05:31,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:05:40,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:05:42,788 INFO L124 PetriNetUnfolderBase]: 24036/36119 cut-off events. [2024-11-13 15:05:42,788 INFO L125 PetriNetUnfolderBase]: For 654471/654471 co-relation queries the response was YES. [2024-11-13 15:05:43,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274309 conditions, 36119 events. 24036/36119 cut-off events. For 654471/654471 co-relation queries the response was YES. Maximal size of possible extension queue 1993. Compared 260488 event pairs, 477 based on Foata normal form. 400/36517 useless extension candidates. Maximal degree in co-relation 267883. Up to 8122 conditions per place. [2024-11-13 15:05:43,182 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 844 selfloop transitions, 1319 changer transitions 0/2167 dead transitions. [2024-11-13 15:05:43,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 2167 transitions, 45136 flow [2024-11-13 15:05:43,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-13 15:05:43,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2024-11-13 15:05:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 950 transitions. [2024-11-13 15:05:43,186 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4638671875 [2024-11-13 15:05:43,186 INFO L175 Difference]: Start difference. First operand has 160 places, 749 transitions, 18172 flow. Second operand 64 states and 950 transitions. [2024-11-13 15:05:43,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 2167 transitions, 45136 flow [2024-11-13 15:05:49,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 2167 transitions, 44182 flow, removed 419 selfloop flow, removed 4 redundant places. [2024-11-13 15:05:49,207 INFO L231 Difference]: Finished difference. Result has 251 places, 1504 transitions, 37064 flow [2024-11-13 15:05:49,207 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=17495, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=636, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=37064, PETRI_PLACES=251, PETRI_TRANSITIONS=1504} [2024-11-13 15:05:49,208 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 216 predicate places. [2024-11-13 15:05:49,208 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 1504 transitions, 37064 flow [2024-11-13 15:05:49,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.38888888888889) internal successors, (169), 18 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:05:49,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:05:49,208 INFO L204 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] [2024-11-13 15:05:49,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 15:05:49,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:05:49,409 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-13 15:05:49,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:05:49,409 INFO L85 PathProgramCache]: Analyzing trace with hash -528194601, now seen corresponding path program 2 times [2024-11-13 15:05:49,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:05:49,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682469834] [2024-11-13 15:05:49,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:05:49,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:05:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:49,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:05:49,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:05:49,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682469834] [2024-11-13 15:05:49,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682469834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:05:49,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658577711] [2024-11-13 15:05:49,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:05:49,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:05:49,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:05:49,684 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:05:49,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1868ab9-6c25-41b6-9ab6-f4d4861c22cd/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 15:05:49,800 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:05:49,800 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:05:49,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 15:05:49,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:05:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:05:50,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:05:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:05:50,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658577711] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:05:50,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:05:50,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 15 [2024-11-13 15:05:50,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799248790] [2024-11-13 15:05:50,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:05:50,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 15:05:50,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:05:50,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 15:05:50,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:05:50,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-13 15:05:50,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 1504 transitions, 37064 flow. Second operand has 16 states, 16 states have (on average 9.9375) internal successors, (159), 16 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:05:50,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:05:50,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-13 15:05:50,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:06:00,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:06:13,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:06:21,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:06:30,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:06:34,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:06:38,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:06:42,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:06:46,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:06:51,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:06:56,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:00,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:04,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:13,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:29,699 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification. DAG size of input: 34 DAG size of output: 20 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:07:33,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:37,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:43,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:47,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:54,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:07:58,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:04,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:12,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:21,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:26,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:33,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:08:38,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:09:01,552 WARN L286 SmtUtils]: Spent 20.07s on a formula simplification. DAG size of input: 43 DAG size of output: 22 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:09:06,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:09:20,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:09:27,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:09:32,932 INFO L124 PetriNetUnfolderBase]: 67188/98850 cut-off events. [2024-11-13 15:09:32,932 INFO L125 PetriNetUnfolderBase]: For 2619084/2619087 co-relation queries the response was YES. [2024-11-13 15:09:33,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901240 conditions, 98850 events. 67188/98850 cut-off events. For 2619084/2619087 co-relation queries the response was YES. Maximal size of possible extension queue 2761. Compared 721710 event pairs, 3384 based on Foata normal form. 3674/102521 useless extension candidates. Maximal degree in co-relation 899854. Up to 23929 conditions per place. [2024-11-13 15:09:34,685 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 3238 selfloop transitions, 4292 changer transitions 0/7534 dead transitions. [2024-11-13 15:09:34,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 7534 transitions, 185155 flow [2024-11-13 15:09:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-13 15:09:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2024-11-13 15:09:34,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 1166 transitions. [2024-11-13 15:09:34,690 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5973360655737705 [2024-11-13 15:09:34,691 INFO L175 Difference]: Start difference. First operand has 251 places, 1504 transitions, 37064 flow. Second operand 61 states and 1166 transitions. [2024-11-13 15:09:34,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 7534 transitions, 185155 flow