./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/40_barrier_vf-pthread.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_072547d8-43a9-400b-b8e9-065f607bffdc/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_072547d8-43a9-400b-b8e9-065f607bffdc/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_072547d8-43a9-400b-b8e9-065f607bffdc/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_072547d8-43a9-400b-b8e9-065f607bffdc/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/40_barrier_vf-pthread.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_072547d8-43a9-400b-b8e9-065f607bffdc/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_072547d8-43a9-400b-b8e9-065f607bffdc/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 828cbbb8bb1b7fb83d1c4d35071bdac7e1b4ae65dfc83ebb19446976ecd8d980 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:44:39,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:44:40,038 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_072547d8-43a9-400b-b8e9-065f607bffdc/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:44:40,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:44:40,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:44:40,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:44:40,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:44:40,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:44:40,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:44:40,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:44:40,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:44:40,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:44:40,095 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:44:40,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:44:40,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:44:40,098 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:44:40,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:44:40,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:44:40,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:44:40,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:44:40,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:44:40,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:44:40,102 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:44:40,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:44:40,103 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:44:40,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:44:40,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:44:40,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:44:40,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:44:40,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:44:40,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:44:40,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:44:40,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:44:40,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:44:40,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:44:40,109 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:44:40,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:44:40,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:44:40,110 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:44:40,110 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_072547d8-43a9-400b-b8e9-065f607bffdc/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_072547d8-43a9-400b-b8e9-065f607bffdc/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 -> 828cbbb8bb1b7fb83d1c4d35071bdac7e1b4ae65dfc83ebb19446976ecd8d980 [2023-11-19 07:44:40,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:44:40,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:44:40,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:44:40,443 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:44:40,444 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:44:40,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_072547d8-43a9-400b-b8e9-065f607bffdc/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-ext/40_barrier_vf-pthread.i [2023-11-19 07:44:43,679 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:44:43,942 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:44:43,943 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_072547d8-43a9-400b-b8e9-065f607bffdc/sv-benchmarks/c/pthread-ext/40_barrier_vf-pthread.i [2023-11-19 07:44:43,964 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_072547d8-43a9-400b-b8e9-065f607bffdc/bin/uautomizer-verify-uCwYo4JHxu/data/bd75f30d1/7dcbd48eca694246b4e14fde0a576dc2/FLAG908a82e55 [2023-11-19 07:44:43,990 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_072547d8-43a9-400b-b8e9-065f607bffdc/bin/uautomizer-verify-uCwYo4JHxu/data/bd75f30d1/7dcbd48eca694246b4e14fde0a576dc2 [2023-11-19 07:44:43,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:44:43,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:44:44,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:44:44,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:44:44,007 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:44:44,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:44:43" (1/1) ... [2023-11-19 07:44:44,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d1bc16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:44, skipping insertion in model container [2023-11-19 07:44:44,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:44:43" (1/1) ... [2023-11-19 07:44:44,084 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:44:44,473 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_072547d8-43a9-400b-b8e9-065f607bffdc/sv-benchmarks/c/pthread-ext/40_barrier_vf-pthread.i[30842,30855] [2023-11-19 07:44:44,481 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:44:44,497 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:44:44,534 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_072547d8-43a9-400b-b8e9-065f607bffdc/sv-benchmarks/c/pthread-ext/40_barrier_vf-pthread.i[30842,30855] [2023-11-19 07:44:44,537 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:44:44,580 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:44:44,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:44 WrapperNode [2023-11-19 07:44:44,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:44:44,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:44:44,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:44:44,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:44:44,591 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:44:44" (1/1) ... [2023-11-19 07:44:44,605 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:44:44" (1/1) ... [2023-11-19 07:44:44,628 INFO L138 Inliner]: procedures = 164, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2023-11-19 07:44:44,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:44:44,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:44:44,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:44:44,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:44:44,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:44" (1/1) ... [2023-11-19 07:44:44,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:44" (1/1) ... [2023-11-19 07:44:44,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:44" (1/1) ... [2023-11-19 07:44:44,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:44" (1/1) ... [2023-11-19 07:44:44,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:44" (1/1) ... [2023-11-19 07:44:44,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:44" (1/1) ... [2023-11-19 07:44:44,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:44" (1/1) ... [2023-11-19 07:44:44,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:44" (1/1) ... [2023-11-19 07:44:44,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:44:44,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:44:44,668 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:44:44,668 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:44:44,669 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:44" (1/1) ... [2023-11-19 07:44:44,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:44:44,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_072547d8-43a9-400b-b8e9-065f607bffdc/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:44,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_072547d8-43a9-400b-b8e9-065f607bffdc/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:44:44,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_072547d8-43a9-400b-b8e9-065f607bffdc/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:44:44,758 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-19 07:44:44,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-19 07:44:44,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:44:44,759 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-19 07:44:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:44:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:44:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:44:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:44:44,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:44:44,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:44:44,762 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:44:44,952 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:44:44,956 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:44:45,203 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:44:45,213 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:44:45,213 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-19 07:44:45,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:44:45 BoogieIcfgContainer [2023-11-19 07:44:45,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:44:45,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:44:45,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:44:45,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:44:45,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:44:43" (1/3) ... [2023-11-19 07:44:45,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770e2097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:44:45, skipping insertion in model container [2023-11-19 07:44:45,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:44" (2/3) ... [2023-11-19 07:44:45,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770e2097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:44:45, skipping insertion in model container [2023-11-19 07:44:45,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:44:45" (3/3) ... [2023-11-19 07:44:45,232 INFO L112 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf-pthread.i [2023-11-19 07:44:45,241 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:44:45,254 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:44:45,254 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:44:45,254 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:44:45,342 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:44:45,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 70 transitions, 144 flow [2023-11-19 07:44:45,446 INFO L124 PetriNetUnfolderBase]: 6/81 cut-off events. [2023-11-19 07:44:45,447 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:44:45,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 81 events. 6/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 41. Up to 4 conditions per place. [2023-11-19 07:44:45,453 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 70 transitions, 144 flow [2023-11-19 07:44:45,458 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 70 transitions, 144 flow [2023-11-19 07:44:45,462 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:44:45,472 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 70 transitions, 144 flow [2023-11-19 07:44:45,476 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 70 transitions, 144 flow [2023-11-19 07:44:45,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 70 transitions, 144 flow [2023-11-19 07:44:45,530 INFO L124 PetriNetUnfolderBase]: 6/81 cut-off events. [2023-11-19 07:44:45,530 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:44:45,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 81 events. 6/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 41. Up to 4 conditions per place. [2023-11-19 07:44:45,534 INFO L119 LiptonReduction]: Number of co-enabled transitions 700 [2023-11-19 07:44:48,561 INFO L134 LiptonReduction]: Checked pairs total: 530 [2023-11-19 07:44:48,561 INFO L136 LiptonReduction]: Total number of compositions: 67 [2023-11-19 07:44:48,591 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:44:48,601 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;@198d3af5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:44:48,601 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-19 07:44:48,611 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:44:48,612 INFO L124 PetriNetUnfolderBase]: 2/11 cut-off events. [2023-11-19 07:44:48,612 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:44:48,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:48,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:44:48,613 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:44:48,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:48,619 INFO L85 PathProgramCache]: Analyzing trace with hash 276088070, now seen corresponding path program 1 times [2023-11-19 07:44:48,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:48,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232594692] [2023-11-19 07:44:48,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:48,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:49,037 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:44:49,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:49,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232594692] [2023-11-19 07:44:49,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232594692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:49,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:49,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:44:49,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484396064] [2023-11-19 07:44:49,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:49,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:44:49,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:49,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:44:49,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:44:49,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 137 [2023-11-19 07:44:49,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 13 places, 12 transitions, 28 flow. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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:44:49,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:44:49,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 137 [2023-11-19 07:44:49,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:44:49,148 INFO L124 PetriNetUnfolderBase]: 9/24 cut-off events. [2023-11-19 07:44:49,148 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:44:49,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 24 events. 9/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 40. Up to 19 conditions per place. [2023-11-19 07:44:49,151 INFO L140 encePairwiseOnDemand]: 132/137 looper letters, 8 selfloop transitions, 2 changer transitions 0/11 dead transitions. [2023-11-19 07:44:49,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 13 places, 11 transitions, 46 flow [2023-11-19 07:44:49,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:44:49,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:44:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2023-11-19 07:44:49,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46472019464720193 [2023-11-19 07:44:49,172 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 191 transitions. [2023-11-19 07:44:49,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 191 transitions. [2023-11-19 07:44:49,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:44:49,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 191 transitions. [2023-11-19 07:44:49,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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:44:49,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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:44:49,193 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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:44:49,195 INFO L175 Difference]: Start difference. First operand has 13 places, 12 transitions, 28 flow. Second operand 3 states and 191 transitions. [2023-11-19 07:44:49,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 13 places, 11 transitions, 46 flow [2023-11-19 07:44:49,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 11 transitions, 46 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:44:49,201 INFO L231 Difference]: Finished difference. Result has 13 places, 9 transitions, 26 flow [2023-11-19 07:44:49,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=22, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=26, PETRI_PLACES=13, PETRI_TRANSITIONS=9} [2023-11-19 07:44:49,210 INFO L281 CegarLoopForPetriNet]: 13 programPoint places, 0 predicate places. [2023-11-19 07:44:49,210 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 9 transitions, 26 flow [2023-11-19 07:44:49,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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:44:49,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:49,211 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-19 07:44:49,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:44:49,212 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:44:49,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:49,213 INFO L85 PathProgramCache]: Analyzing trace with hash -31237896, now seen corresponding path program 1 times [2023-11-19 07:44:49,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:49,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34704861] [2023-11-19 07:44:49,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:49,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:49,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:44:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:49,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:44:49,313 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:44:49,315 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-19 07:44:49,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-11-19 07:44:49,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-11-19 07:44:49,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:44:49,318 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-19 07:44:49,321 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 07:44:49,321 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-19 07:44:49,356 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:44:49,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 96 transitions, 202 flow [2023-11-19 07:44:49,418 INFO L124 PetriNetUnfolderBase]: 11/120 cut-off events. [2023-11-19 07:44:49,418 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:44:49,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 120 events. 11/120 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 196 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 82. Up to 6 conditions per place. [2023-11-19 07:44:49,422 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 96 transitions, 202 flow [2023-11-19 07:44:49,425 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 96 transitions, 202 flow [2023-11-19 07:44:49,426 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:44:49,426 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 96 transitions, 202 flow [2023-11-19 07:44:49,427 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 96 transitions, 202 flow [2023-11-19 07:44:49,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 96 transitions, 202 flow [2023-11-19 07:44:49,472 INFO L124 PetriNetUnfolderBase]: 11/120 cut-off events. [2023-11-19 07:44:49,472 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:44:49,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 120 events. 11/120 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 196 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 82. Up to 6 conditions per place. [2023-11-19 07:44:49,481 INFO L119 LiptonReduction]: Number of co-enabled transitions 2700 [2023-11-19 07:44:52,006 INFO L134 LiptonReduction]: Checked pairs total: 8776 [2023-11-19 07:44:52,006 INFO L136 LiptonReduction]: Total number of compositions: 70 [2023-11-19 07:44:52,009 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:44:52,010 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;@198d3af5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:44:52,011 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-19 07:44:52,016 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:44:52,016 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-11-19 07:44:52,016 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 07:44:52,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:52,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:52,017 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-19 07:44:52,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:52,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1908772449, now seen corresponding path program 1 times [2023-11-19 07:44:52,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:52,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282597413] [2023-11-19 07:44:52,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:52,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:52,053 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:44:52,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:52,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282597413] [2023-11-19 07:44:52,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282597413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:52,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:52,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:44:52,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420608959] [2023-11-19 07:44:52,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:52,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:44:52,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:52,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:44:52,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:44:52,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 166 [2023-11-19 07:44:52,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 38 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 87.5) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 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:44:52,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:44:52,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 166 [2023-11-19 07:44:52,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:44:52,121 INFO L124 PetriNetUnfolderBase]: 83/246 cut-off events. [2023-11-19 07:44:52,122 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-19 07:44:52,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 246 events. 83/246 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1207 event pairs, 51 based on Foata normal form. 20/223 useless extension candidates. Maximal degree in co-relation 80. Up to 124 conditions per place. [2023-11-19 07:44:52,125 INFO L140 encePairwiseOnDemand]: 161/166 looper letters, 13 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-11-19 07:44:52,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 102 flow [2023-11-19 07:44:52,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:44:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:44:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 186 transitions. [2023-11-19 07:44:52,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5602409638554217 [2023-11-19 07:44:52,128 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 186 transitions. [2023-11-19 07:44:52,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 186 transitions. [2023-11-19 07:44:52,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:44:52,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 186 transitions. [2023-11-19 07:44:52,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 93.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 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:44:52,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 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:44:52,131 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 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:44:52,132 INFO L175 Difference]: Start difference. First operand has 37 places, 38 transitions, 86 flow. Second operand 2 states and 186 transitions. [2023-11-19 07:44:52,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 102 flow [2023-11-19 07:44:52,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 102 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:44:52,134 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 76 flow [2023-11-19 07:44:52,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2023-11-19 07:44:52,135 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2023-11-19 07:44:52,135 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 76 flow [2023-11-19 07:44:52,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 87.5) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 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:44:52,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:52,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:52,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:44:52,136 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-19 07:44:52,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:52,137 INFO L85 PathProgramCache]: Analyzing trace with hash 957565364, now seen corresponding path program 1 times [2023-11-19 07:44:52,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:52,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795989039] [2023-11-19 07:44:52,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:52,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:52,232 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:44:52,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:52,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795989039] [2023-11-19 07:44:52,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795989039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:52,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:52,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:44:52,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594319204] [2023-11-19 07:44:52,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:52,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:44:52,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:52,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:44:52,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:44:52,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 166 [2023-11-19 07:44:52,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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:44:52,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:44:52,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 166 [2023-11-19 07:44:52,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:44:52,363 INFO L124 PetriNetUnfolderBase]: 127/323 cut-off events. [2023-11-19 07:44:52,363 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-19 07:44:52,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 323 events. 127/323 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1612 event pairs, 37 based on Foata normal form. 16/309 useless extension candidates. Maximal degree in co-relation 554. Up to 133 conditions per place. [2023-11-19 07:44:52,366 INFO L140 encePairwiseOnDemand]: 161/166 looper letters, 25 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2023-11-19 07:44:52,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 159 flow [2023-11-19 07:44:52,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:44:52,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:44:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2023-11-19 07:44:52,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.536144578313253 [2023-11-19 07:44:52,370 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions. [2023-11-19 07:44:52,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions. [2023-11-19 07:44:52,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:44:52,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions. [2023-11-19 07:44:52,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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:44:52,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 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:44:52,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 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:44:52,375 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 76 flow. Second operand 3 states and 267 transitions. [2023-11-19 07:44:52,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 159 flow [2023-11-19 07:44:52,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 159 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:44:52,377 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 97 flow [2023-11-19 07:44:52,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2023-11-19 07:44:52,378 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2023-11-19 07:44:52,379 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 97 flow [2023-11-19 07:44:52,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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:44:52,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:52,379 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-19 07:44:52,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:44:52,380 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-19 07:44:52,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:52,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2061126348, now seen corresponding path program 1 times [2023-11-19 07:44:52,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:52,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021919002] [2023-11-19 07:44:52,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:52,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:52,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:44:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:52,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:44:52,412 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:44:52,412 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-11-19 07:44:52,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-11-19 07:44:52,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-11-19 07:44:52,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-11-19 07:44:52,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:44:52,414 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-19 07:44:52,414 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 07:44:52,415 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-19 07:44:52,436 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:44:52,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 122 transitions, 262 flow [2023-11-19 07:44:52,458 INFO L124 PetriNetUnfolderBase]: 16/159 cut-off events. [2023-11-19 07:44:52,459 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 07:44:52,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 159 events. 16/159 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 344 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2023-11-19 07:44:52,460 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 122 transitions, 262 flow [2023-11-19 07:44:52,461 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 122 transitions, 262 flow [2023-11-19 07:44:52,462 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:44:52,462 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 122 transitions, 262 flow [2023-11-19 07:44:52,462 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 122 transitions, 262 flow [2023-11-19 07:44:52,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 122 transitions, 262 flow [2023-11-19 07:44:52,482 INFO L124 PetriNetUnfolderBase]: 16/159 cut-off events. [2023-11-19 07:44:52,482 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 07:44:52,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 159 events. 16/159 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 344 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2023-11-19 07:44:52,488 INFO L119 LiptonReduction]: Number of co-enabled transitions 6000 [2023-11-19 07:44:55,141 INFO L134 LiptonReduction]: Checked pairs total: 21118 [2023-11-19 07:44:55,141 INFO L136 LiptonReduction]: Total number of compositions: 85 [2023-11-19 07:44:55,143 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:44:55,145 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;@198d3af5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:44:55,145 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-19 07:44:55,149 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:44:55,149 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-11-19 07:44:55,149 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 07:44:55,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:55,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:55,149 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:44:55,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:55,150 INFO L85 PathProgramCache]: Analyzing trace with hash 694796167, now seen corresponding path program 1 times [2023-11-19 07:44:55,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:55,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830909139] [2023-11-19 07:44:55,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:55,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:55,173 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:44:55,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:55,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830909139] [2023-11-19 07:44:55,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830909139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:55,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:55,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:44:55,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844767294] [2023-11-19 07:44:55,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:55,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:44:55,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:55,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:44:55,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:44:55,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 207 [2023-11-19 07:44:55,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 54 transitions, 126 flow. Second operand has 2 states, 2 states have (on average 109.0) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 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:44:55,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:44:55,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 207 [2023-11-19 07:44:55,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:44:55,536 INFO L124 PetriNetUnfolderBase]: 1449/2720 cut-off events. [2023-11-19 07:44:55,536 INFO L125 PetriNetUnfolderBase]: For 277/277 co-relation queries the response was YES. [2023-11-19 07:44:55,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4740 conditions, 2720 events. 1449/2720 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 18248 event pairs, 972 based on Foata normal form. 390/2792 useless extension candidates. Maximal degree in co-relation 591. Up to 1875 conditions per place. [2023-11-19 07:44:55,568 INFO L140 encePairwiseOnDemand]: 200/207 looper letters, 21 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2023-11-19 07:44:55,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 47 transitions, 154 flow [2023-11-19 07:44:55,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:44:55,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:44:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 238 transitions. [2023-11-19 07:44:55,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5748792270531401 [2023-11-19 07:44:55,571 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 238 transitions. [2023-11-19 07:44:55,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 238 transitions. [2023-11-19 07:44:55,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:44:55,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 238 transitions. [2023-11-19 07:44:55,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 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:44:55,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 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:44:55,575 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 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:44:55,575 INFO L175 Difference]: Start difference. First operand has 52 places, 54 transitions, 126 flow. Second operand 2 states and 238 transitions. [2023-11-19 07:44:55,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 47 transitions, 154 flow [2023-11-19 07:44:55,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 152 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-19 07:44:55,579 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 110 flow [2023-11-19 07:44:55,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=110, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2023-11-19 07:44:55,580 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-11-19 07:44:55,580 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 110 flow [2023-11-19 07:44:55,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.0) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 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:44:55,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:55,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:55,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:44:55,590 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:44:55,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:55,591 INFO L85 PathProgramCache]: Analyzing trace with hash 63778111, now seen corresponding path program 1 times [2023-11-19 07:44:55,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:55,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974200252] [2023-11-19 07:44:55,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:55,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:55,660 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:44:55,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:55,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974200252] [2023-11-19 07:44:55,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974200252] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:55,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:55,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:44:55,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089955172] [2023-11-19 07:44:55,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:55,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:44:55,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:55,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:44:55,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:44:55,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 207 [2023-11-19 07:44:55,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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:44:55,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:44:55,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 207 [2023-11-19 07:44:55,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:44:56,243 INFO L124 PetriNetUnfolderBase]: 2530/4296 cut-off events. [2023-11-19 07:44:56,243 INFO L125 PetriNetUnfolderBase]: For 218/218 co-relation queries the response was YES. [2023-11-19 07:44:56,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7910 conditions, 4296 events. 2530/4296 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 28470 event pairs, 713 based on Foata normal form. 275/4316 useless extension candidates. Maximal degree in co-relation 7904. Up to 2425 conditions per place. [2023-11-19 07:44:56,290 INFO L140 encePairwiseOnDemand]: 200/207 looper letters, 42 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2023-11-19 07:44:56,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 250 flow [2023-11-19 07:44:56,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:44:56,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:44:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-11-19 07:44:56,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5523349436392915 [2023-11-19 07:44:56,293 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-11-19 07:44:56,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-11-19 07:44:56,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:44:56,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-11-19 07:44:56,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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:44:56,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 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:44:56,298 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 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:44:56,299 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 110 flow. Second operand 3 states and 343 transitions. [2023-11-19 07:44:56,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 250 flow [2023-11-19 07:44:56,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 250 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:44:56,302 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 140 flow [2023-11-19 07:44:56,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2023-11-19 07:44:56,304 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-11-19 07:44:56,304 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 140 flow [2023-11-19 07:44:56,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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:44:56,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:56,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:56,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:44:56,305 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-19 07:44:56,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:56,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1976135178, now seen corresponding path program 1 times [2023-11-19 07:44:56,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:56,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468892168] [2023-11-19 07:44:56,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:56,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:56,399 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:44:56,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:56,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468892168] [2023-11-19 07:44:56,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468892168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:56,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:56,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:44:56,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488820497] [2023-11-19 07:44:56,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:56,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:44:56,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:56,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:44:56,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:44:56,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 207 [2023-11-19 07:44:56,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 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:44:56,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:44:56,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 207 [2023-11-19 07:44:56,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:44:57,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread2of3ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread2of3ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of3ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of3ForFork0_Barrier2_#t~post2#1][60], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 122#true, 3#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 35#L709-5true, 50#L699-3true, 129#(= ~count~0 0), 43#L699-3true, Black: 124#(= ~COND~0 0), 119#true]) [2023-11-19 07:44:57,557 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2023-11-19 07:44:57,558 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-19 07:44:57,558 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-19 07:44:57,558 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-11-19 07:44:57,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread2of3ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread2of3ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of3ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of3ForFork0_Barrier2_#t~post2#1][60], [thr1Thread1of3ForFork0InUse, 40#L709-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 122#true, 3#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 50#L699-3true, 129#(= ~count~0 0), 43#L699-3true, Black: 124#(= ~COND~0 0), 119#true]) [2023-11-19 07:44:57,670 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2023-11-19 07:44:57,670 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-11-19 07:44:57,670 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-19 07:44:57,671 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-19 07:44:57,716 INFO L124 PetriNetUnfolderBase]: 4703/8757 cut-off events. [2023-11-19 07:44:57,716 INFO L125 PetriNetUnfolderBase]: For 306/306 co-relation queries the response was YES. [2023-11-19 07:44:57,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16187 conditions, 8757 events. 4703/8757 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 73961 event pairs, 1110 based on Foata normal form. 308/8611 useless extension candidates. Maximal degree in co-relation 16179. Up to 2496 conditions per place. [2023-11-19 07:44:57,820 INFO L140 encePairwiseOnDemand]: 196/207 looper letters, 83 selfloop transitions, 18 changer transitions 0/124 dead transitions. [2023-11-19 07:44:57,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 124 transitions, 520 flow [2023-11-19 07:44:57,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:44:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:44:57,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 655 transitions. [2023-11-19 07:44:57,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5273752012882448 [2023-11-19 07:44:57,825 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 655 transitions. [2023-11-19 07:44:57,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 655 transitions. [2023-11-19 07:44:57,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:44:57,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 655 transitions. [2023-11-19 07:44:57,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 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:44:57,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 0 states have call successors, (0), 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:44:57,834 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 0 states have call successors, (0), 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:44:57,834 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 140 flow. Second operand 6 states and 655 transitions. [2023-11-19 07:44:57,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 124 transitions, 520 flow [2023-11-19 07:44:57,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 124 transitions, 516 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:44:57,841 INFO L231 Difference]: Finished difference. Result has 60 places, 71 transitions, 283 flow [2023-11-19 07:44:57,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=60, PETRI_TRANSITIONS=71} [2023-11-19 07:44:57,843 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2023-11-19 07:44:57,843 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 71 transitions, 283 flow [2023-11-19 07:44:57,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 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:44:57,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:44:57,844 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-11-19 07:44:57,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:44:57,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-19 07:44:57,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:57,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1119112466, now seen corresponding path program 1 times [2023-11-19 07:44:57,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:57,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611271509] [2023-11-19 07:44:57,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:57,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:57,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:44:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:57,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:44:57,905 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:44:57,905 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-19 07:44:57,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-19 07:44:57,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-11-19 07:44:57,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-11-19 07:44:57,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-19 07:44:57,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:44:57,907 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-19 07:44:57,909 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 07:44:57,909 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-19 07:44:57,952 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:44:57,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 148 transitions, 324 flow [2023-11-19 07:44:57,993 INFO L124 PetriNetUnfolderBase]: 21/198 cut-off events. [2023-11-19 07:44:57,993 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-19 07:44:57,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 198 events. 21/198 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 472 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 167. Up to 10 conditions per place. [2023-11-19 07:44:57,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 148 transitions, 324 flow [2023-11-19 07:44:57,998 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 148 transitions, 324 flow [2023-11-19 07:44:57,998 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:44:57,998 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 148 transitions, 324 flow [2023-11-19 07:44:57,999 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 148 transitions, 324 flow [2023-11-19 07:44:57,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 148 transitions, 324 flow [2023-11-19 07:44:58,030 INFO L124 PetriNetUnfolderBase]: 21/198 cut-off events. [2023-11-19 07:44:58,030 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-19 07:44:58,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 198 events. 21/198 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 472 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 167. Up to 10 conditions per place. [2023-11-19 07:44:58,042 INFO L119 LiptonReduction]: Number of co-enabled transitions 10600 [2023-11-19 07:45:00,827 INFO L134 LiptonReduction]: Checked pairs total: 39190 [2023-11-19 07:45:00,827 INFO L136 LiptonReduction]: Total number of compositions: 102 [2023-11-19 07:45:00,829 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:45:00,830 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;@198d3af5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:45:00,830 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 07:45:00,833 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:45:00,833 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-11-19 07:45:00,833 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 07:45:00,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:00,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:00,834 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:45:00,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:00,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1780744872, now seen corresponding path program 1 times [2023-11-19 07:45:00,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:00,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794743667] [2023-11-19 07:45:00,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:00,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:00,864 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:45:00,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:00,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794743667] [2023-11-19 07:45:00,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794743667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:00,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:00,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:45:00,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178127769] [2023-11-19 07:45:00,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:00,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:45:00,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:00,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:45:00,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:45:00,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 250 [2023-11-19 07:45:00,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 168 flow. Second operand has 2 states, 2 states have (on average 130.0) internal successors, (260), 2 states have internal predecessors, (260), 0 states have call successors, (0), 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:45:00,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:00,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 250 [2023-11-19 07:45:00,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:03,179 INFO L124 PetriNetUnfolderBase]: 11556/18528 cut-off events. [2023-11-19 07:45:03,180 INFO L125 PetriNetUnfolderBase]: For 3526/3526 co-relation queries the response was YES. [2023-11-19 07:45:03,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33922 conditions, 18528 events. 11556/18528 cut-off events. For 3526/3526 co-relation queries the response was YES. Maximal size of possible extension queue 965. Compared 142431 event pairs, 8553 based on Foata normal form. 2485/18591 useless extension candidates. Maximal degree in co-relation 4540. Up to 14148 conditions per place. [2023-11-19 07:45:03,364 INFO L140 encePairwiseOnDemand]: 241/250 looper letters, 29 selfloop transitions, 0 changer transitions 0/61 dead transitions. [2023-11-19 07:45:03,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 61 transitions, 208 flow [2023-11-19 07:45:03,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:45:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:45:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 290 transitions. [2023-11-19 07:45:03,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.58 [2023-11-19 07:45:03,368 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 290 transitions. [2023-11-19 07:45:03,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 290 transitions. [2023-11-19 07:45:03,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:03,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 290 transitions. [2023-11-19 07:45:03,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.0) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 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:45:03,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 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:45:03,371 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 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:45:03,372 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 168 flow. Second operand 2 states and 290 transitions. [2023-11-19 07:45:03,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 61 transitions, 208 flow [2023-11-19 07:45:03,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 202 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-19 07:45:03,380 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 144 flow [2023-11-19 07:45:03,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2023-11-19 07:45:03,383 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -4 predicate places. [2023-11-19 07:45:03,383 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 144 flow [2023-11-19 07:45:03,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.0) internal successors, (260), 2 states have internal predecessors, (260), 0 states have call successors, (0), 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:45:03,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:03,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:03,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:45:03,387 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 07:45:03,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:03,387 INFO L85 PathProgramCache]: Analyzing trace with hash 631421363, now seen corresponding path program 1 times [2023-11-19 07:45:03,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:03,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63355536] [2023-11-19 07:45:03,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:03,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:03,459 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:45:03,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:03,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63355536] [2023-11-19 07:45:03,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63355536] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:03,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:03,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:45:03,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43368618] [2023-11-19 07:45:03,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:03,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:45:03,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:03,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:45:03,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:45:03,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 250 [2023-11-19 07:45:03,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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:45:03,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:03,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 250 [2023-11-19 07:45:03,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:07,540 INFO L124 PetriNetUnfolderBase]: 28950/42340 cut-off events. [2023-11-19 07:45:07,540 INFO L125 PetriNetUnfolderBase]: For 2130/2130 co-relation queries the response was YES. [2023-11-19 07:45:07,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79971 conditions, 42340 events. 28950/42340 cut-off events. For 2130/2130 co-relation queries the response was YES. Maximal size of possible extension queue 1915. Compared 313309 event pairs, 6794 based on Foata normal form. 1481/39757 useless extension candidates. Maximal degree in co-relation 79964. Up to 29389 conditions per place. [2023-11-19 07:45:07,846 INFO L140 encePairwiseOnDemand]: 241/250 looper letters, 59 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2023-11-19 07:45:07,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 341 flow [2023-11-19 07:45:07,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:45:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:45:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-11-19 07:45:07,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5586666666666666 [2023-11-19 07:45:07,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-11-19 07:45:07,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-11-19 07:45:07,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:07,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-11-19 07:45:07,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 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:45:07,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 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:45:07,854 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 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:45:07,854 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 144 flow. Second operand 3 states and 419 transitions. [2023-11-19 07:45:07,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 88 transitions, 341 flow [2023-11-19 07:45:07,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 88 transitions, 341 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:45:07,860 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 183 flow [2023-11-19 07:45:07,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2023-11-19 07:45:07,862 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -1 predicate places. [2023-11-19 07:45:07,862 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 183 flow [2023-11-19 07:45:07,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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:45:07,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:07,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:07,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:45:07,863 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-19 07:45:07,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:07,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1901761162, now seen corresponding path program 1 times [2023-11-19 07:45:07,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:07,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860923394] [2023-11-19 07:45:07,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:07,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:07,981 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:45:07,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:07,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860923394] [2023-11-19 07:45:07,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860923394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:07,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:07,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:07,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146025008] [2023-11-19 07:45:07,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:07,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:07,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:07,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:07,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:08,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 250 [2023-11-19 07:45:08,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 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:45:08,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:08,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 250 [2023-11-19 07:45:08,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:11,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 146#true, 24#L699-3true, 42#L709-5true, 26#L699-3true, 143#true, Black: 148#(= ~COND~0 0), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 153#(= ~count~0 0)]) [2023-11-19 07:45:11,564 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2023-11-19 07:45:11,564 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-11-19 07:45:11,564 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-19 07:45:11,565 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-19 07:45:13,554 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [146#true, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 24#L699-3true, 26#L699-3true, 143#true, 44#L709-4true, Black: 148#(= ~COND~0 0), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 153#(= ~count~0 0)]) [2023-11-19 07:45:13,554 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2023-11-19 07:45:13,554 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-19 07:45:13,554 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-11-19 07:45:13,555 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-19 07:45:13,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [42#L709-5true, 24#L699-3true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), 95#$Ultimate##0true, thr1Thread4of4ForFork0InUse, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 146#true, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:13,627 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 07:45:13,627 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:45:13,628 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:45:13,628 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:45:14,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, 88#$Ultimate##0true, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 146#true, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:14,429 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2023-11-19 07:45:14,429 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-19 07:45:14,430 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-19 07:45:14,430 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-19 07:45:14,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [42#L709-5true, 24#L699-3true, 26#L699-3true, thr1Thread1of4ForFork0InUse, 41#L692-1true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 146#true, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:14,495 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-19 07:45:14,496 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:45:14,496 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:45:14,496 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:45:14,814 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 66#$Ultimate##0true, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:14,814 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 07:45:14,814 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:45:14,815 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:45:14,815 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:45:14,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [42#L709-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 119#$Ultimate##0true, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:14,918 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2023-11-19 07:45:14,918 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-19 07:45:14,918 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-19 07:45:14,943 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-19 07:45:15,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 146#true, 143#true, Black: 148#(= ~COND~0 0), 22#L692-1true]) [2023-11-19 07:45:15,385 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2023-11-19 07:45:15,385 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-11-19 07:45:15,385 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-19 07:45:15,385 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-11-19 07:45:15,451 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [42#L709-5true, 24#L699-3true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 91#L693-1true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:15,451 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-19 07:45:15,451 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:45:15,451 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:15,451 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:45:15,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 49#L692-1true]) [2023-11-19 07:45:15,766 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-19 07:45:15,766 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:45:15,766 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:45:15,766 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:45:15,815 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [42#L709-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 89#L692-1true]) [2023-11-19 07:45:15,816 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2023-11-19 07:45:15,816 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-19 07:45:15,816 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-11-19 07:45:15,816 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-11-19 07:45:15,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][133], [130#L693-1true, 42#L709-5true, thr1Thread1of4ForFork0InUse, 157#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post2#1| 0)), thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:15,816 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-19 07:45:15,817 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:15,817 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:15,817 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:45:16,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [24#L699-3true, 26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), 95#$Ultimate##0true, thr1Thread4of4ForFork0InUse, 146#true, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:16,214 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-19 07:45:16,214 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:45:16,215 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:16,215 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:45:16,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][72], [42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), thr1Thread4of4ForFork0InUse, 146#true, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 126#L697true]) [2023-11-19 07:45:16,280 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-19 07:45:16,281 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:45:16,281 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:16,281 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:16,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][72], [42#L709-5true, 24#L699-3true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 146#true, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:16,284 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-19 07:45:16,284 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:16,284 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:16,285 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:16,303 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([816] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][72], [42#L709-5true, 24#L699-3true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), thr1Thread4of4ForFork0InUse, 146#true, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:16,303 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-19 07:45:16,303 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:16,303 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:45:16,303 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:16,303 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:16,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 125#L693-1true, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 146#true, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:16,330 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is not cut-off event [2023-11-19 07:45:16,331 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-19 07:45:16,331 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-19 07:45:16,331 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-11-19 07:45:16,449 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [111#L693-1true, 42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:16,450 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-19 07:45:16,450 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:45:16,450 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:45:16,450 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:16,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][141], [42#L709-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, 109#L694true, thr1Thread3of4ForFork0InUse, 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:16,471 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-19 07:45:16,471 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:16,471 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:45:16,471 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:45:16,483 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [130#L693-1true, 42#L709-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:16,483 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is not cut-off event [2023-11-19 07:45:16,483 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-11-19 07:45:16,483 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-19 07:45:16,483 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-19 07:45:16,582 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, 88#$Ultimate##0true, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:16,582 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-11-19 07:45:16,582 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-19 07:45:16,582 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:16,582 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:16,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [24#L699-3true, 26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, 41#L692-1true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:16,678 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-19 07:45:16,678 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:45:16,678 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:45:16,678 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:16,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, 66#$Ultimate##0true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:16,789 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-19 07:45:16,789 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:16,789 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:16,789 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:45:17,158 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 119#$Ultimate##0true, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:17,158 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-11-19 07:45:17,158 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-19 07:45:17,159 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,159 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,218 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([816] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][72], [42#L709-5true, 24#L699-3true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), thr1Thread4of4ForFork0InUse, 146#true, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:17,218 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-19 07:45:17,218 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:17,219 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:45:17,219 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:45:17,219 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:17,219 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:17,219 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][72], [24#L699-3true, 42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 118#L697true, thr1Thread4of4ForFork0InUse, 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 146#true, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:17,219 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-19 07:45:17,219 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:17,220 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:45:17,220 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:17,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [42#L709-5true, 24#L699-3true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 146#true, 143#true, Black: 148#(= ~COND~0 0), 7#L693-2true]) [2023-11-19 07:45:17,248 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-11-19 07:45:17,248 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,248 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,248 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-19 07:45:17,252 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 146#true, 143#true, Black: 148#(= ~COND~0 0), 78#L693-2true]) [2023-11-19 07:45:17,252 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-11-19 07:45:17,252 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,253 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-19 07:45:17,253 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [42#L709-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, 109#L694true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:17,307 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-11-19 07:45:17,307 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,307 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-19 07:45:17,307 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:17,338 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-19 07:45:17,338 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:17,338 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,339 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, 3#L693-2true, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:17,343 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-19 07:45:17,343 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:17,343 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:17,343 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:45:17,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([768] L697-->L699-3: Formula: (= v_~count~0_4 0) InVars {} OutVars{~count~0=v_~count~0_4} AuxVars[] AssignedVars[~count~0][148], [42#L709-5true, 24#L699-3true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:17,361 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-19 07:45:17,361 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,361 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:45:17,361 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,457 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 22#L692-1true]) [2023-11-19 07:45:17,457 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,457 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,457 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,457 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [24#L699-3true, 26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 91#L693-1true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 146#true, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:17,514 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-19 07:45:17,514 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,514 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:17,514 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,566 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 49#L692-1true]) [2023-11-19 07:45:17,567 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,567 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:45:17,567 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,567 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:45:17,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 89#L692-1true]) [2023-11-19 07:45:17,601 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,601 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,601 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,601 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][133], [130#L693-1true, 44#L709-4true, thr1Thread1of4ForFork0InUse, 157#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post2#1| 0)), thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:17,602 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,602 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:17,602 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:17,602 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,673 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([768] L697-->L699-3: Formula: (= v_~count~0_4 0) InVars {} OutVars{~count~0=v_~count~0_4} AuxVars[] AssignedVars[~count~0][148], [42#L709-5true, 24#L699-3true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:17,673 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,673 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,674 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,674 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,674 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,684 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [42#L709-5true, 24#L699-3true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 146#true, 143#true, Black: 148#(= ~COND~0 0), 76#L699-2true]) [2023-11-19 07:45:17,684 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,684 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,684 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,684 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,685 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [24#L699-3true, 42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 146#true, 143#true, Black: 148#(= ~COND~0 0), 23#L695true]) [2023-11-19 07:45:17,685 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,685 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,685 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,685 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 146#true, 143#true, 90#L695true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:17,686 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,686 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,686 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,686 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 69#L699-2true, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:17,687 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,687 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,687 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,688 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,712 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [42#L709-5true, thr1Thread1of4ForFork0InUse, 79#L695true, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:17,712 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,712 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,712 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,712 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-19 07:45:17,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [42#L709-5true, 26#L699-3true, 83#L695true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:17,719 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,719 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,719 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:45:17,719 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:45:17,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), 97#L699-2true, thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:17,727 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,727 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:45:17,727 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,727 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:45:17,734 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([839] L695-->L697: Formula: (= v_~COND~0_1 1) InVars {} OutVars{~COND~0=v_~COND~0_1} AuxVars[] AssignedVars[~COND~0][92], [24#L699-3true, 42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 151#true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 146#true, 143#true, Black: 148#(= ~COND~0 0), 28#L697true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-11-19 07:45:17,734 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,734 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,734 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,734 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][93], [24#L699-3true, 42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 151#true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 146#true, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-11-19 07:45:17,735 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,735 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,735 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,735 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,794 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][72], [26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 146#true, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 126#L697true]) [2023-11-19 07:45:17,794 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-19 07:45:17,795 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:17,795 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,795 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:17,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][72], [24#L699-3true, 26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), thr1Thread4of4ForFork0InUse, 146#true, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:17,798 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-19 07:45:17,798 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:17,798 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:17,799 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:17,812 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([816] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][72], [24#L699-3true, 26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 146#true, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:17,813 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-19 07:45:17,813 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:17,813 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:17,813 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:17,813 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:17,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 125#L693-1true, 146#true, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:17,837 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,837 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-11-19 07:45:17,837 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-11-19 07:45:17,837 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,953 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [111#L693-1true, 26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:17,953 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-19 07:45:17,954 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,954 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:17,954 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:17,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][141], [44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 109#L694true, thr1Thread4of4ForFork0InUse, 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:17,973 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-19 07:45:17,973 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:17,973 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:17,973 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:17,981 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [130#L693-1true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:17,982 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,982 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:17,982 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-11-19 07:45:17,982 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-11-19 07:45:18,037 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][72], [42#L709-5true, 24#L699-3true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 146#true, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-11-19 07:45:18,038 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-19 07:45:18,038 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:18,038 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:18,038 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:18,056 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:18,056 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-19 07:45:18,056 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:18,056 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:18,056 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:18,056 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:18,057 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:18,057 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is not cut-off event [2023-11-19 07:45:18,058 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-11-19 07:45:18,058 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-11-19 07:45:18,058 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-11-19 07:45:18,058 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:18,058 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:18,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 118#L697true, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:18,059 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is not cut-off event [2023-11-19 07:45:18,059 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:18,059 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-11-19 07:45:18,059 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-11-19 07:45:18,079 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [42#L709-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 45#L697true]) [2023-11-19 07:45:18,079 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is not cut-off event [2023-11-19 07:45:18,079 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:18,079 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-11-19 07:45:18,080 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-11-19 07:45:18,097 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-11-19 07:45:18,097 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,097 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,097 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,097 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,098 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [42#L709-5true, 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-11-19 07:45:18,098 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,098 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,098 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,098 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,099 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,447 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([816] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][72], [24#L699-3true, 26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), thr1Thread4of4ForFork0InUse, 146#true, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:18,447 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,448 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,448 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:18,448 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:18,448 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,448 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:18,449 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][72], [24#L699-3true, 26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 118#L697true, 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), thr1Thread4of4ForFork0InUse, 146#true, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:18,449 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,449 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:18,449 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 07:45:18,450 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:18,484 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [24#L699-3true, 26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 7#L693-2true]) [2023-11-19 07:45:18,484 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-11-19 07:45:18,484 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,484 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-11-19 07:45:18,484 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 78#L693-2true]) [2023-11-19 07:45:18,488 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-11-19 07:45:18,488 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-11-19 07:45:18,488 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,488 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,524 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, 109#L694true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:18,525 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-11-19 07:45:18,525 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,525 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,525 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-11-19 07:45:18,548 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:18,548 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-19 07:45:18,548 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,548 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 07:45:18,548 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, 3#L693-2true, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:18,551 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,551 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:18,551 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 07:45:18,552 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([768] L697-->L699-3: Formula: (= v_~count~0_4 0) InVars {} OutVars{~count~0=v_~count~0_4} AuxVars[] AssignedVars[~count~0][148], [24#L699-3true, 26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:18,562 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,562 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,562 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,562 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,600 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [42#L709-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 55#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-11-19 07:45:18,601 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,601 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,601 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,601 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,703 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([768] L697-->L699-3: Formula: (= v_~count~0_4 0) InVars {} OutVars{~count~0=v_~count~0_4} AuxVars[] AssignedVars[~count~0][148], [24#L699-3true, 26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:18,703 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,703 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,703 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,703 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,703 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [24#L699-3true, 26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 76#L699-2true]) [2023-11-19 07:45:18,712 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,712 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,712 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,712 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,712 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [24#L699-3true, 26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 23#L695true]) [2023-11-19 07:45:18,713 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,713 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,713 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,713 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,713 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 146#true, 143#true, 90#L695true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:18,713 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,713 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,713 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,714 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,715 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_11|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_17|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1][62], [26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 69#L699-2true, 57#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 146#true, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:18,715 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,715 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,715 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,715 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [44#L709-4true, thr1Thread1of4ForFork0InUse, 79#L695true, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:18,736 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,736 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,736 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,736 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [26#L699-3true, 83#L695true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:18,741 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,741 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,741 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,741 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 97#L699-2true, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0)]) [2023-11-19 07:45:18,748 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,748 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,749 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,749 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 07:45:18,755 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([839] L695-->L697: Formula: (= v_~COND~0_1 1) InVars {} OutVars{~COND~0=v_~COND~0_1} AuxVars[] AssignedVars[~COND~0][92], [24#L699-3true, 26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 151#true, thr1Thread4of4ForFork0InUse, 146#true, 143#true, Black: 148#(= ~COND~0 0), 28#L697true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-11-19 07:45:18,756 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,756 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,756 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,756 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,757 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][93], [24#L699-3true, 26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 151#true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 146#true, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-11-19 07:45:18,757 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,757 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,757 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,757 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,775 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [42#L709-5true, 110#L699-2true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:18,775 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,775 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,775 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,775 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-11-19 07:45:18,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][72], [24#L699-3true, 26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), thr1Thread4of4ForFork0InUse, 146#true, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-11-19 07:45:18,818 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-19 07:45:18,818 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,818 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,818 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,832 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:18,832 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-19 07:45:18,832 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,832 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 07:45:18,832 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 07:45:18,832 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 07:45:18,833 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:18,833 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,833 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,833 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-11-19 07:45:18,833 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-11-19 07:45:18,833 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-11-19 07:45:18,834 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,834 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), 118#L697true, thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:18,834 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,834 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,834 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-11-19 07:45:18,834 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-11-19 07:45:18,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 45#L697true]) [2023-11-19 07:45:18,848 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,848 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-11-19 07:45:18,848 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,849 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-19 07:45:18,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-11-19 07:45:18,860 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-19 07:45:18,860 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 07:45:18,860 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 07:45:18,860 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 07:45:18,860 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [26#L699-3true, 44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-11-19 07:45:18,860 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-19 07:45:18,861 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 07:45:18,861 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 07:45:18,861 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 07:45:18,861 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 07:45:18,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [44#L709-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 55#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-11-19 07:45:18,895 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-19 07:45:18,895 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 07:45:18,895 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 07:45:18,896 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 07:45:18,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][119], [44#L709-4true, 110#L699-2true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 146#true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true]) [2023-11-19 07:45:18,925 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-11-19 07:45:18,925 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-11-19 07:45:18,925 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-11-19 07:45:18,925 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-11-19 07:45:18,953 INFO L124 PetriNetUnfolderBase]: 71202/112039 cut-off events. [2023-11-19 07:45:18,953 INFO L125 PetriNetUnfolderBase]: For 4681/4681 co-relation queries the response was YES. [2023-11-19 07:45:19,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212468 conditions, 112039 events. 71202/112039 cut-off events. For 4681/4681 co-relation queries the response was YES. Maximal size of possible extension queue 6317. Compared 1049663 event pairs, 18086 based on Foata normal form. 2062/105856 useless extension candidates. Maximal degree in co-relation 212459. Up to 36896 conditions per place. [2023-11-19 07:45:19,928 INFO L140 encePairwiseOnDemand]: 236/250 looper letters, 124 selfloop transitions, 24 changer transitions 0/176 dead transitions. [2023-11-19 07:45:19,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 176 transitions, 751 flow [2023-11-19 07:45:19,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:45:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:45:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 813 transitions. [2023-11-19 07:45:19,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.542 [2023-11-19 07:45:19,934 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 813 transitions. [2023-11-19 07:45:19,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 813 transitions. [2023-11-19 07:45:19,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:19,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 813 transitions. [2023-11-19 07:45:19,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 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:45:20,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 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:45:20,167 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 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:45:20,167 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 183 flow. Second operand 6 states and 813 transitions. [2023-11-19 07:45:20,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 176 transitions, 751 flow [2023-11-19 07:45:20,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 176 transitions, 746 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:45:20,221 INFO L231 Difference]: Finished difference. Result has 74 places, 94 transitions, 377 flow [2023-11-19 07:45:20,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=377, PETRI_PLACES=74, PETRI_TRANSITIONS=94} [2023-11-19 07:45:20,222 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 7 predicate places. [2023-11-19 07:45:20,222 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 94 transitions, 377 flow [2023-11-19 07:45:20,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 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:45:20,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:20,223 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:20,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:45:20,223 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-19 07:45:20,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:20,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1162003827, now seen corresponding path program 1 times [2023-11-19 07:45:20,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:20,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218395365] [2023-11-19 07:45:20,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:20,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:45:20,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:20,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218395365] [2023-11-19 07:45:20,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218395365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:20,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:20,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:20,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887893726] [2023-11-19 07:45:20,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:20,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:20,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:20,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:20,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:20,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 250 [2023-11-19 07:45:20,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 94 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 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:45:20,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:20,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 250 [2023-11-19 07:45:20,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:29,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][141], [Black: 151#true, 42#L709-5true, Black: 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, 66#$Ultimate##0true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 165#(= ~count~0 0), Black: 157#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post2#1| 0))]) [2023-11-19 07:45:29,998 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 07:45:29,999 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:45:29,999 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:45:29,999 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:45:30,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][141], [Black: 151#true, Black: 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 42#L709-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 119#$Ultimate##0true, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 165#(= ~count~0 0), Black: 157#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post2#1| 0))]) [2023-11-19 07:45:30,157 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 07:45:30,157 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:45:30,157 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:45:30,157 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:45:31,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][141], [Black: 151#true, 42#L709-5true, Black: 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, 49#L692-1true, Black: 148#(= ~COND~0 0), 165#(= ~count~0 0), Black: 157#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post2#1| 0))]) [2023-11-19 07:45:31,377 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-19 07:45:31,377 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:45:31,378 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:45:31,378 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:45:31,378 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][164], [Black: 151#true, 111#L693-1true, 42#L709-5true, Black: 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 26#L699-3true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 169#(and (= ~count~0 0) (= |thr1Thread2of4ForFork0_Barrier2_#t~post2#1| 0)), Black: 157#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post2#1| 0))]) [2023-11-19 07:45:31,378 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-19 07:45:31,378 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:45:31,378 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:45:31,378 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:31,489 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][141], [Black: 151#true, 42#L709-5true, Black: 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, 153#(= ~count~0 0), thr1Thread4of4ForFork0InUse, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 165#(= ~count~0 0), 89#L692-1true, Black: 157#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post2#1| 0))]) [2023-11-19 07:45:31,489 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-19 07:45:31,489 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:45:31,489 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:45:31,489 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:45:31,489 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L691-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_13|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_15|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1][141], [130#L693-1true, Black: 151#true, Black: 153#(= ~count~0 0), 42#L709-5true, Black: 155#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), thr1Thread1of4ForFork0InUse, 157#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post2#1| 0)), thr1Thread2of4ForFork0InUse, 133#L699-3true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 34#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 143#true, Black: 148#(= ~COND~0 0), 67#L699-3true, 165#(= ~count~0 0)]) [2023-11-19 07:45:31,489 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-19 07:45:31,489 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:45:31,489 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:45:31,490 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event