./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-mult-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-mult-4.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya --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 b81cf2d80bc77dedaac253250be737ceaa09f6e691f026864fe6fd5cb48c2489 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:29:26,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:29:26,395 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:29:26,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:29:26,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:29:26,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:29:26,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:29:26,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:29:26,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:29:26,427 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:29:26,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:29:26,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:29:26,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:29:26,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:29:26,429 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:29:26,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:29:26,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:29:26,431 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:29:26,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:29:26,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:29:26,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:29:26,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:29:26,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:29:26,434 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:29:26,435 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:29:26,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:29:26,435 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:29:26,436 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:29:26,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:29:26,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:29:26,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:29:26,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:29:26,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:29:26,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:29:26,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:29:26,439 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:29:26,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:29:26,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:29:26,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:29:26,439 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:29:26,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:29:26,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:29:26,440 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya 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 -> b81cf2d80bc77dedaac253250be737ceaa09f6e691f026864fe6fd5cb48c2489 [2023-11-29 00:29:26,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:29:26,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:29:26,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:29:26,682 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:29:26,682 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:29:26,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/popl20-mult-4.wvr.c [2023-11-29 00:29:29,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:29:29,632 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:29:29,633 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/sv-benchmarks/c/weaver/popl20-mult-4.wvr.c [2023-11-29 00:29:29,640 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/data/457ff2588/b05800037eb94e2589957035f0ff46c1/FLAG138acfb09 [2023-11-29 00:29:29,653 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/data/457ff2588/b05800037eb94e2589957035f0ff46c1 [2023-11-29 00:29:29,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:29:29,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:29:29,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:29:29,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:29:29,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:29:29,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:29:29" (1/1) ... [2023-11-29 00:29:29,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2adb5ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:29, skipping insertion in model container [2023-11-29 00:29:29,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:29:29" (1/1) ... [2023-11-29 00:29:29,690 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:29:29,847 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/sv-benchmarks/c/weaver/popl20-mult-4.wvr.c[2664,2677] [2023-11-29 00:29:29,853 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:29:29,864 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:29:29,888 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/sv-benchmarks/c/weaver/popl20-mult-4.wvr.c[2664,2677] [2023-11-29 00:29:29,889 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:29:29,898 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:29:29,898 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:29:29,904 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:29:29,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:29 WrapperNode [2023-11-29 00:29:29,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:29:29,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:29:29,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:29:29,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:29:29,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:29" (1/1) ... [2023-11-29 00:29:29,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:29" (1/1) ... [2023-11-29 00:29:29,944 INFO L138 Inliner]: procedures = 23, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2023-11-29 00:29:29,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:29:29,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:29:29,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:29:29,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:29:29,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:29" (1/1) ... [2023-11-29 00:29:29,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:29" (1/1) ... [2023-11-29 00:29:29,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:29" (1/1) ... [2023-11-29 00:29:29,977 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 00:29:29,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:29" (1/1) ... [2023-11-29 00:29:29,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:29" (1/1) ... [2023-11-29 00:29:29,985 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:29" (1/1) ... [2023-11-29 00:29:29,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:29" (1/1) ... [2023-11-29 00:29:29,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:29" (1/1) ... [2023-11-29 00:29:29,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:29" (1/1) ... [2023-11-29 00:29:29,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:29:29,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:29:29,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:29:29,998 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:29:29,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:29" (1/1) ... [2023-11-29 00:29:30,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:29:30,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:29:30,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:29:30,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:29:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:29:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 00:29:30,066 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 00:29:30,066 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 00:29:30,066 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 00:29:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 00:29:30,067 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 00:29:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-29 00:29:30,067 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-29 00:29:30,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:29:30,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:29:30,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:29:30,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 00:29:30,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 00:29:30,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:29:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:29:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:29:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 00:29:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 00:29:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 00:29:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 00:29:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 00:29:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:29:30,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:29:30,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 00:29:30,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 00:29:30,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 00:29:30,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 00:29:30,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 00:29:30,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:29:30,073 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:29:30,186 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:29:30,188 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:29:30,414 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:29:30,584 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:29:30,584 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 00:29:30,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:29:30 BoogieIcfgContainer [2023-11-29 00:29:30,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:29:30,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:29:30,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:29:30,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:29:30,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:29:29" (1/3) ... [2023-11-29 00:29:30,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793488e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:29:30, skipping insertion in model container [2023-11-29 00:29:30,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:29" (2/3) ... [2023-11-29 00:29:30,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793488e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:29:30, skipping insertion in model container [2023-11-29 00:29:30,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:29:30" (3/3) ... [2023-11-29 00:29:30,594 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2023-11-29 00:29:30,603 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 00:29:30,613 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:29:30,613 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:29:30,614 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:29:30,686 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-29 00:29:30,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 114 flow [2023-11-29 00:29:30,750 INFO L124 PetriNetUnfolderBase]: 4/39 cut-off events. [2023-11-29 00:29:30,750 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 00:29:30,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 39 events. 4/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2023-11-29 00:29:30,754 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 43 transitions, 114 flow [2023-11-29 00:29:30,758 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 100 flow [2023-11-29 00:29:30,768 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:29:30,775 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@143a189d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:29:30,776 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-29 00:29:30,792 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:29:30,792 INFO L124 PetriNetUnfolderBase]: 4/37 cut-off events. [2023-11-29 00:29:30,792 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 00:29:30,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:30,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:30,794 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:29:30,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:30,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1312954270, now seen corresponding path program 1 times [2023-11-29 00:29:30,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:30,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553278688] [2023-11-29 00:29:30,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:30,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:31,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:31,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553278688] [2023-11-29 00:29:31,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553278688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:31,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:31,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:29:31,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591208096] [2023-11-29 00:29:31,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:31,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:31,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:31,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:31,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:31,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2023-11-29 00:29:31,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:31,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:31,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2023-11-29 00:29:31,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:31,891 INFO L124 PetriNetUnfolderBase]: 3350/4633 cut-off events. [2023-11-29 00:29:31,891 INFO L125 PetriNetUnfolderBase]: For 323/323 co-relation queries the response was YES. [2023-11-29 00:29:31,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9464 conditions, 4633 events. 3350/4633 cut-off events. For 323/323 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 20192 event pairs, 860 based on Foata normal form. 147/4770 useless extension candidates. Maximal degree in co-relation 7596. Up to 3527 conditions per place. [2023-11-29 00:29:31,935 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 51 selfloop transitions, 3 changer transitions 3/62 dead transitions. [2023-11-29 00:29:31,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 283 flow [2023-11-29 00:29:31,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:31,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:29:31,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2023-11-29 00:29:31,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2023-11-29 00:29:31,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 87 transitions. [2023-11-29 00:29:31,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 87 transitions. [2023-11-29 00:29:31,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:29:31,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 87 transitions. [2023-11-29 00:29:31,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:31,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:31,958 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:31,960 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 100 flow. Second operand 3 states and 87 transitions. [2023-11-29 00:29:31,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 283 flow [2023-11-29 00:29:31,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 62 transitions, 253 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-29 00:29:31,975 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 107 flow [2023-11-29 00:29:31,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2023-11-29 00:29:31,981 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2023-11-29 00:29:31,981 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 107 flow [2023-11-29 00:29:31,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:31,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:31,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:31,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:29:31,982 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:29:31,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:31,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1636013014, now seen corresponding path program 1 times [2023-11-29 00:29:31,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:31,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560927449] [2023-11-29 00:29:31,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:31,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:32,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:32,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:32,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560927449] [2023-11-29 00:29:32,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560927449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:32,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:32,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:29:32,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178457407] [2023-11-29 00:29:32,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:32,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:29:32,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:32,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:29:32,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:29:32,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2023-11-29 00:29:32,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:32,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:32,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2023-11-29 00:29:32,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:33,708 INFO L124 PetriNetUnfolderBase]: 12543/16772 cut-off events. [2023-11-29 00:29:33,709 INFO L125 PetriNetUnfolderBase]: For 985/985 co-relation queries the response was YES. [2023-11-29 00:29:33,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35545 conditions, 16772 events. 12543/16772 cut-off events. For 985/985 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 85191 event pairs, 4669 based on Foata normal form. 0/13261 useless extension candidates. Maximal degree in co-relation 10119. Up to 9345 conditions per place. [2023-11-29 00:29:33,812 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 84 selfloop transitions, 10 changer transitions 0/99 dead transitions. [2023-11-29 00:29:33,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 99 transitions, 430 flow [2023-11-29 00:29:33,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:29:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:29:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2023-11-29 00:29:33,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6139534883720931 [2023-11-29 00:29:33,816 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 132 transitions. [2023-11-29 00:29:33,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 132 transitions. [2023-11-29 00:29:33,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:29:33,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 132 transitions. [2023-11-29 00:29:33,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:33,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:33,820 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:33,820 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 107 flow. Second operand 5 states and 132 transitions. [2023-11-29 00:29:33,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 99 transitions, 430 flow [2023-11-29 00:29:33,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 99 transitions, 427 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:29:33,824 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 171 flow [2023-11-29 00:29:33,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=48, PETRI_TRANSITIONS=49} [2023-11-29 00:29:33,825 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2023-11-29 00:29:33,826 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 171 flow [2023-11-29 00:29:33,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:33,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:33,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:33,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:29:33,827 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:29:33,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:33,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1645224102, now seen corresponding path program 2 times [2023-11-29 00:29:33,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:33,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652988632] [2023-11-29 00:29:33,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:33,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:34,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:34,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652988632] [2023-11-29 00:29:34,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652988632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:34,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:34,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:29:34,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462228026] [2023-11-29 00:29:34,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:34,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:29:34,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:34,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:29:34,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:29:34,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2023-11-29 00:29:34,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:34,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:34,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2023-11-29 00:29:34,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:36,043 INFO L124 PetriNetUnfolderBase]: 18370/24725 cut-off events. [2023-11-29 00:29:36,044 INFO L125 PetriNetUnfolderBase]: For 10938/11016 co-relation queries the response was YES. [2023-11-29 00:29:36,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64730 conditions, 24725 events. 18370/24725 cut-off events. For 10938/11016 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 134861 event pairs, 3394 based on Foata normal form. 714/25019 useless extension candidates. Maximal degree in co-relation 37264. Up to 13675 conditions per place. [2023-11-29 00:29:36,235 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 91 selfloop transitions, 8 changer transitions 3/107 dead transitions. [2023-11-29 00:29:36,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 107 transitions, 566 flow [2023-11-29 00:29:36,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:29:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:29:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2023-11-29 00:29:36,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6569767441860465 [2023-11-29 00:29:36,238 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 113 transitions. [2023-11-29 00:29:36,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 113 transitions. [2023-11-29 00:29:36,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:29:36,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 113 transitions. [2023-11-29 00:29:36,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:36,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:36,241 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:36,241 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 171 flow. Second operand 4 states and 113 transitions. [2023-11-29 00:29:36,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 107 transitions, 566 flow [2023-11-29 00:29:36,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 107 transitions, 566 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:29:36,257 INFO L231 Difference]: Finished difference. Result has 54 places, 57 transitions, 257 flow [2023-11-29 00:29:36,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=54, PETRI_TRANSITIONS=57} [2023-11-29 00:29:36,258 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-11-29 00:29:36,259 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 57 transitions, 257 flow [2023-11-29 00:29:36,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:36,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:36,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:36,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:29:36,260 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:29:36,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:36,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1930970174, now seen corresponding path program 3 times [2023-11-29 00:29:36,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:36,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059017484] [2023-11-29 00:29:36,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:36,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:36,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:36,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059017484] [2023-11-29 00:29:36,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059017484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:36,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:36,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:29:36,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671972621] [2023-11-29 00:29:36,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:36,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:29:36,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:36,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:29:36,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:29:36,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2023-11-29 00:29:36,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 57 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:36,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:36,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2023-11-29 00:29:36,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:38,848 INFO L124 PetriNetUnfolderBase]: 24182/32187 cut-off events. [2023-11-29 00:29:38,848 INFO L125 PetriNetUnfolderBase]: For 29408/29478 co-relation queries the response was YES. [2023-11-29 00:29:38,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95014 conditions, 32187 events. 24182/32187 cut-off events. For 29408/29478 co-relation queries the response was YES. Maximal size of possible extension queue 1185. Compared 174845 event pairs, 6854 based on Foata normal form. 198/31764 useless extension candidates. Maximal degree in co-relation 36900. Up to 13097 conditions per place. [2023-11-29 00:29:39,022 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 101 selfloop transitions, 18 changer transitions 0/124 dead transitions. [2023-11-29 00:29:39,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 124 transitions, 755 flow [2023-11-29 00:29:39,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:29:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:29:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2023-11-29 00:29:39,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6139534883720931 [2023-11-29 00:29:39,024 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 132 transitions. [2023-11-29 00:29:39,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 132 transitions. [2023-11-29 00:29:39,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:29:39,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 132 transitions. [2023-11-29 00:29:39,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:39,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:39,028 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:39,028 INFO L175 Difference]: Start difference. First operand has 54 places, 57 transitions, 257 flow. Second operand 5 states and 132 transitions. [2023-11-29 00:29:39,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 124 transitions, 755 flow [2023-11-29 00:29:39,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 124 transitions, 755 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:29:39,054 INFO L231 Difference]: Finished difference. Result has 60 places, 67 transitions, 388 flow [2023-11-29 00:29:39,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=388, PETRI_PLACES=60, PETRI_TRANSITIONS=67} [2023-11-29 00:29:39,055 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places. [2023-11-29 00:29:39,055 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 67 transitions, 388 flow [2023-11-29 00:29:39,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:39,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:39,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:39,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:29:39,057 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:29:39,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:39,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1551907320, now seen corresponding path program 4 times [2023-11-29 00:29:39,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:39,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719110698] [2023-11-29 00:29:39,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:39,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:39,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:39,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:39,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719110698] [2023-11-29 00:29:39,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719110698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:39,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:39,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:29:39,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598306384] [2023-11-29 00:29:39,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:39,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:29:39,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:39,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:29:39,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:29:39,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2023-11-29 00:29:39,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 67 transitions, 388 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:39,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:39,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2023-11-29 00:29:39,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:41,585 INFO L124 PetriNetUnfolderBase]: 24565/32918 cut-off events. [2023-11-29 00:29:41,585 INFO L125 PetriNetUnfolderBase]: For 59473/59549 co-relation queries the response was YES. [2023-11-29 00:29:41,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108148 conditions, 32918 events. 24565/32918 cut-off events. For 59473/59549 co-relation queries the response was YES. Maximal size of possible extension queue 1194. Compared 181856 event pairs, 7328 based on Foata normal form. 412/32711 useless extension candidates. Maximal degree in co-relation 40728. Up to 16730 conditions per place. [2023-11-29 00:29:41,764 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 97 selfloop transitions, 13 changer transitions 0/115 dead transitions. [2023-11-29 00:29:41,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 115 transitions, 783 flow [2023-11-29 00:29:41,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:29:41,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:29:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2023-11-29 00:29:41,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6569767441860465 [2023-11-29 00:29:41,766 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 113 transitions. [2023-11-29 00:29:41,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 113 transitions. [2023-11-29 00:29:41,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:29:41,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 113 transitions. [2023-11-29 00:29:41,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:41,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:41,768 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:41,768 INFO L175 Difference]: Start difference. First operand has 60 places, 67 transitions, 388 flow. Second operand 4 states and 113 transitions. [2023-11-29 00:29:41,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 115 transitions, 783 flow [2023-11-29 00:29:41,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 115 transitions, 769 flow, removed 7 selfloop flow, removed 0 redundant places. [2023-11-29 00:29:41,846 INFO L231 Difference]: Finished difference. Result has 64 places, 67 transitions, 415 flow [2023-11-29 00:29:41,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=415, PETRI_PLACES=64, PETRI_TRANSITIONS=67} [2023-11-29 00:29:41,848 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places. [2023-11-29 00:29:41,848 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 67 transitions, 415 flow [2023-11-29 00:29:41,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:41,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:41,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:41,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:29:41,849 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:29:41,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:41,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2047129078, now seen corresponding path program 1 times [2023-11-29 00:29:41,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:41,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471137014] [2023-11-29 00:29:41,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:41,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:41,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:41,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:41,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471137014] [2023-11-29 00:29:41,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471137014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:41,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:41,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:29:41,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089128842] [2023-11-29 00:29:41,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:41,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:29:41,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:41,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:29:41,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:29:42,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2023-11-29 00:29:42,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 67 transitions, 415 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:42,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:42,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2023-11-29 00:29:42,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:45,022 INFO L124 PetriNetUnfolderBase]: 27297/36859 cut-off events. [2023-11-29 00:29:45,022 INFO L125 PetriNetUnfolderBase]: For 92199/92221 co-relation queries the response was YES. [2023-11-29 00:29:45,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123339 conditions, 36859 events. 27297/36859 cut-off events. For 92199/92221 co-relation queries the response was YES. Maximal size of possible extension queue 1334. Compared 210349 event pairs, 8117 based on Foata normal form. 1000/36967 useless extension candidates. Maximal degree in co-relation 45191. Up to 17649 conditions per place. [2023-11-29 00:29:45,237 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 98 selfloop transitions, 12 changer transitions 19/134 dead transitions. [2023-11-29 00:29:45,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 134 transitions, 968 flow [2023-11-29 00:29:45,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:29:45,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:29:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2023-11-29 00:29:45,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.641860465116279 [2023-11-29 00:29:45,239 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 138 transitions. [2023-11-29 00:29:45,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 138 transitions. [2023-11-29 00:29:45,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:29:45,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 138 transitions. [2023-11-29 00:29:45,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:45,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:45,242 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:45,242 INFO L175 Difference]: Start difference. First operand has 64 places, 67 transitions, 415 flow. Second operand 5 states and 138 transitions. [2023-11-29 00:29:45,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 134 transitions, 968 flow [2023-11-29 00:29:45,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 134 transitions, 881 flow, removed 22 selfloop flow, removed 4 redundant places. [2023-11-29 00:29:45,299 INFO L231 Difference]: Finished difference. Result has 66 places, 67 transitions, 419 flow [2023-11-29 00:29:45,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=419, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2023-11-29 00:29:45,300 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2023-11-29 00:29:45,300 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 419 flow [2023-11-29 00:29:45,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:45,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:45,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:45,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:29:45,302 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:29:45,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:45,302 INFO L85 PathProgramCache]: Analyzing trace with hash -144301828, now seen corresponding path program 2 times [2023-11-29 00:29:45,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:45,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281440689] [2023-11-29 00:29:45,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:45,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:45,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:45,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281440689] [2023-11-29 00:29:45,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281440689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:45,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:45,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:29:45,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886461124] [2023-11-29 00:29:45,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:45,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:29:45,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:45,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:29:45,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:29:45,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2023-11-29 00:29:45,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 419 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:45,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:45,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2023-11-29 00:29:45,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:47,729 INFO L124 PetriNetUnfolderBase]: 25369/34392 cut-off events. [2023-11-29 00:29:47,729 INFO L125 PetriNetUnfolderBase]: For 78638/78712 co-relation queries the response was YES. [2023-11-29 00:29:47,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118882 conditions, 34392 events. 25369/34392 cut-off events. For 78638/78712 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 194997 event pairs, 8187 based on Foata normal form. 694/34309 useless extension candidates. Maximal degree in co-relation 48873. Up to 17138 conditions per place. [2023-11-29 00:29:47,923 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 85 selfloop transitions, 18 changer transitions 5/113 dead transitions. [2023-11-29 00:29:47,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 113 transitions, 850 flow [2023-11-29 00:29:47,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:29:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:29:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2023-11-29 00:29:47,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6337209302325582 [2023-11-29 00:29:47,925 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 109 transitions. [2023-11-29 00:29:47,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 109 transitions. [2023-11-29 00:29:47,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:29:47,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 109 transitions. [2023-11-29 00:29:47,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:47,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:47,926 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:47,927 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 419 flow. Second operand 4 states and 109 transitions. [2023-11-29 00:29:47,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 113 transitions, 850 flow [2023-11-29 00:29:48,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 113 transitions, 811 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-11-29 00:29:48,075 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 459 flow [2023-11-29 00:29:48,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=459, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2023-11-29 00:29:48,076 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2023-11-29 00:29:48,076 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 459 flow [2023-11-29 00:29:48,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:48,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:48,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:48,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:29:48,076 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:29:48,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:48,077 INFO L85 PathProgramCache]: Analyzing trace with hash 421252365, now seen corresponding path program 1 times [2023-11-29 00:29:48,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:48,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109208993] [2023-11-29 00:29:48,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:48,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:48,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:48,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109208993] [2023-11-29 00:29:48,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109208993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:48,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:48,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:29:48,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789857969] [2023-11-29 00:29:48,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:48,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:29:48,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:48,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:29:48,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:29:48,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2023-11-29 00:29:48,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 459 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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) [2023-11-29 00:29:48,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:48,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2023-11-29 00:29:48,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:51,589 INFO L124 PetriNetUnfolderBase]: 30576/41505 cut-off events. [2023-11-29 00:29:51,589 INFO L125 PetriNetUnfolderBase]: For 97800/97870 co-relation queries the response was YES. [2023-11-29 00:29:51,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147663 conditions, 41505 events. 30576/41505 cut-off events. For 97800/97870 co-relation queries the response was YES. Maximal size of possible extension queue 1585. Compared 243162 event pairs, 5175 based on Foata normal form. 882/41715 useless extension candidates. Maximal degree in co-relation 65256. Up to 17407 conditions per place. [2023-11-29 00:29:52,055 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 126 selfloop transitions, 25 changer transitions 7/163 dead transitions. [2023-11-29 00:29:52,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 163 transitions, 1215 flow [2023-11-29 00:29:52,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:29:52,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 00:29:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2023-11-29 00:29:52,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6146179401993356 [2023-11-29 00:29:52,056 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 185 transitions. [2023-11-29 00:29:52,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 185 transitions. [2023-11-29 00:29:52,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:29:52,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 185 transitions. [2023-11-29 00:29:52,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 26.428571428571427) internal successors, (185), 7 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:52,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 43.0) internal successors, (344), 8 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:52,059 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 43.0) internal successors, (344), 8 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:52,059 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 459 flow. Second operand 7 states and 185 transitions. [2023-11-29 00:29:52,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 163 transitions, 1215 flow [2023-11-29 00:29:52,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 163 transitions, 1188 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-11-29 00:29:52,078 INFO L231 Difference]: Finished difference. Result has 72 places, 75 transitions, 611 flow [2023-11-29 00:29:52,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=611, PETRI_PLACES=72, PETRI_TRANSITIONS=75} [2023-11-29 00:29:52,079 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2023-11-29 00:29:52,079 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 611 flow [2023-11-29 00:29:52,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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) [2023-11-29 00:29:52,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:52,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:52,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:29:52,079 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:29:52,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:52,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1103270487, now seen corresponding path program 1 times [2023-11-29 00:29:52,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:52,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9733683] [2023-11-29 00:29:52,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:52,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:29:52,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:52,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9733683] [2023-11-29 00:29:52,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9733683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:52,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:52,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:29:52,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910592965] [2023-11-29 00:29:52,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:52,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:29:52,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:52,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:29:52,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:29:52,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2023-11-29 00:29:52,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 611 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:52,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:52,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2023-11-29 00:29:52,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:56,267 INFO L124 PetriNetUnfolderBase]: 38255/51539 cut-off events. [2023-11-29 00:29:56,268 INFO L125 PetriNetUnfolderBase]: For 178907/178931 co-relation queries the response was YES. [2023-11-29 00:29:56,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193955 conditions, 51539 events. 38255/51539 cut-off events. For 178907/178931 co-relation queries the response was YES. Maximal size of possible extension queue 1962. Compared 305210 event pairs, 10513 based on Foata normal form. 320/50817 useless extension candidates. Maximal degree in co-relation 113751. Up to 23622 conditions per place. [2023-11-29 00:29:56,646 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 138 selfloop transitions, 31 changer transitions 4/178 dead transitions. [2023-11-29 00:29:56,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 178 transitions, 1861 flow [2023-11-29 00:29:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:29:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:29:56,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2023-11-29 00:29:56,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2023-11-29 00:29:56,648 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 129 transitions. [2023-11-29 00:29:56,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 129 transitions. [2023-11-29 00:29:56,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:29:56,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 129 transitions. [2023-11-29 00:29:56,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:56,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:56,651 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:56,651 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 611 flow. Second operand 5 states and 129 transitions. [2023-11-29 00:29:56,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 178 transitions, 1861 flow [2023-11-29 00:29:56,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 178 transitions, 1744 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-11-29 00:29:56,973 INFO L231 Difference]: Finished difference. Result has 76 places, 93 transitions, 846 flow [2023-11-29 00:29:56,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=846, PETRI_PLACES=76, PETRI_TRANSITIONS=93} [2023-11-29 00:29:56,974 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2023-11-29 00:29:56,974 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 93 transitions, 846 flow [2023-11-29 00:29:56,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:56,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:56,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:56,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:29:56,975 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:29:56,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:56,976 INFO L85 PathProgramCache]: Analyzing trace with hash -389034543, now seen corresponding path program 2 times [2023-11-29 00:29:56,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:56,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420748173] [2023-11-29 00:29:56,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:56,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:57,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:29:57,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:57,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420748173] [2023-11-29 00:29:57,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420748173] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:29:57,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125336750] [2023-11-29 00:29:57,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:29:57,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:29:57,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:29:57,249 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:29:57,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:29:57,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:29:57,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:29:57,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:29:57,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:29:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:29:57,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:29:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:29:57,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125336750] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 00:29:57,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:29:57,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 8 [2023-11-29 00:29:57,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997244288] [2023-11-29 00:29:57,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:57,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:29:57,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:57,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:29:57,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:29:57,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2023-11-29 00:29:57,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 93 transitions, 846 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:57,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:57,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2023-11-29 00:29:57,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:30:02,291 INFO L124 PetriNetUnfolderBase]: 42399/57354 cut-off events. [2023-11-29 00:30:02,292 INFO L125 PetriNetUnfolderBase]: For 262265/262395 co-relation queries the response was YES. [2023-11-29 00:30:02,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249869 conditions, 57354 events. 42399/57354 cut-off events. For 262265/262395 co-relation queries the response was YES. Maximal size of possible extension queue 2295. Compared 347277 event pairs, 5910 based on Foata normal form. 1912/58152 useless extension candidates. Maximal degree in co-relation 147074. Up to 27127 conditions per place. [2023-11-29 00:30:02,847 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 152 selfloop transitions, 11 changer transitions 9/177 dead transitions. [2023-11-29 00:30:02,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 177 transitions, 1984 flow [2023-11-29 00:30:02,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:30:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:30:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2023-11-29 00:30:02,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6104651162790697 [2023-11-29 00:30:02,849 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 105 transitions. [2023-11-29 00:30:02,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 105 transitions. [2023-11-29 00:30:02,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:30:02,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 105 transitions. [2023-11-29 00:30:02,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:02,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:02,850 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:02,850 INFO L175 Difference]: Start difference. First operand has 76 places, 93 transitions, 846 flow. Second operand 4 states and 105 transitions. [2023-11-29 00:30:02,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 177 transitions, 1984 flow [2023-11-29 00:30:03,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 177 transitions, 1924 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:30:03,223 INFO L231 Difference]: Finished difference. Result has 80 places, 96 transitions, 890 flow [2023-11-29 00:30:03,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=890, PETRI_PLACES=80, PETRI_TRANSITIONS=96} [2023-11-29 00:30:03,224 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 33 predicate places. [2023-11-29 00:30:03,224 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 96 transitions, 890 flow [2023-11-29 00:30:03,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:03,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:30:03,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:03,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:30:03,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 00:30:03,425 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:30:03,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:03,426 INFO L85 PathProgramCache]: Analyzing trace with hash -365783145, now seen corresponding path program 3 times [2023-11-29 00:30:03,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:03,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675524906] [2023-11-29 00:30:03,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:03,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:03,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:30:03,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:03,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675524906] [2023-11-29 00:30:03,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675524906] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:03,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:03,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:30:03,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654425834] [2023-11-29 00:30:03,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:03,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:30:03,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:03,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:30:03,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:30:03,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2023-11-29 00:30:03,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 96 transitions, 890 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:03,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:30:03,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2023-11-29 00:30:03,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:30:10,502 INFO L124 PetriNetUnfolderBase]: 55487/75481 cut-off events. [2023-11-29 00:30:10,502 INFO L125 PetriNetUnfolderBase]: For 359756/359874 co-relation queries the response was YES. [2023-11-29 00:30:10,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333183 conditions, 75481 events. 55487/75481 cut-off events. For 359756/359874 co-relation queries the response was YES. Maximal size of possible extension queue 2833. Compared 477151 event pairs, 19351 based on Foata normal form. 378/74164 useless extension candidates. Maximal degree in co-relation 196045. Up to 46061 conditions per place. [2023-11-29 00:30:11,052 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 187 selfloop transitions, 27 changer transitions 5/224 dead transitions. [2023-11-29 00:30:11,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 224 transitions, 2628 flow [2023-11-29 00:30:11,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:30:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:30:11,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2023-11-29 00:30:11,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2023-11-29 00:30:11,054 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 129 transitions. [2023-11-29 00:30:11,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 129 transitions. [2023-11-29 00:30:11,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:30:11,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 129 transitions. [2023-11-29 00:30:11,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:11,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:11,056 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:11,056 INFO L175 Difference]: Start difference. First operand has 80 places, 96 transitions, 890 flow. Second operand 5 states and 129 transitions. [2023-11-29 00:30:11,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 224 transitions, 2628 flow [2023-11-29 00:30:12,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 224 transitions, 2589 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:30:12,006 INFO L231 Difference]: Finished difference. Result has 85 places, 119 transitions, 1280 flow [2023-11-29 00:30:12,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1280, PETRI_PLACES=85, PETRI_TRANSITIONS=119} [2023-11-29 00:30:12,007 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 38 predicate places. [2023-11-29 00:30:12,007 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 119 transitions, 1280 flow [2023-11-29 00:30:12,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:12,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:30:12,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:12,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:30:12,007 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:30:12,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:12,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2140414755, now seen corresponding path program 2 times [2023-11-29 00:30:12,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:12,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103199919] [2023-11-29 00:30:12,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:12,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:12,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:30:12,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:12,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103199919] [2023-11-29 00:30:12,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103199919] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:12,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:12,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:30:12,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115652691] [2023-11-29 00:30:12,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:12,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:30:12,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:12,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:30:12,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:30:12,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2023-11-29 00:30:12,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 119 transitions, 1280 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:12,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:30:12,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2023-11-29 00:30:12,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:30:20,794 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_56 4294967296)) 1 0) 0)) (= v_~counter~0_56 (+ v_~c~0_44 v_~counter~0_55))) InVars {~c~0=v_~c~0_44, ~counter~0=v_~counter~0_56} OutVars{~counter~0=v_~counter~0_55, ~c~0=v_~c~0_44, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][142], [60#true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 24#L44true, Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 69#true, Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 328#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 45#L76true, 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 8#L51-5true, 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 334#true, Black: 108#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 13#L94-4true, Black: 57#(= ~counter~0 0), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 121#(= thread1Thread1of1ForFork0_~i~0 0)]) [2023-11-29 00:30:20,794 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-29 00:30:20,794 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:30:20,794 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:30:20,794 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:30:21,145 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_56 4294967296)) 1 0) 0)) (= v_~counter~0_56 (+ v_~c~0_44 v_~counter~0_55))) InVars {~c~0=v_~c~0_44, ~counter~0=v_~counter~0_56} OutVars{~counter~0=v_~counter~0_55, ~c~0=v_~c~0_44, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][142], [60#true, 42#L95-1true, 24#L44true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 69#true, Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 328#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 45#L76true, 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 8#L51-5true, 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 334#true, Black: 108#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 57#(= ~counter~0 0), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 121#(= thread1Thread1of1ForFork0_~i~0 0)]) [2023-11-29 00:30:21,145 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-29 00:30:21,145 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:30:21,145 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:30:21,145 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:30:21,148 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_56 4294967296)) 1 0) 0)) (= v_~counter~0_56 (+ v_~c~0_44 v_~counter~0_55))) InVars {~c~0=v_~c~0_44, ~counter~0=v_~counter~0_56} OutVars{~counter~0=v_~counter~0_55, ~c~0=v_~c~0_44, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][142], [60#true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 24#L44true, Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 69#true, Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 328#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 45#L76true, 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 9#L52true, Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 334#true, Black: 108#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 13#L94-4true, Black: 57#(= ~counter~0 0), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 121#(= thread1Thread1of1ForFork0_~i~0 0)]) [2023-11-29 00:30:21,148 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-29 00:30:21,148 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:30:21,148 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:30:21,148 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:30:21,148 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L52-->L55: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_50 4294967296)) 1 0) 0)) (= (+ v_~c~0_42 v_~counter~0_49) v_~counter~0_50)) InVars {~c~0=v_~c~0_42, ~counter~0=v_~counter~0_50} OutVars{~counter~0=v_~counter~0_49, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~c~0=v_~c~0_42} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][136], [60#true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 24#L44true, Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 69#true, Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 328#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 77#true, 16#L55true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 43#L73true, 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 334#true, Black: 108#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 13#L94-4true, Black: 57#(= ~counter~0 0), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 121#(= thread1Thread1of1ForFork0_~i~0 0)]) [2023-11-29 00:30:21,148 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-29 00:30:21,148 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:30:21,148 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:30:21,149 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:30:21,149 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_56 4294967296)) 1 0) 0)) (= v_~counter~0_56 (+ v_~c~0_44 v_~counter~0_55))) InVars {~c~0=v_~c~0_44, ~counter~0=v_~counter~0_56} OutVars{~counter~0=v_~counter~0_55, ~c~0=v_~c~0_44, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][142], [60#true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 24#L44true, Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 69#true, Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 328#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 45#L76true, 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 334#true, Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 108#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 12#thread2EXITtrue, 13#L94-4true, Black: 57#(= ~counter~0 0), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 121#(= thread1Thread1of1ForFork0_~i~0 0)]) [2023-11-29 00:30:21,149 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-29 00:30:21,149 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:30:21,149 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:30:21,150 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:30:21,589 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_56 4294967296)) 1 0) 0)) (= v_~counter~0_56 (+ v_~c~0_44 v_~counter~0_55))) InVars {~c~0=v_~c~0_44, ~counter~0=v_~counter~0_56} OutVars{~counter~0=v_~counter~0_55, ~c~0=v_~c~0_44, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][142], [60#true, 42#L95-1true, 24#L44true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 69#true, Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 328#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 45#L76true, 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 9#L52true, 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 334#true, Black: 108#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 57#(= ~counter~0 0), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 121#(= thread1Thread1of1ForFork0_~i~0 0)]) [2023-11-29 00:30:21,589 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 00:30:21,589 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:30:21,590 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:30:21,590 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:30:21,590 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L52-->L55: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_50 4294967296)) 1 0) 0)) (= (+ v_~c~0_42 v_~counter~0_49) v_~counter~0_50)) InVars {~c~0=v_~c~0_42, ~counter~0=v_~counter~0_50} OutVars{~counter~0=v_~counter~0_49, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~c~0=v_~c~0_42} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][136], [60#true, 42#L95-1true, 24#L44true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 69#true, Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 328#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 16#L55true, 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 43#L73true, 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 334#true, Black: 108#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 57#(= ~counter~0 0), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 121#(= thread1Thread1of1ForFork0_~i~0 0)]) [2023-11-29 00:30:21,590 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 00:30:21,590 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:30:21,590 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:30:21,590 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:30:21,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_56 4294967296)) 1 0) 0)) (= v_~counter~0_56 (+ v_~c~0_44 v_~counter~0_55))) InVars {~c~0=v_~c~0_44, ~counter~0=v_~counter~0_56} OutVars{~counter~0=v_~counter~0_55, ~c~0=v_~c~0_44, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][142], [60#true, 42#L95-1true, 24#L44true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 69#true, Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 328#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 45#L76true, 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 334#true, Black: 108#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 12#thread2EXITtrue, Black: 57#(= ~counter~0 0), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 121#(= thread1Thread1of1ForFork0_~i~0 0)]) [2023-11-29 00:30:21,591 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 00:30:21,591 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:30:21,591 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:30:21,591 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:30:21,887 INFO L124 PetriNetUnfolderBase]: 73834/99418 cut-off events. [2023-11-29 00:30:21,887 INFO L125 PetriNetUnfolderBase]: For 630000/630202 co-relation queries the response was YES. [2023-11-29 00:30:22,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490691 conditions, 99418 events. 73834/99418 cut-off events. For 630000/630202 co-relation queries the response was YES. Maximal size of possible extension queue 4003. Compared 637658 event pairs, 17608 based on Foata normal form. 664/96986 useless extension candidates. Maximal degree in co-relation 360759. Up to 40770 conditions per place. [2023-11-29 00:30:22,684 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 213 selfloop transitions, 45 changer transitions 6/269 dead transitions. [2023-11-29 00:30:22,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 269 transitions, 3434 flow [2023-11-29 00:30:22,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:30:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:30:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2023-11-29 00:30:22,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5906976744186047 [2023-11-29 00:30:22,686 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 127 transitions. [2023-11-29 00:30:22,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 127 transitions. [2023-11-29 00:30:22,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:30:22,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 127 transitions. [2023-11-29 00:30:22,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:22,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:22,687 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:22,687 INFO L175 Difference]: Start difference. First operand has 85 places, 119 transitions, 1280 flow. Second operand 5 states and 127 transitions. [2023-11-29 00:30:22,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 269 transitions, 3434 flow [2023-11-29 00:30:24,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 269 transitions, 3402 flow, removed 16 selfloop flow, removed 0 redundant places. [2023-11-29 00:30:24,125 INFO L231 Difference]: Finished difference. Result has 92 places, 151 transitions, 1864 flow [2023-11-29 00:30:24,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1864, PETRI_PLACES=92, PETRI_TRANSITIONS=151} [2023-11-29 00:30:24,125 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 45 predicate places. [2023-11-29 00:30:24,125 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 151 transitions, 1864 flow [2023-11-29 00:30:24,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:24,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:30:24,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:24,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:30:24,126 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:30:24,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:24,126 INFO L85 PathProgramCache]: Analyzing trace with hash -973160355, now seen corresponding path program 4 times [2023-11-29 00:30:24,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:24,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478643774] [2023-11-29 00:30:24,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:24,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:30:24,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:24,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478643774] [2023-11-29 00:30:24,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478643774] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:30:24,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056067667] [2023-11-29 00:30:24,265 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:30:24,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:30:24,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:30:24,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:30:24,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:30:24,385 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:30:24,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:30:24,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:30:24,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:30:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:30:24,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:30:24,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:30:24,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056067667] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:30:24,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:30:24,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 10 [2023-11-29 00:30:24,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027804845] [2023-11-29 00:30:24,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:30:24,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:30:24,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:24,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:30:24,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:30:24,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2023-11-29 00:30:24,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 151 transitions, 1864 flow. Second operand has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:24,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:30:24,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2023-11-29 00:30:24,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:30:40,947 INFO L124 PetriNetUnfolderBase]: 112031/150157 cut-off events. [2023-11-29 00:30:40,947 INFO L125 PetriNetUnfolderBase]: For 1164822/1165258 co-relation queries the response was YES. [2023-11-29 00:30:41,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783275 conditions, 150157 events. 112031/150157 cut-off events. For 1164822/1165258 co-relation queries the response was YES. Maximal size of possible extension queue 5942. Compared 999699 event pairs, 10151 based on Foata normal form. 6628/151977 useless extension candidates. Maximal degree in co-relation 530899. Up to 35322 conditions per place. [2023-11-29 00:30:42,419 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 452 selfloop transitions, 235 changer transitions 28/720 dead transitions. [2023-11-29 00:30:42,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 720 transitions, 9764 flow [2023-11-29 00:30:42,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 00:30:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-29 00:30:42,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 493 transitions. [2023-11-29 00:30:42,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5459579180509413 [2023-11-29 00:30:42,423 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 493 transitions. [2023-11-29 00:30:42,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 493 transitions. [2023-11-29 00:30:42,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:30:42,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 493 transitions. [2023-11-29 00:30:42,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 23.476190476190474) internal successors, (493), 21 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:42,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 43.0) internal successors, (946), 22 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:42,429 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 43.0) internal successors, (946), 22 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:42,429 INFO L175 Difference]: Start difference. First operand has 92 places, 151 transitions, 1864 flow. Second operand 21 states and 493 transitions. [2023-11-29 00:30:42,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 720 transitions, 9764 flow [2023-11-29 00:30:54,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 720 transitions, 9613 flow, removed 17 selfloop flow, removed 1 redundant places. [2023-11-29 00:30:54,384 INFO L231 Difference]: Finished difference. Result has 124 places, 330 transitions, 4976 flow [2023-11-29 00:30:54,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1787, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4976, PETRI_PLACES=124, PETRI_TRANSITIONS=330} [2023-11-29 00:30:54,385 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 77 predicate places. [2023-11-29 00:30:54,385 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 330 transitions, 4976 flow [2023-11-29 00:30:54,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:54,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:30:54,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:54,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-29 00:30:54,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 00:30:54,586 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:30:54,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:54,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1399451653, now seen corresponding path program 5 times [2023-11-29 00:30:54,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:54,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345862085] [2023-11-29 00:30:54,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:54,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:30:54,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:54,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345862085] [2023-11-29 00:30:54,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345862085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:54,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:54,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:30:54,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332250618] [2023-11-29 00:30:54,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:54,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:30:54,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:54,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:30:54,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:30:54,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2023-11-29 00:30:54,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 330 transitions, 4976 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:30:54,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:30:54,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2023-11-29 00:30:54,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:31:14,961 INFO L124 PetriNetUnfolderBase]: 114939/154534 cut-off events. [2023-11-29 00:31:14,961 INFO L125 PetriNetUnfolderBase]: For 1679501/1679784 co-relation queries the response was YES. [2023-11-29 00:31:15,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895410 conditions, 154534 events. 114939/154534 cut-off events. For 1679501/1679784 co-relation queries the response was YES. Maximal size of possible extension queue 5936. Compared 1034962 event pairs, 35464 based on Foata normal form. 1426/151564 useless extension candidates. Maximal degree in co-relation 818089. Up to 74184 conditions per place. [2023-11-29 00:31:16,756 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 455 selfloop transitions, 29 changer transitions 42/531 dead transitions. [2023-11-29 00:31:16,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 531 transitions, 8727 flow [2023-11-29 00:31:16,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:31:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:31:16,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2023-11-29 00:31:16,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5953488372093023 [2023-11-29 00:31:16,758 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 128 transitions. [2023-11-29 00:31:16,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 128 transitions. [2023-11-29 00:31:16,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:31:16,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 128 transitions. [2023-11-29 00:31:16,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:31:16,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:31:16,760 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:31:16,760 INFO L175 Difference]: Start difference. First operand has 124 places, 330 transitions, 4976 flow. Second operand 5 states and 128 transitions. [2023-11-29 00:31:16,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 531 transitions, 8727 flow [2023-11-29 00:31:54,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 531 transitions, 8047 flow, removed 137 selfloop flow, removed 4 redundant places. [2023-11-29 00:31:54,907 INFO L231 Difference]: Finished difference. Result has 125 places, 330 transitions, 4691 flow [2023-11-29 00:31:54,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4520, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4691, PETRI_PLACES=125, PETRI_TRANSITIONS=330} [2023-11-29 00:31:54,908 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 78 predicate places. [2023-11-29 00:31:54,908 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 330 transitions, 4691 flow [2023-11-29 00:31:54,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:31:54,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:31:54,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:31:54,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:31:54,909 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:31:54,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:31:54,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2114050225, now seen corresponding path program 6 times [2023-11-29 00:31:54,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:31:54,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488072737] [2023-11-29 00:31:54,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:31:54,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:31:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:31:55,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:31:55,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488072737] [2023-11-29 00:31:55,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488072737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:31:55,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:31:55,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:31:55,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546365190] [2023-11-29 00:31:55,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:31:55,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:31:55,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:31:55,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:31:55,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:31:55,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2023-11-29 00:31:55,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 330 transitions, 4691 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:31:55,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:31:55,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2023-11-29 00:31:55,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:32:22,146 INFO L124 PetriNetUnfolderBase]: 148580/199196 cut-off events. [2023-11-29 00:32:22,146 INFO L125 PetriNetUnfolderBase]: For 2533515/2534157 co-relation queries the response was YES. [2023-11-29 00:32:23,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202189 conditions, 199196 events. 148580/199196 cut-off events. For 2533515/2534157 co-relation queries the response was YES. Maximal size of possible extension queue 6770. Compared 1349037 event pairs, 47783 based on Foata normal form. 2410/195624 useless extension candidates. Maximal degree in co-relation 979183. Up to 102014 conditions per place. [2023-11-29 00:32:24,552 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 491 selfloop transitions, 37 changer transitions 42/575 dead transitions. [2023-11-29 00:32:24,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 575 transitions, 9030 flow [2023-11-29 00:32:24,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:32:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:32:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2023-11-29 00:32:24,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5953488372093023 [2023-11-29 00:32:24,554 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 128 transitions. [2023-11-29 00:32:24,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 128 transitions. [2023-11-29 00:32:24,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:32:24,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 128 transitions. [2023-11-29 00:32:24,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:32:24,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:32:24,555 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:32:24,555 INFO L175 Difference]: Start difference. First operand has 125 places, 330 transitions, 4691 flow. Second operand 5 states and 128 transitions. [2023-11-29 00:32:24,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 575 transitions, 9030 flow [2023-11-29 00:33:18,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 575 transitions, 8838 flow, removed 31 selfloop flow, removed 3 redundant places. [2023-11-29 00:33:18,583 INFO L231 Difference]: Finished difference. Result has 128 places, 332 transitions, 4833 flow [2023-11-29 00:33:18,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4590, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4833, PETRI_PLACES=128, PETRI_TRANSITIONS=332} [2023-11-29 00:33:18,584 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 81 predicate places. [2023-11-29 00:33:18,584 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 332 transitions, 4833 flow [2023-11-29 00:33:18,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:33:18,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:33:18,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:33:18,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 00:33:18,584 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:33:18,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:33:18,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1068901267, now seen corresponding path program 7 times [2023-11-29 00:33:18,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:33:18,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730541608] [2023-11-29 00:33:18,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:33:18,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:33:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:33:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:33:18,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:33:18,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730541608] [2023-11-29 00:33:18,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730541608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:33:18,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:33:18,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:33:18,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170791854] [2023-11-29 00:33:18,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:33:18,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:33:18,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:33:18,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:33:18,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:33:18,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2023-11-29 00:33:18,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 332 transitions, 4833 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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) [2023-11-29 00:33:18,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:33:18,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2023-11-29 00:33:18,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:33:44,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_56 4294967296)) 1 0) 0)) (= v_~counter~0_56 (+ v_~c~0_44 v_~counter~0_55))) InVars {~c~0=v_~c~0_44, ~counter~0=v_~counter~0_56} OutVars{~counter~0=v_~counter~0_55, ~c~0=v_~c~0_44, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][231], [Black: 545#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 60#true, Black: 552#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296)) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 547#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 24#L44true, Black: 379#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 583#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 69#true, 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 592#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 337#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 591#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 336#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 338#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 45#L76true, 597#true, 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 8#L51-5true, Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 556#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 511#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork0_~i~0 4294967296) 1)), Black: 565#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 540#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 590#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 13#L94-4true, Black: 383#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 57#(= ~counter~0 0), Black: 348#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 559#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 554#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 561#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2023-11-29 00:33:44,769 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-29 00:33:44,769 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:33:44,769 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:33:44,769 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:33:47,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_56 4294967296)) 1 0) 0)) (= v_~counter~0_56 (+ v_~c~0_44 v_~counter~0_55))) InVars {~c~0=v_~c~0_44, ~counter~0=v_~counter~0_56} OutVars{~counter~0=v_~counter~0_55, ~c~0=v_~c~0_44, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][231], [Black: 545#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 60#true, Black: 552#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296)) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 547#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), 42#L95-1true, 24#L44true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 379#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 69#true, Black: 583#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 592#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 591#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 337#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 336#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 338#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 45#L76true, 597#true, 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 8#L51-5true, Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 38#L65true, 556#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 511#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork0_~i~0 4294967296) 1)), Black: 565#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), 590#(= |thread4Thread1of1ForFork1_~i~3#1| 0), Black: 540#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 383#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 348#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 57#(= ~counter~0 0), Black: 559#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 554#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 561#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2023-11-29 00:33:47,764 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-29 00:33:47,764 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:33:47,764 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:33:47,764 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:33:47,771 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_56 4294967296)) 1 0) 0)) (= v_~counter~0_56 (+ v_~c~0_44 v_~counter~0_55))) InVars {~c~0=v_~c~0_44, ~counter~0=v_~counter~0_56} OutVars{~counter~0=v_~counter~0_55, ~c~0=v_~c~0_44, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][231], [Black: 545#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 60#true, Black: 552#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296)) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 547#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 24#L44true, Black: 379#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 69#true, Black: 583#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 592#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 337#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 591#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 336#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 338#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 45#L76true, 597#true, 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 9#L52true, Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 556#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 511#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork0_~i~0 4294967296) 1)), Black: 565#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 540#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 590#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 13#L94-4true, Black: 383#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 57#(= ~counter~0 0), Black: 348#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 559#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 554#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 561#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2023-11-29 00:33:47,771 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-29 00:33:47,771 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:33:47,771 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:33:47,771 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:33:47,771 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L52-->L55: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_50 4294967296)) 1 0) 0)) (= (+ v_~c~0_42 v_~counter~0_49) v_~counter~0_50)) InVars {~c~0=v_~c~0_42, ~counter~0=v_~counter~0_50} OutVars{~counter~0=v_~counter~0_49, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~c~0=v_~c~0_42} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][220], [Black: 545#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 60#true, Black: 552#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296)) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 547#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 24#L44true, Black: 379#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 69#true, Black: 583#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 592#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 337#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 591#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 336#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 338#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 597#true, 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 77#true, 16#L55true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 43#L73true, 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 556#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 511#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork0_~i~0 4294967296) 1)), Black: 565#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 540#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 590#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 13#L94-4true, Black: 383#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 57#(= ~counter~0 0), Black: 348#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 559#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 554#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 561#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2023-11-29 00:33:47,771 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-29 00:33:47,771 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:33:47,771 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:33:47,772 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:33:47,772 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_56 4294967296)) 1 0) 0)) (= v_~counter~0_56 (+ v_~c~0_44 v_~counter~0_55))) InVars {~c~0=v_~c~0_44, ~counter~0=v_~counter~0_56} OutVars{~counter~0=v_~counter~0_55, ~c~0=v_~c~0_44, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][231], [Black: 545#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 60#true, Black: 552#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296)) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 547#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 24#L44true, Black: 379#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 583#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 69#true, 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 592#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 337#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 591#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 336#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 338#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 45#L76true, 597#true, 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 556#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 511#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork0_~i~0 4294967296) 1)), Black: 565#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), 12#thread2EXITtrue, Black: 540#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 590#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 13#L94-4true, Black: 383#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 57#(= ~counter~0 0), Black: 348#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 559#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 554#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 561#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2023-11-29 00:33:47,772 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-29 00:33:47,772 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:33:47,772 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:33:47,772 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:33:49,953 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_56 4294967296)) 1 0) 0)) (= v_~counter~0_56 (+ v_~c~0_44 v_~counter~0_55))) InVars {~c~0=v_~c~0_44, ~counter~0=v_~counter~0_56} OutVars{~counter~0=v_~counter~0_55, ~c~0=v_~c~0_44, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][231], [Black: 545#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 60#true, Black: 552#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296)) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 547#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), 42#L95-1true, 24#L44true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 379#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 69#true, Black: 583#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 592#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 591#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 337#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 336#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 338#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 45#L76true, 597#true, 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 9#L52true, Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 38#L65true, 556#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 511#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork0_~i~0 4294967296) 1)), Black: 565#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), 590#(= |thread4Thread1of1ForFork1_~i~3#1| 0), Black: 540#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 383#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 348#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 57#(= ~counter~0 0), Black: 559#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 554#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 561#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2023-11-29 00:33:49,953 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 00:33:49,953 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:33:49,953 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:33:49,953 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:33:49,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L52-->L55: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_50 4294967296)) 1 0) 0)) (= (+ v_~c~0_42 v_~counter~0_49) v_~counter~0_50)) InVars {~c~0=v_~c~0_42, ~counter~0=v_~counter~0_50} OutVars{~counter~0=v_~counter~0_49, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~c~0=v_~c~0_42} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][220], [Black: 545#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 60#true, Black: 552#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296)) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 547#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), 42#L95-1true, 24#L44true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 379#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 69#true, Black: 583#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 592#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 591#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 337#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 336#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 338#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 597#true, 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 77#true, 16#L55true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 43#L73true, 38#L65true, 556#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 511#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork0_~i~0 4294967296) 1)), Black: 565#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), 590#(= |thread4Thread1of1ForFork1_~i~3#1| 0), Black: 540#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 383#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 348#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 57#(= ~counter~0 0), Black: 559#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 554#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 561#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2023-11-29 00:33:49,954 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 00:33:49,954 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:33:49,954 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:33:49,954 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:33:49,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_56 4294967296)) 1 0) 0)) (= v_~counter~0_56 (+ v_~c~0_44 v_~counter~0_55))) InVars {~c~0=v_~c~0_44, ~counter~0=v_~counter~0_56} OutVars{~counter~0=v_~counter~0_55, ~c~0=v_~c~0_44, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][231], [Black: 545#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 60#true, Black: 552#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296)) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 547#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), 42#L95-1true, 24#L44true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 379#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 69#true, Black: 583#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 592#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 591#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 337#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 336#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 338#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 45#L76true, 597#true, 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 38#L65true, 556#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 511#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork0_~i~0 4294967296) 1)), Black: 565#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), 12#thread2EXITtrue, 590#(= |thread4Thread1of1ForFork1_~i~3#1| 0), Black: 540#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 383#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), Black: 348#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 57#(= ~counter~0 0), Black: 559#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 554#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 561#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))]) [2023-11-29 00:33:49,955 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 00:33:49,955 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:33:49,955 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:33:49,955 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:33:51,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_56 4294967296)) 1 0) 0)) (= v_~counter~0_56 (+ v_~c~0_44 v_~counter~0_55))) InVars {~c~0=v_~c~0_44, ~counter~0=v_~counter~0_56} OutVars{~counter~0=v_~counter~0_55, ~c~0=v_~c~0_44, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][231], [Black: 545#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 60#true, Black: 552#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296)) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 547#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), 24#L44true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 379#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 583#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 69#true, Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 592#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 337#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 591#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 336#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 338#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 45#L76true, 597#true, Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 8#L51-5true, 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 325#true, 383#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 511#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork0_~i~0 4294967296) 1)), Black: 565#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 540#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 590#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 13#L94-4true, Black: 348#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 57#(= ~counter~0 0), Black: 559#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 554#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 561#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 556#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0))]) [2023-11-29 00:33:51,511 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-29 00:33:51,511 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:33:51,511 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:33:51,511 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:33:52,693 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_56 4294967296)) 1 0) 0)) (= v_~counter~0_56 (+ v_~c~0_44 v_~counter~0_55))) InVars {~c~0=v_~c~0_44, ~counter~0=v_~counter~0_56} OutVars{~counter~0=v_~counter~0_55, ~c~0=v_~c~0_44, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][231], [Black: 545#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 60#true, Black: 552#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296)) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 547#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), 24#L44true, 42#L95-1true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 379#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 69#true, Black: 583#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 592#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 591#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 337#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 336#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 338#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 597#true, 45#L76true, Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 8#L51-5true, 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 325#true, 383#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 511#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork0_~i~0 4294967296) 1)), Black: 565#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 540#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 590#(= |thread4Thread1of1ForFork1_~i~3#1| 0), Black: 57#(= ~counter~0 0), Black: 348#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 559#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 554#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 561#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 556#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0))]) [2023-11-29 00:33:52,694 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-29 00:33:52,694 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:33:52,694 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:33:52,694 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:33:52,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_56 4294967296)) 1 0) 0)) (= v_~counter~0_56 (+ v_~c~0_44 v_~counter~0_55))) InVars {~c~0=v_~c~0_44, ~counter~0=v_~counter~0_56} OutVars{~counter~0=v_~counter~0_55, ~c~0=v_~c~0_44, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][231], [Black: 545#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 60#true, Black: 552#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296)) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 547#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), 24#L44true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 379#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 69#true, Black: 583#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 592#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 591#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 337#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 336#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 338#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 597#true, 45#L76true, Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 9#L52true, 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 325#true, 383#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 511#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork0_~i~0 4294967296) 1)), Black: 565#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 540#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 590#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 13#L94-4true, Black: 348#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 57#(= ~counter~0 0), Black: 559#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 554#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 561#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 556#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0))]) [2023-11-29 00:33:52,698 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-29 00:33:52,698 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:33:52,698 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:33:52,698 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:33:52,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L52-->L55: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_50 4294967296)) 1 0) 0)) (= (+ v_~c~0_42 v_~counter~0_49) v_~counter~0_50)) InVars {~c~0=v_~c~0_42, ~counter~0=v_~counter~0_50} OutVars{~counter~0=v_~counter~0_49, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~c~0=v_~c~0_42} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][220], [Black: 545#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 60#true, Black: 552#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296)) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 547#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), 24#L44true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 379#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 69#true, Black: 583#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 592#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 591#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 337#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 336#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 338#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 597#true, Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 77#true, 16#L55true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 325#true, 43#L73true, 383#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 511#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork0_~i~0 4294967296) 1)), Black: 565#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 540#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 590#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 13#L94-4true, Black: 348#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 57#(= ~counter~0 0), Black: 559#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 554#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 561#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 556#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0))]) [2023-11-29 00:33:52,698 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-29 00:33:52,699 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:33:52,699 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:33:52,699 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:33:52,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_56 4294967296)) 1 0) 0)) (= v_~counter~0_56 (+ v_~c~0_44 v_~counter~0_55))) InVars {~c~0=v_~c~0_44, ~counter~0=v_~counter~0_56} OutVars{~counter~0=v_~counter~0_55, ~c~0=v_~c~0_44, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][231], [Black: 545#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 60#true, Black: 552#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296)) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 547#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), 24#L44true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 379#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 583#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 69#true, Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 592#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 337#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 591#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 336#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 338#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 597#true, 45#L76true, Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 325#true, 383#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 511#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork0_~i~0 4294967296) 1)), Black: 565#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), 12#thread2EXITtrue, Black: 540#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 590#(= |thread4Thread1of1ForFork1_~i~3#1| 0), 13#L94-4true, Black: 57#(= ~counter~0 0), Black: 348#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 559#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 554#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 561#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 556#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0))]) [2023-11-29 00:33:52,699 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-29 00:33:52,699 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:33:52,699 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:33:52,699 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:33:53,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_56 4294967296)) 1 0) 0)) (= v_~counter~0_56 (+ v_~c~0_44 v_~counter~0_55))) InVars {~c~0=v_~c~0_44, ~counter~0=v_~counter~0_56} OutVars{~counter~0=v_~counter~0_55, ~c~0=v_~c~0_44, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][231], [Black: 545#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 60#true, Black: 552#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296)) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 547#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), 24#L44true, 42#L95-1true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 379#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 583#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 69#true, Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 592#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 591#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 337#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 336#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 338#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 45#L76true, 597#true, Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 9#L52true, 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 325#true, 383#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 511#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork0_~i~0 4294967296) 1)), Black: 565#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 540#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 590#(= |thread4Thread1of1ForFork1_~i~3#1| 0), Black: 57#(= ~counter~0 0), Black: 348#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 559#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 554#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 561#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 556#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0))]) [2023-11-29 00:33:53,275 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-29 00:33:53,275 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:33:53,275 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:33:53,275 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:33:53,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L52-->L55: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_50 4294967296)) 1 0) 0)) (= (+ v_~c~0_42 v_~counter~0_49) v_~counter~0_50)) InVars {~c~0=v_~c~0_42, ~counter~0=v_~counter~0_50} OutVars{~counter~0=v_~counter~0_49, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~c~0=v_~c~0_42} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][220], [Black: 545#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 60#true, Black: 552#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296)) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 547#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), 24#L44true, 42#L95-1true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 379#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 583#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 69#true, Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 592#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 591#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 337#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 336#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 338#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 597#true, Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 16#L55true, 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 325#true, 383#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), 43#L73true, 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 511#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork0_~i~0 4294967296) 1)), Black: 565#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 540#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 590#(= |thread4Thread1of1ForFork1_~i~3#1| 0), Black: 348#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 57#(= ~counter~0 0), Black: 559#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 554#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 561#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 556#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0))]) [2023-11-29 00:33:53,275 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-29 00:33:53,275 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:33:53,275 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:33:53,275 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:33:53,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_56 4294967296)) 1 0) 0)) (= v_~counter~0_56 (+ v_~c~0_44 v_~counter~0_55))) InVars {~c~0=v_~c~0_44, ~counter~0=v_~counter~0_56} OutVars{~counter~0=v_~counter~0_55, ~c~0=v_~c~0_44, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][231], [Black: 545#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 60#true, Black: 552#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296)) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 547#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), 24#L44true, 42#L95-1true, Black: 63#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 379#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 132#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 62#(= thread1Thread1of1ForFork0_~i~0 0), Black: 69#true, Black: 583#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 72#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 109#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 329#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 327#(= thread3Thread1of1ForFork3_~i~2 0), Black: 592#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 79#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 591#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), Black: 337#(and (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 336#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 338#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), 597#true, 45#L76true, Black: 95#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 94#(<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))), 77#true, Black: 101#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 325#true, 383#(and (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0)), 38#L65true, Black: 112#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 110#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 511#(< (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (+ (mod thread1Thread1of1ForFork0_~i~0 4294967296) 1)), 12#thread2EXITtrue, Black: 565#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 540#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 590#(= |thread4Thread1of1ForFork1_~i~3#1| 0), Black: 348#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 57#(= ~counter~0 0), Black: 559#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) (mod thread1Thread1of1ForFork0_~i~0 4294967296))), Black: 122#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 554#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 561#(and (= thread3Thread1of1ForFork3_~i~2 0) (= thread1Thread1of1ForFork0_~i~0 0) (<= (+ (mod |thread4Thread1of1ForFork1_~i~3#1| 4294967296) 1) (mod ~N~0 4294967296))), Black: 123#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 556#(and (= thread3Thread1of1ForFork3_~i~2 0) (<= 1 (mod ~N~0 4294967296)) (= |thread4Thread1of1ForFork1_~i~3#1| 0))]) [2023-11-29 00:33:53,276 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-29 00:33:53,276 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:33:53,276 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:33:53,276 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:33:54,141 INFO L124 PetriNetUnfolderBase]: 190822/255253 cut-off events. [2023-11-29 00:33:54,141 INFO L125 PetriNetUnfolderBase]: For 3232378/3233326 co-relation queries the response was YES. [2023-11-29 00:33:55,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572034 conditions, 255253 events. 190822/255253 cut-off events. For 3232378/3233326 co-relation queries the response was YES. Maximal size of possible extension queue 8729. Compared 1768403 event pairs, 50664 based on Foata normal form. 2072/248843 useless extension candidates. Maximal degree in co-relation 1316448. Up to 107719 conditions per place. [2023-11-29 00:33:57,198 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 536 selfloop transitions, 161 changer transitions 7/709 dead transitions. [2023-11-29 00:33:57,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 709 transitions, 11599 flow [2023-11-29 00:33:57,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:33:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:33:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2023-11-29 00:33:57,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2023-11-29 00:33:57,200 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 162 transitions. [2023-11-29 00:33:57,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 162 transitions. [2023-11-29 00:33:57,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:33:57,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 162 transitions. [2023-11-29 00:33:57,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:33:57,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:33:57,202 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:33:57,202 INFO L175 Difference]: Start difference. First operand has 128 places, 332 transitions, 4833 flow. Second operand 6 states and 162 transitions. [2023-11-29 00:33:57,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 709 transitions, 11599 flow [2023-11-29 00:36:13,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 709 transitions, 11394 flow, removed 58 selfloop flow, removed 1 redundant places. [2023-11-29 00:36:13,713 INFO L231 Difference]: Finished difference. Result has 136 places, 454 transitions, 7387 flow [2023-11-29 00:36:13,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4733, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7387, PETRI_PLACES=136, PETRI_TRANSITIONS=454} [2023-11-29 00:36:13,713 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 89 predicate places. [2023-11-29 00:36:13,714 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 454 transitions, 7387 flow [2023-11-29 00:36:13,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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) [2023-11-29 00:36:13,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:36:13,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:13,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 00:36:13,714 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:36:13,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:13,714 INFO L85 PathProgramCache]: Analyzing trace with hash -464423891, now seen corresponding path program 8 times [2023-11-29 00:36:13,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:13,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962288376] [2023-11-29 00:36:13,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:13,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:13,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:13,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:13,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962288376] [2023-11-29 00:36:13,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962288376] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:13,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000722401] [2023-11-29 00:36:13,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:36:13,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:13,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:13,817 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:13,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f98c9fd-56dc-496f-98bf-e899ff47fb4e/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:36:13,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:36:13,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:36:13,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:36:13,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:13,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:13,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:36:14,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:14,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000722401] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:36:14,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:36:14,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2023-11-29 00:36:14,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230090590] [2023-11-29 00:36:14,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:36:14,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:36:14,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:14,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:36:14,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:36:14,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2023-11-29 00:36:14,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 454 transitions, 7387 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:14,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:36:14,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2023-11-29 00:36:14,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand