./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/40_barrier_vf.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_7894f695-0c76-46e6-aeb1-8b2656a57411/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7894f695-0c76-46e6-aeb1-8b2656a57411/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7894f695-0c76-46e6-aeb1-8b2656a57411/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7894f695-0c76-46e6-aeb1-8b2656a57411/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/40_barrier_vf.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7894f695-0c76-46e6-aeb1-8b2656a57411/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7894f695-0c76-46e6-aeb1-8b2656a57411/bin/uautomizer-verify-uCwYo4JHxu --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 5eef73b6b2655059556d731e3a5babc181132142f2417a2cf863165dd8efda84 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:59:33,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:59:33,509 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7894f695-0c76-46e6-aeb1-8b2656a57411/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:59:33,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:59:33,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:59:33,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:59:33,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:59:33,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:59:33,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:59:33,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:59:33,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:59:33,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:59:33,571 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:59:33,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:59:33,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:59:33,574 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:59:33,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:59:33,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:59:33,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:59:33,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:59:33,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:59:33,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:59:33,578 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:59:33,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:59:33,578 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:59:33,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:59:33,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:59:33,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:59:33,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:59:33,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:59:33,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:59:33,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:59:33,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:59:33,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:59:33,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:59:33,584 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:59:33,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:59:33,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:59:33,585 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:59:33,585 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_7894f695-0c76-46e6-aeb1-8b2656a57411/bin/uautomizer-verify-uCwYo4JHxu/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_7894f695-0c76-46e6-aeb1-8b2656a57411/bin/uautomizer-verify-uCwYo4JHxu 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 -> 5eef73b6b2655059556d731e3a5babc181132142f2417a2cf863165dd8efda84 [2023-11-19 07:59:33,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:59:33,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:59:33,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:59:33,956 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:59:33,956 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:59:33,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7894f695-0c76-46e6-aeb1-8b2656a57411/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2023-11-19 07:59:37,096 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:59:37,393 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:59:37,394 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7894f695-0c76-46e6-aeb1-8b2656a57411/sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2023-11-19 07:59:37,410 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7894f695-0c76-46e6-aeb1-8b2656a57411/bin/uautomizer-verify-uCwYo4JHxu/data/2223ee263/74b8f2e7954e4de2a8d355da604fb813/FLAG0697181f3 [2023-11-19 07:59:37,425 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7894f695-0c76-46e6-aeb1-8b2656a57411/bin/uautomizer-verify-uCwYo4JHxu/data/2223ee263/74b8f2e7954e4de2a8d355da604fb813 [2023-11-19 07:59:37,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:59:37,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:59:37,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:59:37,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:59:37,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:59:37,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:59:37" (1/1) ... [2023-11-19 07:59:37,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@654969a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:37, skipping insertion in model container [2023-11-19 07:59:37,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:59:37" (1/1) ... [2023-11-19 07:59:37,484 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:59:37,708 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 07:59:37,875 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_7894f695-0c76-46e6-aeb1-8b2656a57411/sv-benchmarks/c/pthread-ext/40_barrier_vf.i[31163,31176] [2023-11-19 07:59:37,890 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:59:37,904 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:59:37,940 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 07:59:37,974 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_7894f695-0c76-46e6-aeb1-8b2656a57411/sv-benchmarks/c/pthread-ext/40_barrier_vf.i[31163,31176] [2023-11-19 07:59:37,977 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:59:38,015 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:59:38,015 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:59:38,015 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:59:38,023 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:59:38,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:38 WrapperNode [2023-11-19 07:59:38,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:59:38,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:59:38,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:59:38,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:59:38,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:38" (1/1) ... [2023-11-19 07:59:38,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:38" (1/1) ... [2023-11-19 07:59:38,074 INFO L138 Inliner]: procedures = 174, calls = 25, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 77 [2023-11-19 07:59:38,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:59:38,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:59:38,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:59:38,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:59:38,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:38" (1/1) ... [2023-11-19 07:59:38,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:38" (1/1) ... [2023-11-19 07:59:38,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:38" (1/1) ... [2023-11-19 07:59:38,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:38" (1/1) ... [2023-11-19 07:59:38,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:38" (1/1) ... [2023-11-19 07:59:38,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:38" (1/1) ... [2023-11-19 07:59:38,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:38" (1/1) ... [2023-11-19 07:59:38,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:38" (1/1) ... [2023-11-19 07:59:38,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:59:38,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:59:38,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:59:38,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:59:38,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:38" (1/1) ... [2023-11-19 07:59:38,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:59:38,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7894f695-0c76-46e6-aeb1-8b2656a57411/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:59:38,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7894f695-0c76-46e6-aeb1-8b2656a57411/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:59:38,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7894f695-0c76-46e6-aeb1-8b2656a57411/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:59:38,223 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-19 07:59:38,223 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-19 07:59:38,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:59:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:59:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:59:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:59:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:59:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:59:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:59:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:59:38,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:59:38,229 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:59:38,420 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:59:38,426 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:59:38,634 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:59:38,711 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:59:38,711 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 07:59:38,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:59:38 BoogieIcfgContainer [2023-11-19 07:59:38,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:59:38,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:59:38,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:59:38,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:59:38,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:59:37" (1/3) ... [2023-11-19 07:59:38,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613743b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:59:38, skipping insertion in model container [2023-11-19 07:59:38,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:38" (2/3) ... [2023-11-19 07:59:38,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613743b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:59:38, skipping insertion in model container [2023-11-19 07:59:38,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:59:38" (3/3) ... [2023-11-19 07:59:38,725 INFO L112 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2023-11-19 07:59:38,734 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:59:38,745 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:59:38,745 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:59:38,745 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:59:38,797 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:59:38,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 49 transitions, 102 flow [2023-11-19 07:59:38,897 INFO L124 PetriNetUnfolderBase]: 4/60 cut-off events. [2023-11-19 07:59:38,898 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:59:38,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 60 events. 4/60 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 35. Up to 4 conditions per place. [2023-11-19 07:59:38,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 49 transitions, 102 flow [2023-11-19 07:59:38,913 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 49 transitions, 102 flow [2023-11-19 07:59:38,918 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:59:38,931 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 49 transitions, 102 flow [2023-11-19 07:59:38,934 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 49 transitions, 102 flow [2023-11-19 07:59:38,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 49 transitions, 102 flow [2023-11-19 07:59:38,952 INFO L124 PetriNetUnfolderBase]: 4/60 cut-off events. [2023-11-19 07:59:38,953 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:59:38,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 60 events. 4/60 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 35. Up to 4 conditions per place. [2023-11-19 07:59:38,955 INFO L119 LiptonReduction]: Number of co-enabled transitions 616 [2023-11-19 07:59:41,264 INFO L134 LiptonReduction]: Checked pairs total: 554 [2023-11-19 07:59:41,264 INFO L136 LiptonReduction]: Total number of compositions: 50 [2023-11-19 07:59:41,292 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:59:41,300 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;@39627d6b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:59:41,301 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-19 07:59:41,312 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:59:41,312 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-11-19 07:59:41,313 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:59:41,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:41,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-19 07:59:41,315 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:41,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:41,320 INFO L85 PathProgramCache]: Analyzing trace with hash 9999566, now seen corresponding path program 1 times [2023-11-19 07:59:41,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:41,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131458021] [2023-11-19 07:59:41,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:41,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:41,787 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-19 07:59:41,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:41,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131458021] [2023-11-19 07:59:41,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131458021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:41,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:41,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:59:41,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910786684] [2023-11-19 07:59:41,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:41,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:59:41,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:41,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:59:41,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:59:41,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 99 [2023-11-19 07:59:41,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 11 places, 8 transitions, 20 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 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-19 07:59:41,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:41,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 99 [2023-11-19 07:59:41,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:41,871 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-11-19 07:59:41,871 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:59:41,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16 conditions, 6 events. 0/6 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 3/9 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2023-11-19 07:59:41,873 INFO L140 encePairwiseOnDemand]: 95/99 looper letters, 3 selfloop transitions, 1 changer transitions 0/5 dead transitions. [2023-11-19 07:59:41,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 10 places, 5 transitions, 22 flow [2023-11-19 07:59:41,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:59:41,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:59:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-11-19 07:59:41,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3771043771043771 [2023-11-19 07:59:41,888 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-11-19 07:59:41,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-11-19 07:59:41,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:41,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-11-19 07:59:41,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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-19 07:59:41,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 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-19 07:59:41,901 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 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-19 07:59:41,903 INFO L175 Difference]: Start difference. First operand has 11 places, 8 transitions, 20 flow. Second operand 3 states and 112 transitions. [2023-11-19 07:59:41,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 10 places, 5 transitions, 22 flow [2023-11-19 07:59:41,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 10 places, 5 transitions, 22 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:59:41,908 INFO L231 Difference]: Finished difference. Result has 10 places, 5 transitions, 16 flow [2023-11-19 07:59:41,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=14, PETRI_DIFFERENCE_MINUEND_PLACES=8, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=16, PETRI_PLACES=10, PETRI_TRANSITIONS=5} [2023-11-19 07:59:41,914 INFO L281 CegarLoopForPetriNet]: 11 programPoint places, -1 predicate places. [2023-11-19 07:59:41,914 INFO L495 AbstractCegarLoop]: Abstraction has has 10 places, 5 transitions, 16 flow [2023-11-19 07:59:41,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 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-19 07:59:41,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:41,915 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-19 07:59:41,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:59:41,916 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:41,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:41,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1019618203, now seen corresponding path program 1 times [2023-11-19 07:59:41,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:41,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323053524] [2023-11-19 07:59:41,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:41,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:41,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:59:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:41,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:59:41,962 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:59:41,964 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-19 07:59:41,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-11-19 07:59:41,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-11-19 07:59:41,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:59:41,967 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-19 07:59:41,972 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 07:59:41,972 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-19 07:59:41,996 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:59:41,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 72 transitions, 154 flow [2023-11-19 07:59:42,019 INFO L124 PetriNetUnfolderBase]: 7/96 cut-off events. [2023-11-19 07:59:42,020 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:59:42,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 96 events. 7/96 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 188 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 61. Up to 6 conditions per place. [2023-11-19 07:59:42,022 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 72 transitions, 154 flow [2023-11-19 07:59:42,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 72 transitions, 154 flow [2023-11-19 07:59:42,024 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:59:42,024 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 72 transitions, 154 flow [2023-11-19 07:59:42,024 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 72 transitions, 154 flow [2023-11-19 07:59:42,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 72 transitions, 154 flow [2023-11-19 07:59:42,042 INFO L124 PetriNetUnfolderBase]: 7/96 cut-off events. [2023-11-19 07:59:42,043 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:59:42,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 96 events. 7/96 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 188 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 61. Up to 6 conditions per place. [2023-11-19 07:59:42,047 INFO L119 LiptonReduction]: Number of co-enabled transitions 2244 [2023-11-19 07:59:42,904 INFO L134 LiptonReduction]: Checked pairs total: 8365 [2023-11-19 07:59:42,904 INFO L136 LiptonReduction]: Total number of compositions: 47 [2023-11-19 07:59:42,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:59:42,908 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;@39627d6b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:59:42,909 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-19 07:59:42,914 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:59:42,915 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2023-11-19 07:59:42,915 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:59:42,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:42,915 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-19 07:59:42,916 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-19 07:59:42,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:42,917 INFO L85 PathProgramCache]: Analyzing trace with hash -108707802, now seen corresponding path program 1 times [2023-11-19 07:59:42,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:42,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586664554] [2023-11-19 07:59:42,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:42,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:42,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:59:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:42,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:59:42,949 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:59:42,949 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-11-19 07:59:42,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-11-19 07:59:42,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-11-19 07:59:42,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-11-19 07:59:42,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:59:42,951 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-11-19 07:59:42,952 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 07:59:42,952 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-19 07:59:42,973 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:59:42,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 95 transitions, 208 flow [2023-11-19 07:59:43,001 INFO L124 PetriNetUnfolderBase]: 10/132 cut-off events. [2023-11-19 07:59:43,001 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 07:59:43,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 10/132 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 309 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 100. Up to 8 conditions per place. [2023-11-19 07:59:43,004 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 95 transitions, 208 flow [2023-11-19 07:59:43,005 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 95 transitions, 208 flow [2023-11-19 07:59:43,006 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:59:43,006 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 95 transitions, 208 flow [2023-11-19 07:59:43,006 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 95 transitions, 208 flow [2023-11-19 07:59:43,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 95 transitions, 208 flow [2023-11-19 07:59:43,053 INFO L124 PetriNetUnfolderBase]: 10/132 cut-off events. [2023-11-19 07:59:43,053 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 07:59:43,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 10/132 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 309 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 100. Up to 8 conditions per place. [2023-11-19 07:59:43,063 INFO L119 LiptonReduction]: Number of co-enabled transitions 4884 [2023-11-19 07:59:44,021 INFO L134 LiptonReduction]: Checked pairs total: 18564 [2023-11-19 07:59:44,021 INFO L136 LiptonReduction]: Total number of compositions: 59 [2023-11-19 07:59:44,023 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:59:44,024 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;@39627d6b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:59:44,025 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-19 07:59:44,029 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:59:44,029 INFO L124 PetriNetUnfolderBase]: 1/31 cut-off events. [2023-11-19 07:59:44,029 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-19 07:59:44,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:44,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:44,030 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-19 07:59:44,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:44,031 INFO L85 PathProgramCache]: Analyzing trace with hash -656923390, now seen corresponding path program 1 times [2023-11-19 07:59:44,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:44,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824648975] [2023-11-19 07:59:44,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:44,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:44,138 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-19 07:59:44,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:44,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824648975] [2023-11-19 07:59:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824648975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:44,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:44,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:59:44,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545953010] [2023-11-19 07:59:44,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:44,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:59:44,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:44,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:59:44,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:59:44,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 154 [2023-11-19 07:59:44,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 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-19 07:59:44,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:44,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 154 [2023-11-19 07:59:44,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:46,797 INFO L124 PetriNetUnfolderBase]: 12355/19121 cut-off events. [2023-11-19 07:59:46,797 INFO L125 PetriNetUnfolderBase]: For 1336/1336 co-relation queries the response was YES. [2023-11-19 07:59:46,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37797 conditions, 19121 events. 12355/19121 cut-off events. For 1336/1336 co-relation queries the response was YES. Maximal size of possible extension queue 1107. Compared 145237 event pairs, 2185 based on Foata normal form. 280/18732 useless extension candidates. Maximal degree in co-relation 21539. Up to 7379 conditions per place. [2023-11-19 07:59:47,001 INFO L140 encePairwiseOnDemand]: 138/154 looper letters, 130 selfloop transitions, 26 changer transitions 0/168 dead transitions. [2023-11-19 07:59:47,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 168 transitions, 716 flow [2023-11-19 07:59:47,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:59:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:59:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 552 transitions. [2023-11-19 07:59:47,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5120593692022264 [2023-11-19 07:59:47,008 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 552 transitions. [2023-11-19 07:59:47,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 552 transitions. [2023-11-19 07:59:47,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:47,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 552 transitions. [2023-11-19 07:59:47,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 0 states have call successors, (0), 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-19 07:59:47,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 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-19 07:59:47,021 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 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-19 07:59:47,021 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 120 flow. Second operand 7 states and 552 transitions. [2023-11-19 07:59:47,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 168 transitions, 716 flow [2023-11-19 07:59:47,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 168 transitions, 704 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-11-19 07:59:47,029 INFO L231 Difference]: Finished difference. Result has 63 places, 77 transitions, 324 flow [2023-11-19 07:59:47,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=324, PETRI_PLACES=63, PETRI_TRANSITIONS=77} [2023-11-19 07:59:47,031 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2023-11-19 07:59:47,031 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 77 transitions, 324 flow [2023-11-19 07:59:47,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 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-19 07:59:47,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:47,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:47,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:59:47,032 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-19 07:59:47,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:47,033 INFO L85 PathProgramCache]: Analyzing trace with hash 973861029, now seen corresponding path program 1 times [2023-11-19 07:59:47,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:47,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506034372] [2023-11-19 07:59:47,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:47,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:47,112 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-19 07:59:47,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:47,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506034372] [2023-11-19 07:59:47,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506034372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:47,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:47,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:59:47,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278662240] [2023-11-19 07:59:47,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:47,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:59:47,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:47,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:59:47,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:59:47,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 154 [2023-11-19 07:59:47,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 77 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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-19 07:59:47,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:47,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 154 [2023-11-19 07:59:47,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:59:48,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([585] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 85#L724true, 98#true, 11#L725true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:48,789 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 07:59:48,789 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:59:48,790 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:59:48,790 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:59:48,799 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 81#L721true, Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 11#L725true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:48,800 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 07:59:48,800 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:59:48,800 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:59:48,800 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:59:48,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([582] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_79 4294967296))) InVars {~count~0=v_~count~0_79} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_23|, ~count~0=v_~count~0_79} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread3of3ForFork0InUse, 73#L724true, 14#L733-5true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 67#L725true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:48,848 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 07:59:48,848 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:59:48,848 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:59:48,848 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:59:48,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L719-1-->L721: Formula: (= (mod v_~count~0_77 4294967296) 3) InVars {~count~0=v_~count~0_77} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_21|, ~count~0=v_~count~0_77} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 88#L721true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 67#L725true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:48,849 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 07:59:48,849 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:59:48,849 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:59:48,849 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:59:49,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([585] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 85#L724true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:49,116 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,116 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,116 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,116 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 81#L721true, Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:49,129 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,129 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,129 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,129 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,183 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([582] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_79 4294967296))) InVars {~count~0=v_~count~0_79} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_23|, ~count~0=v_~count~0_79} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 73#L724true, 79#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:49,184 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,184 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,184 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,184 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L719-1-->L721: Formula: (= (mod v_~count~0_77 4294967296) 3) InVars {~count~0=v_~count~0_77} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_21|, ~count~0=v_~count~0_77} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 88#L721true, 79#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:49,185 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,185 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,185 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,185 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,202 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([584] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 81#L721true, Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:49,203 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,203 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,203 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,204 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,204 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,204 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([585] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 85#L724true, 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:49,204 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,205 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,205 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,205 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,205 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 07:59:49,329 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 36#L733-4true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 81#L721true, Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 98#true, 11#L725true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:49,329 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,329 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,329 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,330 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([585] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 36#L733-4true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 85#L724true, 98#true, 11#L725true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:49,330 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,330 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,331 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,331 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 41#L725true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 81#L721true, Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-11-19 07:59:49,430 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-19 07:59:49,430 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 07:59:49,431 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 07:59:49,431 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 07:59:49,431 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([585] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 41#L725true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 85#L724true, 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-11-19 07:59:49,431 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-19 07:59:49,431 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 07:59:49,432 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 07:59:49,432 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 07:59:49,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([582] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_79 4294967296))) InVars {~count~0=v_~count~0_79} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_23|, ~count~0=v_~count~0_79} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread3of3ForFork0InUse, 73#L724true, 36#L733-4true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 67#L725true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:49,530 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,531 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,531 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,531 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L719-1-->L721: Formula: (= (mod v_~count~0_77 4294967296) 3) InVars {~count~0=v_~count~0_77} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_21|, ~count~0=v_~count~0_77} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread3of3ForFork0InUse, 88#L721true, 36#L733-4true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 67#L725true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:49,532 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,532 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,532 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,532 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 36#L733-4true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 81#L721true, Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:49,561 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,562 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,562 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,562 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([585] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 36#L733-4true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 85#L724true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:49,563 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,563 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,563 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,563 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,755 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 3#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 81#L721true, Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-11-19 07:59:49,756 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,756 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,756 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,756 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,757 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([585] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 3#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 85#L724true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-11-19 07:59:49,757 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,757 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,757 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,757 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:59:49,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([582] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_79 4294967296))) InVars {~count~0=v_~count~0_79} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_23|, ~count~0=v_~count~0_79} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread3of3ForFork0InUse, 73#L724true, 79#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 36#L733-4true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:49,836 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,837 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,837 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,837 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L719-1-->L721: Formula: (= (mod v_~count~0_77 4294967296) 3) InVars {~count~0=v_~count~0_77} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_21|, ~count~0=v_~count~0_77} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread3of3ForFork0InUse, 88#L721true, 79#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 36#L733-4true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:49,838 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,838 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,838 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,838 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,850 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([584] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 36#L733-4true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 81#L721true, Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:49,851 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,851 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,852 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,852 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,852 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,852 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([585] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 36#L733-4true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 85#L724true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 23#L724-6true]) [2023-11-19 07:59:49,852 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,853 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,853 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,853 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,854 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:59:49,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 41#L725true, 36#L733-4true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 81#L721true, Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-11-19 07:59:49,965 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-19 07:59:49,965 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:59:49,965 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:59:49,965 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:59:49,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([585] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 41#L725true, 36#L733-4true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 85#L724true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-11-19 07:59:49,966 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-19 07:59:49,966 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:59:49,966 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:59:49,967 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:59:50,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 3#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 36#L733-4true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 81#L721true, Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-11-19 07:59:50,042 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-19 07:59:50,043 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:59:50,043 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:59:50,046 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:59:50,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([585] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 3#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 36#L733-4true, Black: 106#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 101#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 104#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 102#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 100#(= ~count~0 0), 116#(= ~COND~0 0), 85#L724true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-11-19 07:59:50,046 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-19 07:59:50,046 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:59:50,046 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:59:50,047 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:59:50,111 INFO L124 PetriNetUnfolderBase]: 13836/21473 cut-off events. [2023-11-19 07:59:50,111 INFO L125 PetriNetUnfolderBase]: For 12924/14386 co-relation queries the response was YES. [2023-11-19 07:59:50,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50597 conditions, 21473 events. 13836/21473 cut-off events. For 12924/14386 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 168250 event pairs, 5116 based on Foata normal form. 1145/21851 useless extension candidates. Maximal degree in co-relation 38803. Up to 9908 conditions per place. [2023-11-19 07:59:50,300 INFO L140 encePairwiseOnDemand]: 144/154 looper letters, 75 selfloop transitions, 7 changer transitions 0/115 dead transitions. [2023-11-19 07:59:50,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 115 transitions, 625 flow [2023-11-19 07:59:50,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:59:50,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:59:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2023-11-19 07:59:50,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2023-11-19 07:59:50,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 242 transitions. [2023-11-19 07:59:50,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 242 transitions. [2023-11-19 07:59:50,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:50,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 242 transitions. [2023-11-19 07:59:50,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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-19 07:59:50,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 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-19 07:59:50,308 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 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-19 07:59:50,308 INFO L175 Difference]: Start difference. First operand has 63 places, 77 transitions, 324 flow. Second operand 3 states and 242 transitions. [2023-11-19 07:59:50,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 115 transitions, 625 flow [2023-11-19 07:59:50,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 115 transitions, 625 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:59:50,359 INFO L231 Difference]: Finished difference. Result has 67 places, 83 transitions, 382 flow [2023-11-19 07:59:50,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=67, PETRI_TRANSITIONS=83} [2023-11-19 07:59:50,360 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2023-11-19 07:59:50,360 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 83 transitions, 382 flow [2023-11-19 07:59:50,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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-19 07:59:50,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:50,361 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-11-19 07:59:50,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:59:50,361 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-19 07:59:50,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:50,362 INFO L85 PathProgramCache]: Analyzing trace with hash 310710988, now seen corresponding path program 1 times [2023-11-19 07:59:50,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:50,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204511504] [2023-11-19 07:59:50,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:50,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:50,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:59:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:50,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:59:50,392 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:59:50,393 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-19 07:59:50,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-19 07:59:50,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-11-19 07:59:50,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-11-19 07:59:50,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-19 07:59:50,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:59:50,394 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-19 07:59:50,395 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 07:59:50,395 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-19 07:59:50,421 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:59:50,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 118 transitions, 264 flow [2023-11-19 07:59:50,455 INFO L124 PetriNetUnfolderBase]: 13/168 cut-off events. [2023-11-19 07:59:50,456 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-19 07:59:50,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 168 events. 13/168 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 439 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 140. Up to 10 conditions per place. [2023-11-19 07:59:50,457 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 118 transitions, 264 flow [2023-11-19 07:59:50,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 118 transitions, 264 flow [2023-11-19 07:59:50,459 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:59:50,459 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 118 transitions, 264 flow [2023-11-19 07:59:50,460 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 118 transitions, 264 flow [2023-11-19 07:59:50,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 118 transitions, 264 flow [2023-11-19 07:59:50,488 INFO L124 PetriNetUnfolderBase]: 13/168 cut-off events. [2023-11-19 07:59:50,489 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-19 07:59:50,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 168 events. 13/168 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 439 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 140. Up to 10 conditions per place. [2023-11-19 07:59:50,498 INFO L119 LiptonReduction]: Number of co-enabled transitions 8536 [2023-11-19 07:59:51,777 INFO L134 LiptonReduction]: Checked pairs total: 33241 [2023-11-19 07:59:51,777 INFO L136 LiptonReduction]: Total number of compositions: 71 [2023-11-19 07:59:51,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:59:51,780 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;@39627d6b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:59:51,781 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 07:59:51,784 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:59:51,784 INFO L124 PetriNetUnfolderBase]: 1/31 cut-off events. [2023-11-19 07:59:51,785 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-19 07:59:51,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:59:51,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:51,785 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-19 07:59:51,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:51,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1513312359, now seen corresponding path program 1 times [2023-11-19 07:59:51,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:51,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313834227] [2023-11-19 07:59:51,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:51,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:51,939 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-19 07:59:51,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:51,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313834227] [2023-11-19 07:59:51,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313834227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:51,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:51,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:59:51,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744049513] [2023-11-19 07:59:51,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:51,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:59:51,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:51,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:59:51,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:59:52,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 189 [2023-11-19 07:59:52,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 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-19 07:59:52,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:59:52,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 189 [2023-11-19 07:59:52,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:15,422 INFO L124 PetriNetUnfolderBase]: 170171/238063 cut-off events. [2023-11-19 08:00:15,422 INFO L125 PetriNetUnfolderBase]: For 25106/25106 co-relation queries the response was YES. [2023-11-19 08:00:15,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473599 conditions, 238063 events. 170171/238063 cut-off events. For 25106/25106 co-relation queries the response was YES. Maximal size of possible extension queue 9627. Compared 1947229 event pairs, 34517 based on Foata normal form. 6020/237930 useless extension candidates. Maximal degree in co-relation 162276. Up to 90819 conditions per place. [2023-11-19 08:00:17,073 INFO L140 encePairwiseOnDemand]: 169/189 looper letters, 178 selfloop transitions, 34 changer transitions 0/228 dead transitions. [2023-11-19 08:00:17,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 228 transitions, 1003 flow [2023-11-19 08:00:17,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:00:17,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:00:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 695 transitions. [2023-11-19 08:00:17,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5253212396069539 [2023-11-19 08:00:17,076 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 695 transitions. [2023-11-19 08:00:17,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 695 transitions. [2023-11-19 08:00:17,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:17,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 695 transitions. [2023-11-19 08:00:17,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.28571428571429) internal successors, (695), 7 states have internal predecessors, (695), 0 states have call successors, (0), 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-19 08:00:17,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 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-19 08:00:17,084 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 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-19 08:00:17,084 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 160 flow. Second operand 7 states and 695 transitions. [2023-11-19 08:00:17,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 228 transitions, 1003 flow [2023-11-19 08:00:17,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 228 transitions, 967 flow, removed 18 selfloop flow, removed 0 redundant places. [2023-11-19 08:00:17,100 INFO L231 Difference]: Finished difference. Result has 78 places, 101 transitions, 426 flow [2023-11-19 08:00:17,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=426, PETRI_PLACES=78, PETRI_TRANSITIONS=101} [2023-11-19 08:00:17,102 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 7 predicate places. [2023-11-19 08:00:17,102 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 101 transitions, 426 flow [2023-11-19 08:00:17,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 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-19 08:00:17,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:00:17,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:17,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:00:17,104 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-19 08:00:17,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:17,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1677183076, now seen corresponding path program 1 times [2023-11-19 08:00:17,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:17,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424002818] [2023-11-19 08:00:17,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:17,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:17,226 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-19 08:00:17,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:17,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424002818] [2023-11-19 08:00:17,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424002818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:17,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:17,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:00:17,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387146709] [2023-11-19 08:00:17,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:17,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:00:17,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:17,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:00:17,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:00:17,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 189 [2023-11-19 08:00:17,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 101 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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-19 08:00:17,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:00:17,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 189 [2023-11-19 08:00:17,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:00:20,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([769] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_101 4294967296))) InVars {~count~0=v_~count~0_101} OutVars{thr1Thread1of4ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of4ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_101} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_Barrier2_#t~post4#1][33], [139#(= ~COND~0 0), Black: 124#(= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0), 83#L724true, Black: 123#(= ~count~0 0), Black: 129#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 127#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 125#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 66#L725true, 10#L733-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 19#L724-6true, 121#true]) [2023-11-19 08:00:20,870 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 08:00:20,871 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:00:20,871 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:00:20,871 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:00:20,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([768] L719-1-->L721: Formula: (= (mod v_~count~0_99 4294967296) 3) InVars {~count~0=v_~count~0_99} OutVars{thr1Thread1of4ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of4ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_99} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_Barrier2_#t~post4#1][34], [139#(= ~COND~0 0), Black: 124#(= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0), Black: 123#(= ~count~0 0), Black: 129#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 127#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 125#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 66#L725true, 87#L721true, 10#L733-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 19#L724-6true, 121#true]) [2023-11-19 08:00:20,875 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 08:00:20,875 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:00:20,875 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:00:20,875 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:00:22,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([769] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_101 4294967296))) InVars {~count~0=v_~count~0_101} OutVars{thr1Thread1of4ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of4ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_101} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_Barrier2_#t~post4#1][33], [139#(= ~COND~0 0), Black: 124#(= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0), 26#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 83#L724true, Black: 123#(= ~count~0 0), Black: 129#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 127#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 125#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 10#L733-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 19#L724-6true, 121#true]) [2023-11-19 08:00:22,022 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 08:00:22,022 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:00:22,022 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:00:22,022 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:00:22,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([768] L719-1-->L721: Formula: (= (mod v_~count~0_99 4294967296) 3) InVars {~count~0=v_~count~0_99} OutVars{thr1Thread1of4ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of4ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_99} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_Barrier2_#t~post4#1][34], [139#(= ~COND~0 0), 26#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 124#(= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0), Black: 123#(= ~count~0 0), Black: 129#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 127#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 125#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 87#L721true, 10#L733-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 19#L724-6true, 121#true]) [2023-11-19 08:00:22,026 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 08:00:22,026 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:00:22,026 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:00:22,026 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:00:22,074 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([769] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_101 4294967296))) InVars {~count~0=v_~count~0_101} OutVars{thr1Thread1of4ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of4ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_101} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_Barrier2_#t~post4#1][33], [139#(= ~COND~0 0), Black: 124#(= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0), 26#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 123#(= ~count~0 0), 83#L724true, Black: 129#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 127#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 125#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 10#L733-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 19#L724-6true, 121#true]) [2023-11-19 08:00:22,075 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 08:00:22,075 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:00:22,075 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:00:22,075 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:00:22,075 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:00:22,075 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([768] L719-1-->L721: Formula: (= (mod v_~count~0_99 4294967296) 3) InVars {~count~0=v_~count~0_99} OutVars{thr1Thread1of4ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of4ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_99} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_Barrier2_#t~post4#1][34], [139#(= ~COND~0 0), Black: 124#(= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0), 26#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 123#(= ~count~0 0), Black: 129#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 127#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 125#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 87#L721true, 10#L733-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 19#L724-6true, 121#true]) [2023-11-19 08:00:22,076 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 08:00:22,076 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:00:22,076 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:00:22,076 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:00:22,076 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:00:23,419 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([769] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_101 4294967296))) InVars {~count~0=v_~count~0_101} OutVars{thr1Thread1of4ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of4ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_101} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_Barrier2_#t~post4#1][33], [139#(= ~COND~0 0), Black: 124#(= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0), 83#L724true, Black: 123#(= ~count~0 0), 20#L733-4true, Black: 129#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 127#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 125#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 66#L725true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 19#L724-6true, 121#true]) [2023-11-19 08:00:23,419 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 08:00:23,419 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:00:23,419 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:00:23,419 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:00:23,419 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([768] L719-1-->L721: Formula: (= (mod v_~count~0_99 4294967296) 3) InVars {~count~0=v_~count~0_99} OutVars{thr1Thread1of4ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of4ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_99} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_Barrier2_#t~post4#1][34], [139#(= ~COND~0 0), Black: 124#(= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0), Black: 123#(= ~count~0 0), 20#L733-4true, Black: 129#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 127#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 125#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 66#L725true, 87#L721true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 19#L724-6true, 121#true]) [2023-11-19 08:00:23,419 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 08:00:23,419 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:00:23,420 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:00:23,420 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:00:23,559 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([769] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_101 4294967296))) InVars {~count~0=v_~count~0_101} OutVars{thr1Thread1of4ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of4ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_101} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_Barrier2_#t~post4#1][33], [139#(= ~COND~0 0), Black: 124#(= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0), 26#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 123#(= ~count~0 0), 83#L724true, Black: 129#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 127#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 125#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 10#L733-5true, 34#L725true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 121#true]) [2023-11-19 08:00:23,559 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-19 08:00:23,560 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:00:23,560 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:00:23,560 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:00:23,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([768] L719-1-->L721: Formula: (= (mod v_~count~0_99 4294967296) 3) InVars {~count~0=v_~count~0_99} OutVars{thr1Thread1of4ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of4ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_99} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_Barrier2_#t~post4#1][34], [139#(= ~COND~0 0), 26#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 124#(= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0), Black: 123#(= ~count~0 0), Black: 129#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 127#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 125#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 87#L721true, 10#L733-5true, 34#L725true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 121#true]) [2023-11-19 08:00:23,560 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-19 08:00:23,560 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:00:23,560 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:00:23,560 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:00:25,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([769] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_101 4294967296))) InVars {~count~0=v_~count~0_101} OutVars{thr1Thread1of4ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of4ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_101} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_Barrier2_#t~post4#1][33], [139#(= ~COND~0 0), Black: 124#(= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0), 26#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 83#L724true, Black: 123#(= ~count~0 0), 20#L733-4true, Black: 129#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 127#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 125#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 19#L724-6true, 121#true]) [2023-11-19 08:00:25,049 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 08:00:25,050 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:00:25,050 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:00:25,050 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:00:25,050 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([768] L719-1-->L721: Formula: (= (mod v_~count~0_99 4294967296) 3) InVars {~count~0=v_~count~0_99} OutVars{thr1Thread1of4ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of4ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_99} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_Barrier2_#t~post4#1][34], [139#(= ~COND~0 0), 26#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 124#(= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0), Black: 123#(= ~count~0 0), 20#L733-4true, Black: 129#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 127#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 125#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 87#L721true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 19#L724-6true, 121#true]) [2023-11-19 08:00:25,050 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 08:00:25,050 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:00:25,051 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:00:25,051 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:00:25,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([769] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_101 4294967296))) InVars {~count~0=v_~count~0_101} OutVars{thr1Thread1of4ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of4ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_101} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_Barrier2_#t~post4#1][33], [139#(= ~COND~0 0), Black: 124#(= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0), 26#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 123#(= ~count~0 0), 83#L724true, 44#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 129#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 127#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 125#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 10#L733-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 121#true]) [2023-11-19 08:00:25,196 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 08:00:25,196 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:00:25,196 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:00:25,197 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:00:25,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([768] L719-1-->L721: Formula: (= (mod v_~count~0_99 4294967296) 3) InVars {~count~0=v_~count~0_99} OutVars{thr1Thread1of4ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of4ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_99} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_Barrier2_#t~post4#1][34], [139#(= ~COND~0 0), 26#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 124#(= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0), Black: 123#(= ~count~0 0), 44#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 129#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 127#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post4#1| 0)), Black: 125#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 87#L721true, 10#L733-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 121#true]) [2023-11-19 08:00:25,197 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 08:00:25,197 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:00:25,197 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:00:25,197 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event