./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 29fee1864b0d56497c32cb33e6aaa24ed5707e21c5b89ec418c6707c5ac52336 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:30:04,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:30:04,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:30:04,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:30:04,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:30:04,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:30:04,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:30:04,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:30:04,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:30:04,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:30:04,120 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:30:04,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:30:04,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:30:04,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:30:04,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:30:04,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:30:04,128 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:30:04,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:30:04,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:30:04,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:30:04,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:30:04,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:30:04,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:30:04,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:30:04,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:30:04,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:30:04,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:30:04,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:30:04,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:30:04,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:30:04,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:30:04,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:30:04,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:30:04,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:30:04,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:30:04,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:30:04,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:30:04,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:30:04,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:30:04,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:30:04,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:30:04,158 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:30:04,186 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:30:04,196 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:30:04,198 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:30:04,198 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:30:04,199 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:30:04,200 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:30:04,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:30:04,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:30:04,201 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:30:04,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:30:04,203 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:30:04,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:30:04,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:30:04,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:30:04,204 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:30:04,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:30:04,204 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:30:04,204 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:30:04,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:30:04,205 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:30:04,205 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:30:04,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:30:04,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:30:04,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:30:04,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:30:04,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:30:04,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:30:04,207 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:30:04,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:30:04,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:30:04,207 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:30:04,208 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:30:04,208 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:30:04,208 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/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_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 29fee1864b0d56497c32cb33e6aaa24ed5707e21c5b89ec418c6707c5ac52336 [2022-11-20 11:30:04,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:30:04,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:30:04,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:30:04,539 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:30:04,540 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:30:04,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2022-11-20 11:30:07,711 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:30:07,916 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:30:07,917 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2022-11-20 11:30:07,933 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/data/0ac983dff/c51af8e7dca44c10b73ba50ad437d2e9/FLAGca6f8f8ae [2022-11-20 11:30:07,950 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/data/0ac983dff/c51af8e7dca44c10b73ba50ad437d2e9 [2022-11-20 11:30:07,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:30:07,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:30:07,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:30:07,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:30:07,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:30:07,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:30:07" (1/1) ... [2022-11-20 11:30:07,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf9f5db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:07, skipping insertion in model container [2022-11-20 11:30:07,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:30:07" (1/1) ... [2022-11-20 11:30:07,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:30:08,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:30:08,202 WARN L237 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_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c[4380,4393] [2022-11-20 11:30:08,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:30:08,230 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:30:08,267 WARN L237 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_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c[4380,4393] [2022-11-20 11:30:08,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:30:08,290 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:30:08,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:08 WrapperNode [2022-11-20 11:30:08,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:30:08,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:30:08,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:30:08,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:30:08,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:08" (1/1) ... [2022-11-20 11:30:08,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:08" (1/1) ... [2022-11-20 11:30:08,351 INFO L138 Inliner]: procedures = 28, calls = 80, calls flagged for inlining = 26, calls inlined = 32, statements flattened = 393 [2022-11-20 11:30:08,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:30:08,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:30:08,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:30:08,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:30:08,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:08" (1/1) ... [2022-11-20 11:30:08,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:08" (1/1) ... [2022-11-20 11:30:08,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:08" (1/1) ... [2022-11-20 11:30:08,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:08" (1/1) ... [2022-11-20 11:30:08,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:08" (1/1) ... [2022-11-20 11:30:08,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:08" (1/1) ... [2022-11-20 11:30:08,405 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:08" (1/1) ... [2022-11-20 11:30:08,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:08" (1/1) ... [2022-11-20 11:30:08,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:30:08,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:30:08,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:30:08,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:30:08,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:08" (1/1) ... [2022-11-20 11:30:08,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:30:08,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:30:08,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:30:08,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:30:08,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:30:08,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 11:30:08,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:30:08,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:30:08,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:30:08,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 11:30:08,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 11:30:08,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 11:30:08,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 11:30:08,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 11:30:08,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-20 11:30:08,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-20 11:30:08,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:30:08,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 11:30:08,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 11:30:08,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:30:08,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:30:08,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:30:08,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:30:08,510 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 11:30:08,705 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:30:08,707 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:30:09,487 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:30:09,633 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:30:09,633 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-20 11:30:09,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:30:09 BoogieIcfgContainer [2022-11-20 11:30:09,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:30:09,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:30:09,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:30:09,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:30:09,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:30:07" (1/3) ... [2022-11-20 11:30:09,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe11f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:30:09, skipping insertion in model container [2022-11-20 11:30:09,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:30:08" (2/3) ... [2022-11-20 11:30:09,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe11f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:30:09, skipping insertion in model container [2022-11-20 11:30:09,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:30:09" (3/3) ... [2022-11-20 11:30:09,646 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2022-11-20 11:30:09,659 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 11:30:09,669 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:30:09,669 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 11:30:09,669 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 11:30:09,777 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 11:30:09,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 387 places, 414 transitions, 852 flow [2022-11-20 11:30:10,078 INFO L130 PetriNetUnfolder]: 37/411 cut-off events. [2022-11-20 11:30:10,083 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 11:30:10,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 411 events. 37/411 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 426 event pairs, 0 based on Foata normal form. 0/373 useless extension candidates. Maximal degree in co-relation 324. Up to 2 conditions per place. [2022-11-20 11:30:10,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 387 places, 414 transitions, 852 flow [2022-11-20 11:30:10,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 373 places, 400 transitions, 818 flow [2022-11-20 11:30:10,127 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:30:10,137 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@93cc377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:30:10,138 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-20 11:30:10,242 INFO L130 PetriNetUnfolder]: 35/380 cut-off events. [2022-11-20 11:30:10,243 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 11:30:10,243 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:30:10,245 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:30:10,246 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 11:30:10,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:10,256 INFO L85 PathProgramCache]: Analyzing trace with hash 383296136, now seen corresponding path program 1 times [2022-11-20 11:30:10,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:10,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276914721] [2022-11-20 11:30:10,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:10,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:30:10,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:10,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276914721] [2022-11-20 11:30:10,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276914721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:10,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:10,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:30:10,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860041113] [2022-11-20 11:30:10,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:10,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 11:30:10,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:10,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 11:30:10,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:30:10,798 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 414 [2022-11-20 11:30:10,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 400 transitions, 818 flow. Second operand has 2 states, 2 states have (on average 384.0) internal successors, (768), 2 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:30:10,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:30:10,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 414 [2022-11-20 11:30:10,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:30:10,978 INFO L130 PetriNetUnfolder]: 25/439 cut-off events. [2022-11-20 11:30:10,978 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-11-20 11:30:10,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 439 events. 25/439 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 807 event pairs, 7 based on Foata normal form. 51/449 useless extension candidates. Maximal degree in co-relation 342. Up to 31 conditions per place. [2022-11-20 11:30:10,986 INFO L137 encePairwiseOnDemand]: 387/414 looper letters, 9 selfloop transitions, 0 changer transitions 13/373 dead transitions. [2022-11-20 11:30:10,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 373 transitions, 782 flow [2022-11-20 11:30:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 11:30:10,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-20 11:30:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 790 transitions. [2022-11-20 11:30:11,012 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9541062801932367 [2022-11-20 11:30:11,013 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 790 transitions. [2022-11-20 11:30:11,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 790 transitions. [2022-11-20 11:30:11,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:30:11,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 790 transitions. [2022-11-20 11:30:11,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 395.0) internal successors, (790), 2 states have internal predecessors, (790), 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) [2022-11-20 11:30:11,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 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) [2022-11-20 11:30:11,044 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 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) [2022-11-20 11:30:11,046 INFO L175 Difference]: Start difference. First operand has 373 places, 400 transitions, 818 flow. Second operand 2 states and 790 transitions. [2022-11-20 11:30:11,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 373 transitions, 782 flow [2022-11-20 11:30:11,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 373 transitions, 770 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-20 11:30:11,068 INFO L231 Difference]: Finished difference. Result has 368 places, 360 transitions, 726 flow [2022-11-20 11:30:11,071 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=726, PETRI_PLACES=368, PETRI_TRANSITIONS=360} [2022-11-20 11:30:11,078 INFO L288 CegarLoopForPetriNet]: 373 programPoint places, -5 predicate places. [2022-11-20 11:30:11,078 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 360 transitions, 726 flow [2022-11-20 11:30:11,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 384.0) internal successors, (768), 2 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:30:11,079 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:30:11,080 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:30:11,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:30:11,081 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 11:30:11,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:11,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2065661086, now seen corresponding path program 1 times [2022-11-20 11:30:11,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:11,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415014797] [2022-11-20 11:30:11,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:11,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:11,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:30:11,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:11,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415014797] [2022-11-20 11:30:11,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415014797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:11,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:11,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:30:11,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483101153] [2022-11-20 11:30:11,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:11,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:30:11,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:11,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:30:11,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:30:11,944 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 414 [2022-11-20 11:30:11,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 360 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 375.6666666666667) internal successors, (1127), 3 states have internal predecessors, (1127), 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) [2022-11-20 11:30:11,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:30:11,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 414 [2022-11-20 11:30:11,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:30:12,327 INFO L130 PetriNetUnfolder]: 100/1156 cut-off events. [2022-11-20 11:30:12,328 INFO L131 PetriNetUnfolder]: For 21/23 co-relation queries the response was YES. [2022-11-20 11:30:12,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 1156 events. 100/1156 cut-off events. For 21/23 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4742 event pairs, 15 based on Foata normal form. 0/1049 useless extension candidates. Maximal degree in co-relation 1285. Up to 72 conditions per place. [2022-11-20 11:30:12,337 INFO L137 encePairwiseOnDemand]: 411/414 looper letters, 18 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2022-11-20 11:30:12,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 367 transitions, 782 flow [2022-11-20 11:30:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:30:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:30:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1140 transitions. [2022-11-20 11:30:12,341 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9178743961352657 [2022-11-20 11:30:12,341 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1140 transitions. [2022-11-20 11:30:12,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1140 transitions. [2022-11-20 11:30:12,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:30:12,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1140 transitions. [2022-11-20 11:30:12,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 380.0) internal successors, (1140), 3 states have internal predecessors, (1140), 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) [2022-11-20 11:30:12,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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) [2022-11-20 11:30:12,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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) [2022-11-20 11:30:12,378 INFO L175 Difference]: Start difference. First operand has 368 places, 360 transitions, 726 flow. Second operand 3 states and 1140 transitions. [2022-11-20 11:30:12,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 367 transitions, 782 flow [2022-11-20 11:30:12,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 367 transitions, 782 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 11:30:12,391 INFO L231 Difference]: Finished difference. Result has 358 places, 361 transitions, 738 flow [2022-11-20 11:30:12,392 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=358, PETRI_TRANSITIONS=361} [2022-11-20 11:30:12,392 INFO L288 CegarLoopForPetriNet]: 373 programPoint places, -15 predicate places. [2022-11-20 11:30:12,393 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 361 transitions, 738 flow [2022-11-20 11:30:12,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.6666666666667) internal successors, (1127), 3 states have internal predecessors, (1127), 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) [2022-11-20 11:30:12,394 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:30:12,394 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:30:12,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:30:12,395 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 11:30:12,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:12,396 INFO L85 PathProgramCache]: Analyzing trace with hash 696268907, now seen corresponding path program 1 times [2022-11-20 11:30:12,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:12,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228570047] [2022-11-20 11:30:12,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:12,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:30:12,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:12,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228570047] [2022-11-20 11:30:12,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228570047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:12,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:12,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:30:12,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460935641] [2022-11-20 11:30:12,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:12,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:30:12,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:12,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:30:12,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:30:12,959 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 414 [2022-11-20 11:30:12,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 361 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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) [2022-11-20 11:30:12,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:30:12,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 414 [2022-11-20 11:30:12,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:30:13,212 INFO L130 PetriNetUnfolder]: 83/651 cut-off events. [2022-11-20 11:30:13,214 INFO L131 PetriNetUnfolder]: For 6/30 co-relation queries the response was YES. [2022-11-20 11:30:13,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 651 events. 83/651 cut-off events. For 6/30 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1916 event pairs, 18 based on Foata normal form. 1/599 useless extension candidates. Maximal degree in co-relation 814. Up to 84 conditions per place. [2022-11-20 11:30:13,224 INFO L137 encePairwiseOnDemand]: 411/414 looper letters, 20 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2022-11-20 11:30:13,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 369 transitions, 800 flow [2022-11-20 11:30:13,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:30:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:30:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1139 transitions. [2022-11-20 11:30:13,230 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9170692431561996 [2022-11-20 11:30:13,231 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1139 transitions. [2022-11-20 11:30:13,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1139 transitions. [2022-11-20 11:30:13,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:30:13,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1139 transitions. [2022-11-20 11:30:13,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.6666666666667) internal successors, (1139), 3 states have internal predecessors, (1139), 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) [2022-11-20 11:30:13,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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) [2022-11-20 11:30:13,241 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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) [2022-11-20 11:30:13,241 INFO L175 Difference]: Start difference. First operand has 358 places, 361 transitions, 738 flow. Second operand 3 states and 1139 transitions. [2022-11-20 11:30:13,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 369 transitions, 800 flow [2022-11-20 11:30:13,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 369 transitions, 798 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 11:30:13,251 INFO L231 Difference]: Finished difference. Result has 360 places, 362 transitions, 748 flow [2022-11-20 11:30:13,252 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=360, PETRI_TRANSITIONS=362} [2022-11-20 11:30:13,255 INFO L288 CegarLoopForPetriNet]: 373 programPoint places, -13 predicate places. [2022-11-20 11:30:13,256 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 362 transitions, 748 flow [2022-11-20 11:30:13,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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) [2022-11-20 11:30:13,257 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:30:13,257 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:30:13,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:30:13,258 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 11:30:13,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:13,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1249931543, now seen corresponding path program 1 times [2022-11-20 11:30:13,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:13,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064312428] [2022-11-20 11:30:13,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:13,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:13,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:30:13,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:13,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064312428] [2022-11-20 11:30:13,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064312428] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:13,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:13,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:30:13,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842153263] [2022-11-20 11:30:13,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:13,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:30:13,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:13,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:30:13,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:30:13,832 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 414 [2022-11-20 11:30:13,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 362 transitions, 748 flow. Second operand has 6 states, 6 states have (on average 331.8333333333333) internal successors, (1991), 6 states have internal predecessors, (1991), 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) [2022-11-20 11:30:13,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:30:13,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 414 [2022-11-20 11:30:13,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:30:14,341 INFO L130 PetriNetUnfolder]: 97/1054 cut-off events. [2022-11-20 11:30:14,342 INFO L131 PetriNetUnfolder]: For 32/42 co-relation queries the response was YES. [2022-11-20 11:30:14,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 1054 events. 97/1054 cut-off events. For 32/42 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3998 event pairs, 48 based on Foata normal form. 9/969 useless extension candidates. Maximal degree in co-relation 1336. Up to 155 conditions per place. [2022-11-20 11:30:14,353 INFO L137 encePairwiseOnDemand]: 404/414 looper letters, 57 selfloop transitions, 8 changer transitions 42/408 dead transitions. [2022-11-20 11:30:14,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 408 transitions, 1057 flow [2022-11-20 11:30:14,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:30:14,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 11:30:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3041 transitions. [2022-11-20 11:30:14,365 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8161567364465915 [2022-11-20 11:30:14,365 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3041 transitions. [2022-11-20 11:30:14,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3041 transitions. [2022-11-20 11:30:14,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:30:14,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3041 transitions. [2022-11-20 11:30:14,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 337.8888888888889) internal successors, (3041), 9 states have internal predecessors, (3041), 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) [2022-11-20 11:30:14,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 414.0) internal successors, (4140), 10 states have internal predecessors, (4140), 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) [2022-11-20 11:30:14,387 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 414.0) internal successors, (4140), 10 states have internal predecessors, (4140), 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) [2022-11-20 11:30:14,388 INFO L175 Difference]: Start difference. First operand has 360 places, 362 transitions, 748 flow. Second operand 9 states and 3041 transitions. [2022-11-20 11:30:14,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 408 transitions, 1057 flow [2022-11-20 11:30:14,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 408 transitions, 1055 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 11:30:14,404 INFO L231 Difference]: Finished difference. Result has 369 places, 363 transitions, 774 flow [2022-11-20 11:30:14,405 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=774, PETRI_PLACES=369, PETRI_TRANSITIONS=363} [2022-11-20 11:30:14,407 INFO L288 CegarLoopForPetriNet]: 373 programPoint places, -4 predicate places. [2022-11-20 11:30:14,408 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 363 transitions, 774 flow [2022-11-20 11:30:14,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 331.8333333333333) internal successors, (1991), 6 states have internal predecessors, (1991), 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) [2022-11-20 11:30:14,410 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:30:14,410 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:30:14,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:30:14,411 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 11:30:14,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:14,411 INFO L85 PathProgramCache]: Analyzing trace with hash -628062165, now seen corresponding path program 1 times [2022-11-20 11:30:14,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:14,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064286630] [2022-11-20 11:30:14,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:14,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:30:14,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:14,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064286630] [2022-11-20 11:30:14,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064286630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:14,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:14,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:30:14,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368636624] [2022-11-20 11:30:14,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:14,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:30:14,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:14,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:30:14,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:30:14,895 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 414 [2022-11-20 11:30:14,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 363 transitions, 774 flow. Second operand has 6 states, 6 states have (on average 333.3333333333333) internal successors, (2000), 6 states have internal predecessors, (2000), 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) [2022-11-20 11:30:14,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:30:14,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 414 [2022-11-20 11:30:14,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:30:15,464 INFO L130 PetriNetUnfolder]: 79/1249 cut-off events. [2022-11-20 11:30:15,464 INFO L131 PetriNetUnfolder]: For 64/84 co-relation queries the response was YES. [2022-11-20 11:30:15,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1548 conditions, 1249 events. 79/1249 cut-off events. For 64/84 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5155 event pairs, 34 based on Foata normal form. 10/1162 useless extension candidates. Maximal degree in co-relation 1540. Up to 95 conditions per place. [2022-11-20 11:30:15,477 INFO L137 encePairwiseOnDemand]: 403/414 looper letters, 69 selfloop transitions, 8 changer transitions 21/400 dead transitions. [2022-11-20 11:30:15,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 400 transitions, 1062 flow [2022-11-20 11:30:15,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:30:15,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 11:30:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3042 transitions. [2022-11-20 11:30:15,484 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8164251207729468 [2022-11-20 11:30:15,484 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3042 transitions. [2022-11-20 11:30:15,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3042 transitions. [2022-11-20 11:30:15,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:30:15,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3042 transitions. [2022-11-20 11:30:15,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 338.0) internal successors, (3042), 9 states have internal predecessors, (3042), 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) [2022-11-20 11:30:15,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 414.0) internal successors, (4140), 10 states have internal predecessors, (4140), 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) [2022-11-20 11:30:15,503 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 414.0) internal successors, (4140), 10 states have internal predecessors, (4140), 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) [2022-11-20 11:30:15,503 INFO L175 Difference]: Start difference. First operand has 369 places, 363 transitions, 774 flow. Second operand 9 states and 3042 transitions. [2022-11-20 11:30:15,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 400 transitions, 1062 flow [2022-11-20 11:30:15,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 400 transitions, 1042 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-11-20 11:30:15,513 INFO L231 Difference]: Finished difference. Result has 375 places, 366 transitions, 808 flow [2022-11-20 11:30:15,514 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=808, PETRI_PLACES=375, PETRI_TRANSITIONS=366} [2022-11-20 11:30:15,514 INFO L288 CegarLoopForPetriNet]: 373 programPoint places, 2 predicate places. [2022-11-20 11:30:15,515 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 366 transitions, 808 flow [2022-11-20 11:30:15,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 333.3333333333333) internal successors, (2000), 6 states have internal predecessors, (2000), 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) [2022-11-20 11:30:15,516 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:30:15,516 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:30:15,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:30:15,517 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 11:30:15,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:15,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1465524326, now seen corresponding path program 1 times [2022-11-20 11:30:15,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:15,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399107248] [2022-11-20 11:30:15,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:15,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:30:16,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:16,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399107248] [2022-11-20 11:30:16,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399107248] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:30:16,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891231244] [2022-11-20 11:30:16,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:16,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:30:16,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:30:16,155 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:30:16,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:30:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:16,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:30:16,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:30:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:30:16,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:30:16,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891231244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:16,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:30:16,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-11-20 11:30:16,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422378840] [2022-11-20 11:30:16,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:16,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:30:16,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:16,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:30:16,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:30:16,615 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 414 [2022-11-20 11:30:16,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 366 transitions, 808 flow. Second operand has 5 states, 5 states have (on average 357.4) internal successors, (1787), 5 states have internal predecessors, (1787), 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) [2022-11-20 11:30:16,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:30:16,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 414 [2022-11-20 11:30:16,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:30:19,324 INFO L130 PetriNetUnfolder]: 2638/5809 cut-off events. [2022-11-20 11:30:19,325 INFO L131 PetriNetUnfolder]: For 5921/5929 co-relation queries the response was YES. [2022-11-20 11:30:19,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13709 conditions, 5809 events. 2638/5809 cut-off events. For 5921/5929 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 38436 event pairs, 1154 based on Foata normal form. 0/5454 useless extension candidates. Maximal degree in co-relation 13696. Up to 2745 conditions per place. [2022-11-20 11:30:19,395 INFO L137 encePairwiseOnDemand]: 406/414 looper letters, 30 selfloop transitions, 0 changer transitions 33/394 dead transitions. [2022-11-20 11:30:19,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 394 transitions, 1046 flow [2022-11-20 11:30:19,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:30:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 11:30:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2171 transitions. [2022-11-20 11:30:19,402 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8739935587761675 [2022-11-20 11:30:19,403 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2171 transitions. [2022-11-20 11:30:19,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2171 transitions. [2022-11-20 11:30:19,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:30:19,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2171 transitions. [2022-11-20 11:30:19,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 361.8333333333333) internal successors, (2171), 6 states have internal predecessors, (2171), 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) [2022-11-20 11:30:19,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 414.0) internal successors, (2898), 7 states have internal predecessors, (2898), 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) [2022-11-20 11:30:19,419 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 414.0) internal successors, (2898), 7 states have internal predecessors, (2898), 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) [2022-11-20 11:30:19,419 INFO L175 Difference]: Start difference. First operand has 375 places, 366 transitions, 808 flow. Second operand 6 states and 2171 transitions. [2022-11-20 11:30:19,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 394 transitions, 1046 flow [2022-11-20 11:30:19,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 394 transitions, 1034 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-20 11:30:19,435 INFO L231 Difference]: Finished difference. Result has 377 places, 361 transitions, 792 flow [2022-11-20 11:30:19,436 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=792, PETRI_PLACES=377, PETRI_TRANSITIONS=361} [2022-11-20 11:30:19,440 INFO L288 CegarLoopForPetriNet]: 373 programPoint places, 4 predicate places. [2022-11-20 11:30:19,440 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 361 transitions, 792 flow [2022-11-20 11:30:19,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 357.4) internal successors, (1787), 5 states have internal predecessors, (1787), 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) [2022-11-20 11:30:19,441 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:30:19,442 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:30:19,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:30:19,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 11:30:19,652 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 11:30:19,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:19,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1184733369, now seen corresponding path program 1 times [2022-11-20 11:30:19,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:19,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237670858] [2022-11-20 11:30:19,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:19,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:20,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:30:20,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:20,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237670858] [2022-11-20 11:30:20,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237670858] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:30:20,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459965168] [2022-11-20 11:30:20,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:20,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:30:20,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:30:20,499 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:30:20,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:30:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:20,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 11:30:20,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:30:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:30:21,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:30:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:30:23,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459965168] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 11:30:23,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:30:23,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 10] total 19 [2022-11-20 11:30:23,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725749188] [2022-11-20 11:30:23,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:23,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:30:23,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:23,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:30:23,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-11-20 11:30:23,382 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 414 [2022-11-20 11:30:23,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 361 transitions, 792 flow. Second operand has 9 states, 9 states have (on average 301.0) internal successors, (2709), 9 states have internal predecessors, (2709), 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) [2022-11-20 11:30:23,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:30:23,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 414 [2022-11-20 11:30:23,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:30:29,067 INFO L130 PetriNetUnfolder]: 6462/14448 cut-off events. [2022-11-20 11:30:29,068 INFO L131 PetriNetUnfolder]: For 11912/11920 co-relation queries the response was YES. [2022-11-20 11:30:29,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32828 conditions, 14448 events. 6462/14448 cut-off events. For 11912/11920 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 114580 event pairs, 2462 based on Foata normal form. 42/14178 useless extension candidates. Maximal degree in co-relation 32813. Up to 6394 conditions per place. [2022-11-20 11:30:29,229 INFO L137 encePairwiseOnDemand]: 393/414 looper letters, 143 selfloop transitions, 21 changer transitions 38/469 dead transitions. [2022-11-20 11:30:29,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 469 transitions, 1503 flow [2022-11-20 11:30:29,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:30:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 11:30:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3415 transitions. [2022-11-20 11:30:29,237 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7498902064119456 [2022-11-20 11:30:29,237 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3415 transitions. [2022-11-20 11:30:29,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3415 transitions. [2022-11-20 11:30:29,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:30:29,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3415 transitions. [2022-11-20 11:30:29,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 310.45454545454544) internal successors, (3415), 11 states have internal predecessors, (3415), 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) [2022-11-20 11:30:29,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 414.0) internal successors, (4968), 12 states have internal predecessors, (4968), 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) [2022-11-20 11:30:29,274 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 414.0) internal successors, (4968), 12 states have internal predecessors, (4968), 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) [2022-11-20 11:30:29,274 INFO L175 Difference]: Start difference. First operand has 377 places, 361 transitions, 792 flow. Second operand 11 states and 3415 transitions. [2022-11-20 11:30:29,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 469 transitions, 1503 flow [2022-11-20 11:30:29,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 469 transitions, 1465 flow, removed 19 selfloop flow, removed 4 redundant places. [2022-11-20 11:30:29,305 INFO L231 Difference]: Finished difference. Result has 384 places, 373 transitions, 924 flow [2022-11-20 11:30:29,306 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=924, PETRI_PLACES=384, PETRI_TRANSITIONS=373} [2022-11-20 11:30:29,307 INFO L288 CegarLoopForPetriNet]: 373 programPoint places, 11 predicate places. [2022-11-20 11:30:29,307 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 373 transitions, 924 flow [2022-11-20 11:30:29,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 301.0) internal successors, (2709), 9 states have internal predecessors, (2709), 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) [2022-11-20 11:30:29,308 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:30:29,309 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:30:29,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:30:29,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:30:29,517 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 11:30:29,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:29,517 INFO L85 PathProgramCache]: Analyzing trace with hash 508978173, now seen corresponding path program 2 times [2022-11-20 11:30:29,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:29,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490312937] [2022-11-20 11:30:29,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:29,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:30:30,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:30,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490312937] [2022-11-20 11:30:30,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490312937] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:30:30,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591152762] [2022-11-20 11:30:30,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:30:30,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:30:30,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:30:30,334 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:30:30,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:30:30,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:30:30,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:30:30,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 11:30:30,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:30:31,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:30:31,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:30:31,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591152762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:31,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:30:31,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2022-11-20 11:30:31,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653189183] [2022-11-20 11:30:31,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:31,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:30:31,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:31,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:30:31,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:30:31,585 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 414 [2022-11-20 11:30:31,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 373 transitions, 924 flow. Second operand has 9 states, 9 states have (on average 301.0) internal successors, (2709), 9 states have internal predecessors, (2709), 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) [2022-11-20 11:30:31,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:30:31,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 414 [2022-11-20 11:30:31,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:30:36,509 INFO L130 PetriNetUnfolder]: 5988/13863 cut-off events. [2022-11-20 11:30:36,509 INFO L131 PetriNetUnfolder]: For 5857/5865 co-relation queries the response was YES. [2022-11-20 11:30:36,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28360 conditions, 13863 events. 5988/13863 cut-off events. For 5857/5865 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 108933 event pairs, 2590 based on Foata normal form. 46/13611 useless extension candidates. Maximal degree in co-relation 28340. Up to 6917 conditions per place. [2022-11-20 11:30:36,651 INFO L137 encePairwiseOnDemand]: 401/414 looper letters, 117 selfloop transitions, 9 changer transitions 85/478 dead transitions. [2022-11-20 11:30:36,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 478 transitions, 1637 flow [2022-11-20 11:30:36,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 11:30:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-20 11:30:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4305 transitions. [2022-11-20 11:30:36,663 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7427536231884058 [2022-11-20 11:30:36,664 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 4305 transitions. [2022-11-20 11:30:36,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 4305 transitions. [2022-11-20 11:30:36,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:30:36,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 4305 transitions. [2022-11-20 11:30:36,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 307.5) internal successors, (4305), 14 states have internal predecessors, (4305), 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) [2022-11-20 11:30:36,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 414.0) internal successors, (6210), 15 states have internal predecessors, (6210), 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) [2022-11-20 11:30:36,694 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 414.0) internal successors, (6210), 15 states have internal predecessors, (6210), 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) [2022-11-20 11:30:36,694 INFO L175 Difference]: Start difference. First operand has 384 places, 373 transitions, 924 flow. Second operand 14 states and 4305 transitions. [2022-11-20 11:30:36,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 478 transitions, 1637 flow [2022-11-20 11:30:36,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 478 transitions, 1614 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-11-20 11:30:36,713 INFO L231 Difference]: Finished difference. Result has 398 places, 365 transitions, 911 flow [2022-11-20 11:30:36,714 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=911, PETRI_PLACES=398, PETRI_TRANSITIONS=365} [2022-11-20 11:30:36,717 INFO L288 CegarLoopForPetriNet]: 373 programPoint places, 25 predicate places. [2022-11-20 11:30:36,718 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 365 transitions, 911 flow [2022-11-20 11:30:36,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 301.0) internal successors, (2709), 9 states have internal predecessors, (2709), 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) [2022-11-20 11:30:36,719 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:30:36,719 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:30:36,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:30:36,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:30:36,926 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 11:30:36,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:36,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1725245456, now seen corresponding path program 1 times [2022-11-20 11:30:36,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:36,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004537874] [2022-11-20 11:30:36,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:36,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:37,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:30:37,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:37,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004537874] [2022-11-20 11:30:37,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004537874] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:30:37,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120753798] [2022-11-20 11:30:37,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:37,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:30:37,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:30:37,520 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:30:37,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:30:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:37,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:30:37,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:30:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:30:37,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:30:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:30:38,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120753798] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 11:30:38,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:30:38,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 16 [2022-11-20 11:30:38,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510135111] [2022-11-20 11:30:38,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:38,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:30:38,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:38,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:30:38,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-20 11:30:38,302 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 414 [2022-11-20 11:30:38,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 365 transitions, 911 flow. Second operand has 9 states, 9 states have (on average 320.1111111111111) internal successors, (2881), 9 states have internal predecessors, (2881), 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) [2022-11-20 11:30:38,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:30:38,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 414 [2022-11-20 11:30:38,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:30:39,103 INFO L130 PetriNetUnfolder]: 276/1784 cut-off events. [2022-11-20 11:30:39,104 INFO L131 PetriNetUnfolder]: For 881/943 co-relation queries the response was YES. [2022-11-20 11:30:39,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3064 conditions, 1784 events. 276/1784 cut-off events. For 881/943 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 9223 event pairs, 162 based on Foata normal form. 0/1595 useless extension candidates. Maximal degree in co-relation 3038. Up to 391 conditions per place. [2022-11-20 11:30:39,120 INFO L137 encePairwiseOnDemand]: 402/414 looper letters, 69 selfloop transitions, 11 changer transitions 0/366 dead transitions. [2022-11-20 11:30:39,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 366 transitions, 1073 flow [2022-11-20 11:30:39,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:30:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 11:30:39,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3529 transitions. [2022-11-20 11:30:39,129 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7749231444883619 [2022-11-20 11:30:39,129 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3529 transitions. [2022-11-20 11:30:39,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3529 transitions. [2022-11-20 11:30:39,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:30:39,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3529 transitions. [2022-11-20 11:30:39,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 320.8181818181818) internal successors, (3529), 11 states have internal predecessors, (3529), 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) [2022-11-20 11:30:39,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 414.0) internal successors, (4968), 12 states have internal predecessors, (4968), 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) [2022-11-20 11:30:39,151 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 414.0) internal successors, (4968), 12 states have internal predecessors, (4968), 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) [2022-11-20 11:30:39,151 INFO L175 Difference]: Start difference. First operand has 398 places, 365 transitions, 911 flow. Second operand 11 states and 3529 transitions. [2022-11-20 11:30:39,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 366 transitions, 1073 flow [2022-11-20 11:30:39,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 366 transitions, 1004 flow, removed 4 selfloop flow, removed 15 redundant places. [2022-11-20 11:30:39,161 INFO L231 Difference]: Finished difference. Result has 387 places, 366 transitions, 877 flow [2022-11-20 11:30:39,162 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=877, PETRI_PLACES=387, PETRI_TRANSITIONS=366} [2022-11-20 11:30:39,162 INFO L288 CegarLoopForPetriNet]: 373 programPoint places, 14 predicate places. [2022-11-20 11:30:39,163 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 366 transitions, 877 flow [2022-11-20 11:30:39,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 320.1111111111111) internal successors, (2881), 9 states have internal predecessors, (2881), 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) [2022-11-20 11:30:39,164 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:30:39,164 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:30:39,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:30:39,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-20 11:30:39,372 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 11:30:39,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:39,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1494601651, now seen corresponding path program 1 times [2022-11-20 11:30:39,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:39,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40193545] [2022-11-20 11:30:39,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:39,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:30:39,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:39,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40193545] [2022-11-20 11:30:39,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40193545] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:30:39,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469869763] [2022-11-20 11:30:39,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:39,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:30:39,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:30:39,985 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:30:40,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:30:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:40,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 11:30:40,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:30:40,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:30:40,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:30:40,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469869763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:40,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:30:40,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-11-20 11:30:40,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335308691] [2022-11-20 11:30:40,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:40,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:30:40,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:40,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:30:40,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:30:40,366 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 345 out of 414 [2022-11-20 11:30:40,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 366 transitions, 877 flow. Second operand has 6 states, 6 states have (on average 350.3333333333333) internal successors, (2102), 6 states have internal predecessors, (2102), 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) [2022-11-20 11:30:40,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:30:40,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 414 [2022-11-20 11:30:40,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:30:41,258 INFO L130 PetriNetUnfolder]: 874/2762 cut-off events. [2022-11-20 11:30:41,258 INFO L131 PetriNetUnfolder]: For 1124/1136 co-relation queries the response was YES. [2022-11-20 11:30:41,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5187 conditions, 2762 events. 874/2762 cut-off events. For 1124/1136 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 15146 event pairs, 520 based on Foata normal form. 35/2715 useless extension candidates. Maximal degree in co-relation 5166. Up to 1255 conditions per place. [2022-11-20 11:30:41,280 INFO L137 encePairwiseOnDemand]: 405/414 looper letters, 38 selfloop transitions, 4 changer transitions 22/392 dead transitions. [2022-11-20 11:30:41,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 392 transitions, 1084 flow [2022-11-20 11:30:41,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:30:41,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 11:30:41,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2479 transitions. [2022-11-20 11:30:41,287 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8554175293305728 [2022-11-20 11:30:41,287 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2479 transitions. [2022-11-20 11:30:41,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2479 transitions. [2022-11-20 11:30:41,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:30:41,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2479 transitions. [2022-11-20 11:30:41,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 354.14285714285717) internal successors, (2479), 7 states have internal predecessors, (2479), 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) [2022-11-20 11:30:41,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 414.0) internal successors, (3312), 8 states have internal predecessors, (3312), 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) [2022-11-20 11:30:41,301 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 414.0) internal successors, (3312), 8 states have internal predecessors, (3312), 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) [2022-11-20 11:30:41,302 INFO L175 Difference]: Start difference. First operand has 387 places, 366 transitions, 877 flow. Second operand 7 states and 2479 transitions. [2022-11-20 11:30:41,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 392 transitions, 1084 flow [2022-11-20 11:30:41,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 392 transitions, 1060 flow, removed 1 selfloop flow, removed 9 redundant places. [2022-11-20 11:30:41,311 INFO L231 Difference]: Finished difference. Result has 388 places, 367 transitions, 881 flow [2022-11-20 11:30:41,312 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=881, PETRI_PLACES=388, PETRI_TRANSITIONS=367} [2022-11-20 11:30:41,312 INFO L288 CegarLoopForPetriNet]: 373 programPoint places, 15 predicate places. [2022-11-20 11:30:41,312 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 367 transitions, 881 flow [2022-11-20 11:30:41,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 350.3333333333333) internal successors, (2102), 6 states have internal predecessors, (2102), 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) [2022-11-20 11:30:41,313 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:30:41,314 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:30:41,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:30:41,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 11:30:41,523 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 11:30:41,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:41,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1702436706, now seen corresponding path program 1 times [2022-11-20 11:30:41,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:41,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575214583] [2022-11-20 11:30:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:41,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:30:42,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:42,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575214583] [2022-11-20 11:30:42,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575214583] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:30:42,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399716472] [2022-11-20 11:30:42,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:42,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:30:42,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:30:42,122 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:30:42,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:30:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:42,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 11:30:42,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:30:42,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-20 11:30:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:30:42,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:30:42,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399716472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:42,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:30:42,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2022-11-20 11:30:42,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717300217] [2022-11-20 11:30:42,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:42,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 11:30:42,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:42,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 11:30:42,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2022-11-20 11:30:42,816 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 414 [2022-11-20 11:30:42,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 367 transitions, 881 flow. Second operand has 13 states, 13 states have (on average 285.53846153846155) internal successors, (3712), 13 states have internal predecessors, (3712), 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) [2022-11-20 11:30:42,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:30:42,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 414 [2022-11-20 11:30:42,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:30:47,235 INFO L130 PetriNetUnfolder]: 5471/10289 cut-off events. [2022-11-20 11:30:47,235 INFO L131 PetriNetUnfolder]: For 25403/25415 co-relation queries the response was YES. [2022-11-20 11:30:47,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28485 conditions, 10289 events. 5471/10289 cut-off events. For 25403/25415 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 69444 event pairs, 3739 based on Foata normal form. 544/10750 useless extension candidates. Maximal degree in co-relation 28461. Up to 6693 conditions per place. [2022-11-20 11:30:47,338 INFO L137 encePairwiseOnDemand]: 397/414 looper letters, 108 selfloop transitions, 7 changer transitions 210/581 dead transitions. [2022-11-20 11:30:47,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 581 transitions, 2113 flow [2022-11-20 11:30:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 11:30:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-11-20 11:30:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6715 transitions. [2022-11-20 11:30:47,366 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7052089897080446 [2022-11-20 11:30:47,367 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 6715 transitions. [2022-11-20 11:30:47,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 6715 transitions. [2022-11-20 11:30:47,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:30:47,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 6715 transitions. [2022-11-20 11:30:47,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 291.95652173913044) internal successors, (6715), 23 states have internal predecessors, (6715), 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) [2022-11-20 11:30:47,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 414.0) internal successors, (9936), 24 states have internal predecessors, (9936), 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) [2022-11-20 11:30:47,421 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 414.0) internal successors, (9936), 24 states have internal predecessors, (9936), 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) [2022-11-20 11:30:47,422 INFO L175 Difference]: Start difference. First operand has 388 places, 367 transitions, 881 flow. Second operand 23 states and 6715 transitions. [2022-11-20 11:30:47,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 581 transitions, 2113 flow [2022-11-20 11:30:47,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 581 transitions, 2107 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:30:47,435 INFO L231 Difference]: Finished difference. Result has 422 places, 368 transitions, 963 flow [2022-11-20 11:30:47,436 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=963, PETRI_PLACES=422, PETRI_TRANSITIONS=368} [2022-11-20 11:30:47,436 INFO L288 CegarLoopForPetriNet]: 373 programPoint places, 49 predicate places. [2022-11-20 11:30:47,437 INFO L495 AbstractCegarLoop]: Abstraction has has 422 places, 368 transitions, 963 flow [2022-11-20 11:30:47,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 285.53846153846155) internal successors, (3712), 13 states have internal predecessors, (3712), 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) [2022-11-20 11:30:47,438 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:30:47,439 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:30:47,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-20 11:30:47,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:30:47,647 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 11:30:47,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:47,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1974871018, now seen corresponding path program 1 times [2022-11-20 11:30:47,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:47,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920155827] [2022-11-20 11:30:47,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:47,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,409 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 11:30:48,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:48,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920155827] [2022-11-20 11:30:48,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920155827] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:30:48,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430100002] [2022-11-20 11:30:48,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:48,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:30:48,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:30:48,415 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:30:48,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 11:30:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:48,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:30:48,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:30:49,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 11:30:49,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:30:49,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430100002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:49,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:30:49,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2022-11-20 11:30:49,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096896800] [2022-11-20 11:30:49,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:49,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:30:49,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:49,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:30:49,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:30:49,317 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 414 [2022-11-20 11:30:49,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 368 transitions, 963 flow. Second operand has 5 states, 5 states have (on average 374.2) internal successors, (1871), 5 states have internal predecessors, (1871), 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) [2022-11-20 11:30:49,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:30:49,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 414 [2022-11-20 11:30:49,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:30:50,947 INFO L130 PetriNetUnfolder]: 929/4986 cut-off events. [2022-11-20 11:30:50,947 INFO L131 PetriNetUnfolder]: For 203205/205161 co-relation queries the response was YES. [2022-11-20 11:30:50,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19640 conditions, 4986 events. 929/4986 cut-off events. For 203205/205161 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 40951 event pairs, 349 based on Foata normal form. 242/4997 useless extension candidates. Maximal degree in co-relation 19599. Up to 630 conditions per place. [2022-11-20 11:30:51,011 INFO L137 encePairwiseOnDemand]: 408/414 looper letters, 34 selfloop transitions, 8 changer transitions 0/395 dead transitions. [2022-11-20 11:30:51,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 395 transitions, 1208 flow [2022-11-20 11:30:51,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:30:51,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 11:30:51,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2271 transitions. [2022-11-20 11:30:51,016 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9142512077294686 [2022-11-20 11:30:51,016 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2271 transitions. [2022-11-20 11:30:51,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2271 transitions. [2022-11-20 11:30:51,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:30:51,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2271 transitions. [2022-11-20 11:30:51,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 378.5) internal successors, (2271), 6 states have internal predecessors, (2271), 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) [2022-11-20 11:30:51,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 414.0) internal successors, (2898), 7 states have internal predecessors, (2898), 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) [2022-11-20 11:30:51,028 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 414.0) internal successors, (2898), 7 states have internal predecessors, (2898), 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) [2022-11-20 11:30:51,028 INFO L175 Difference]: Start difference. First operand has 422 places, 368 transitions, 963 flow. Second operand 6 states and 2271 transitions. [2022-11-20 11:30:51,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 395 transitions, 1208 flow [2022-11-20 11:30:51,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 395 transitions, 1130 flow, removed 34 selfloop flow, removed 12 redundant places. [2022-11-20 11:30:51,047 INFO L231 Difference]: Finished difference. Result has 402 places, 375 transitions, 1028 flow [2022-11-20 11:30:51,048 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1028, PETRI_PLACES=402, PETRI_TRANSITIONS=375} [2022-11-20 11:30:51,048 INFO L288 CegarLoopForPetriNet]: 373 programPoint places, 29 predicate places. [2022-11-20 11:30:51,049 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 375 transitions, 1028 flow [2022-11-20 11:30:51,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 374.2) internal successors, (1871), 5 states have internal predecessors, (1871), 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) [2022-11-20 11:30:51,050 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:30:51,050 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:30:51,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 11:30:51,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 11:30:51,258 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 11:30:51,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:51,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1548932876, now seen corresponding path program 2 times [2022-11-20 11:30:51,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:51,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671228503] [2022-11-20 11:30:51,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:51,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 11:30:51,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:51,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671228503] [2022-11-20 11:30:51,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671228503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:51,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:51,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:30:51,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607660444] [2022-11-20 11:30:51,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:51,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:30:51,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:51,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:30:51,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:30:51,932 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 414 [2022-11-20 11:30:51,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 375 transitions, 1028 flow. Second operand has 4 states, 4 states have (on average 372.5) internal successors, (1490), 4 states have internal predecessors, (1490), 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) [2022-11-20 11:30:51,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:30:51,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 414 [2022-11-20 11:30:51,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:30:54,345 INFO L130 PetriNetUnfolder]: 1655/5433 cut-off events. [2022-11-20 11:30:54,345 INFO L131 PetriNetUnfolder]: For 318472/356475 co-relation queries the response was YES. [2022-11-20 11:30:54,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24429 conditions, 5433 events. 1655/5433 cut-off events. For 318472/356475 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 42849 event pairs, 497 based on Foata normal form. 705/5443 useless extension candidates. Maximal degree in co-relation 24393. Up to 1156 conditions per place. [2022-11-20 11:30:54,414 INFO L137 encePairwiseOnDemand]: 406/414 looper letters, 36 selfloop transitions, 25 changer transitions 0/411 dead transitions. [2022-11-20 11:30:54,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 411 transitions, 1475 flow [2022-11-20 11:30:54,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:30:54,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 11:30:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1889 transitions. [2022-11-20 11:30:54,418 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.91256038647343 [2022-11-20 11:30:54,418 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1889 transitions. [2022-11-20 11:30:54,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1889 transitions. [2022-11-20 11:30:54,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:30:54,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1889 transitions. [2022-11-20 11:30:54,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 377.8) internal successors, (1889), 5 states have internal predecessors, (1889), 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) [2022-11-20 11:30:54,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 414.0) internal successors, (2484), 6 states have internal predecessors, (2484), 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) [2022-11-20 11:30:54,428 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 414.0) internal successors, (2484), 6 states have internal predecessors, (2484), 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) [2022-11-20 11:30:54,428 INFO L175 Difference]: Start difference. First operand has 402 places, 375 transitions, 1028 flow. Second operand 5 states and 1889 transitions. [2022-11-20 11:30:54,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 411 transitions, 1475 flow [2022-11-20 11:30:54,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 411 transitions, 1472 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-20 11:30:54,453 INFO L231 Difference]: Finished difference. Result has 407 places, 395 transitions, 1321 flow [2022-11-20 11:30:54,453 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1321, PETRI_PLACES=407, PETRI_TRANSITIONS=395} [2022-11-20 11:30:54,454 INFO L288 CegarLoopForPetriNet]: 373 programPoint places, 34 predicate places. [2022-11-20 11:30:54,454 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 395 transitions, 1321 flow [2022-11-20 11:30:54,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 372.5) internal successors, (1490), 4 states have internal predecessors, (1490), 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) [2022-11-20 11:30:54,455 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:30:54,455 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:30:54,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:30:54,456 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 11:30:54,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:54,456 INFO L85 PathProgramCache]: Analyzing trace with hash -76352082, now seen corresponding path program 3 times [2022-11-20 11:30:54,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:54,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352716467] [2022-11-20 11:30:54,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:54,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:30:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:30:55,056 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 11:30:55,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:30:55,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352716467] [2022-11-20 11:30:55,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352716467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:30:55,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:30:55,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:30:55,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596954172] [2022-11-20 11:30:55,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:30:55,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:30:55,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:30:55,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:30:55,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:30:55,061 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 414 [2022-11-20 11:30:55,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 395 transitions, 1321 flow. Second operand has 4 states, 4 states have (on average 373.25) internal successors, (1493), 4 states have internal predecessors, (1493), 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) [2022-11-20 11:30:55,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:30:55,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 414 [2022-11-20 11:30:55,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:30:56,351 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1209] L73-->L81: Formula: (let ((.cse0 (not |v_thread2_#t~short8#1_66|)) (.cse1 (select (select |v_#memory_int_92| v_~queue1~0.base_59) (+ (* v_~front1~0_96 4) v_~queue1~0.offset_59)))) (and (not (= (ite (and (< v_~state12~0_53 v_~n1~0_26) (<= 0 v_~state12~0_53)) 1 0) 0)) (= (+ v_~size1~0_77 1) v_~size1~0_78) (= v_~front1~0_95 (+ v_~front1~0_96 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (or (and .cse0 (= |v_thread2_#t~mem7#1_42| |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) (= |v_thread2_#t~short8#1_66| |v_thread2_#t~short8#1_65|)) (and (= |v_thread2_#t~mem7#1_42| .cse1) (let ((.cse2 (< |v_thread2_#t~mem7#1_42| v_~n2~0_14))) (or (and .cse2 |v_thread2_#t~short8#1_65|) (and (not |v_thread2_#t~short8#1_65|) (not .cse2)))) |v_thread2_#t~short8#1_66|)) (not (= (ite (< 0 v_~size1~0_78) 1 0) 0)) (= (ite |v_thread2_#t~short8#1_65| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (let ((.cse3 (+ (* v_~state12~0_53 4) v_~consume~0.offset_24))) (select (select |v_#memory_int_92| (select (select |v_#memory_$Pointer$.base_39| v_~consume~0.base_24) .cse3)) (+ (select (select |v_#memory_$Pointer$.offset_39| v_~consume~0.base_24) .cse3) (* 4 .cse1)))) v_~state12~0_52) (let ((.cse4 (<= 0 .cse1))) (or (and .cse0 (not .cse4)) (and |v_thread2_#t~short8#1_66| .cse4))) (not (= (ite (and (<= 0 v_~front1~0_96) (< v_~front1~0_96 v_~n_queue~0_38)) 1 0) 0)))) InVars {~state12~0=v_~state12~0_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, ~front1~0=v_~front1~0_96, ~queue1~0.offset=v_~queue1~0.offset_59, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} OutVars{~state12~0=v_~state12~0_52, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_1|, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_77, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem10#1.offset=|v_thread2Thread1of1ForFork1_#t~mem10#1.offset_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, thread2Thread1of1ForFork1_#t~post13#1=|v_thread2Thread1of1ForFork1_#t~post13#1_1|, thread2Thread1of1ForFork1_#t~short8#1=|v_thread2Thread1of1ForFork1_#t~short8#1_1|, ~front1~0=v_~front1~0_95, ~queue1~0.offset=v_~queue1~0.offset_59, thread2Thread1of1ForFork1_#t~mem10#1.base=|v_thread2Thread1of1ForFork1_#t~mem10#1.base_1|, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} AuxVars[|v_thread2_#t~short8#1_66|, |v_thread2_#t~mem7#1_42|, |v_thread2_#t~short8#1_65|] AssignedVars[~state12~0, thread2Thread1of1ForFork1_#t~post12#1, ~size1~0, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem10#1.offset, thread2Thread1of1ForFork1_#t~post13#1, thread2Thread1of1ForFork1_#t~short8#1, ~front1~0, thread2Thread1of1ForFork1_#t~mem10#1.base][368], [395#(= ~finished2~0 0), Black: 3535#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 3306#(<= ~state11~0 ~state21~0), Black: 4101#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), 263#L134-2true, Black: 8041#(<= 1 ~size1~0), Black: 4099#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 9099#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= 0 ~size1~0)), Black: 4093#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9097#(and (<= 1 ~size1~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 400#(= ~finished1~0 0), Black: 6615#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 6926#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6928#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 7985#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6930#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 9107#(or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (not (<= ~size1~0 0)) (= ~finished1~0 (* 256 (div ~finished1~0 256))))) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (= ~finished1~0 (* 256 (div ~finished1~0 256)))))), Black: 8001#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 9110#(and (or (and (not (<= ~size1~0 0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0))) (not (= ~finished1~0 (* 256 (div ~finished1~0 256))))), Black: 8005#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 5975#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~2#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 8009#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (or (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (not |thread3Thread1of1ForFork2_#t~short16#1|)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8011#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7999#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 9114#true, Black: 8007#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8017#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 412#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3165#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~state11~0)) (< ~state21~0 0) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< ~state21~0 0) (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~state21~0 0) (<= ~n_update~0 ~state21~0))), Black: 7987#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9108#(not (= ~finished1~0 (* 256 (div ~finished1~0 256)))), 362#L81true, 8089#(<= 0 ~size1~0), 7983#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 427#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 390#true, Black: 425#(<= ~n_queue~0 0), 5973#(and (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 429#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 13#L94-3true, 441#true]) [2022-11-20 11:30:56,352 INFO L383 tUnfolder$Statistics]: this new event has 306 ancestors and is cut-off event [2022-11-20 11:30:56,352 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-20 11:30:56,352 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-20 11:30:56,353 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-20 11:30:56,378 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1209] L73-->L81: Formula: (let ((.cse0 (not |v_thread2_#t~short8#1_66|)) (.cse1 (select (select |v_#memory_int_92| v_~queue1~0.base_59) (+ (* v_~front1~0_96 4) v_~queue1~0.offset_59)))) (and (not (= (ite (and (< v_~state12~0_53 v_~n1~0_26) (<= 0 v_~state12~0_53)) 1 0) 0)) (= (+ v_~size1~0_77 1) v_~size1~0_78) (= v_~front1~0_95 (+ v_~front1~0_96 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (or (and .cse0 (= |v_thread2_#t~mem7#1_42| |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) (= |v_thread2_#t~short8#1_66| |v_thread2_#t~short8#1_65|)) (and (= |v_thread2_#t~mem7#1_42| .cse1) (let ((.cse2 (< |v_thread2_#t~mem7#1_42| v_~n2~0_14))) (or (and .cse2 |v_thread2_#t~short8#1_65|) (and (not |v_thread2_#t~short8#1_65|) (not .cse2)))) |v_thread2_#t~short8#1_66|)) (not (= (ite (< 0 v_~size1~0_78) 1 0) 0)) (= (ite |v_thread2_#t~short8#1_65| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (let ((.cse3 (+ (* v_~state12~0_53 4) v_~consume~0.offset_24))) (select (select |v_#memory_int_92| (select (select |v_#memory_$Pointer$.base_39| v_~consume~0.base_24) .cse3)) (+ (select (select |v_#memory_$Pointer$.offset_39| v_~consume~0.base_24) .cse3) (* 4 .cse1)))) v_~state12~0_52) (let ((.cse4 (<= 0 .cse1))) (or (and .cse0 (not .cse4)) (and |v_thread2_#t~short8#1_66| .cse4))) (not (= (ite (and (<= 0 v_~front1~0_96) (< v_~front1~0_96 v_~n_queue~0_38)) 1 0) 0)))) InVars {~state12~0=v_~state12~0_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, ~front1~0=v_~front1~0_96, ~queue1~0.offset=v_~queue1~0.offset_59, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} OutVars{~state12~0=v_~state12~0_52, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_1|, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_77, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem10#1.offset=|v_thread2Thread1of1ForFork1_#t~mem10#1.offset_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, thread2Thread1of1ForFork1_#t~post13#1=|v_thread2Thread1of1ForFork1_#t~post13#1_1|, thread2Thread1of1ForFork1_#t~short8#1=|v_thread2Thread1of1ForFork1_#t~short8#1_1|, ~front1~0=v_~front1~0_95, ~queue1~0.offset=v_~queue1~0.offset_59, thread2Thread1of1ForFork1_#t~mem10#1.base=|v_thread2Thread1of1ForFork1_#t~mem10#1.base_1|, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} AuxVars[|v_thread2_#t~short8#1_66|, |v_thread2_#t~mem7#1_42|, |v_thread2_#t~short8#1_65|] AssignedVars[~state12~0, thread2Thread1of1ForFork1_#t~post12#1, ~size1~0, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem10#1.offset, thread2Thread1of1ForFork1_#t~post13#1, thread2Thread1of1ForFork1_#t~short8#1, ~front1~0, thread2Thread1of1ForFork1_#t~mem10#1.base][368], [395#(= ~finished2~0 0), Black: 3535#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 3306#(<= ~state11~0 ~state21~0), Black: 4101#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 8041#(<= 1 ~size1~0), 263#L134-2true, Black: 4099#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 9099#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= 0 ~size1~0)), Black: 4093#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9097#(and (<= 1 ~size1~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 400#(= ~finished1~0 0), 124#L94-4true, Black: 6615#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 6926#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6928#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 7985#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6930#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 9107#(or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (not (<= ~size1~0 0)) (= ~finished1~0 (* 256 (div ~finished1~0 256))))) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (= ~finished1~0 (* 256 (div ~finished1~0 256)))))), Black: 8001#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 9110#(and (or (and (not (<= ~size1~0 0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0))) (not (= ~finished1~0 (* 256 (div ~finished1~0 256))))), Black: 8005#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 5975#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~2#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 8009#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (or (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (not |thread3Thread1of1ForFork2_#t~short16#1|)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8011#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7999#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 9114#true, Black: 8007#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8017#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 412#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3165#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~state11~0)) (< ~state21~0 0) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< ~state21~0 0) (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~state21~0 0) (<= ~n_update~0 ~state21~0))), Black: 7987#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9108#(not (= ~finished1~0 (* 256 (div ~finished1~0 256)))), 362#L81true, 8089#(<= 0 ~size1~0), 7983#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 427#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 390#true, Black: 425#(<= ~n_queue~0 0), 5973#(and (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 429#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 441#true]) [2022-11-20 11:30:56,378 INFO L383 tUnfolder$Statistics]: this new event has 307 ancestors and is cut-off event [2022-11-20 11:30:56,378 INFO L386 tUnfolder$Statistics]: existing Event has 307 ancestors and is cut-off event [2022-11-20 11:30:56,379 INFO L386 tUnfolder$Statistics]: existing Event has 307 ancestors and is cut-off event [2022-11-20 11:30:56,379 INFO L386 tUnfolder$Statistics]: existing Event has 307 ancestors and is cut-off event [2022-11-20 11:30:56,404 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1209] L73-->L81: Formula: (let ((.cse0 (not |v_thread2_#t~short8#1_66|)) (.cse1 (select (select |v_#memory_int_92| v_~queue1~0.base_59) (+ (* v_~front1~0_96 4) v_~queue1~0.offset_59)))) (and (not (= (ite (and (< v_~state12~0_53 v_~n1~0_26) (<= 0 v_~state12~0_53)) 1 0) 0)) (= (+ v_~size1~0_77 1) v_~size1~0_78) (= v_~front1~0_95 (+ v_~front1~0_96 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (or (and .cse0 (= |v_thread2_#t~mem7#1_42| |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) (= |v_thread2_#t~short8#1_66| |v_thread2_#t~short8#1_65|)) (and (= |v_thread2_#t~mem7#1_42| .cse1) (let ((.cse2 (< |v_thread2_#t~mem7#1_42| v_~n2~0_14))) (or (and .cse2 |v_thread2_#t~short8#1_65|) (and (not |v_thread2_#t~short8#1_65|) (not .cse2)))) |v_thread2_#t~short8#1_66|)) (not (= (ite (< 0 v_~size1~0_78) 1 0) 0)) (= (ite |v_thread2_#t~short8#1_65| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (let ((.cse3 (+ (* v_~state12~0_53 4) v_~consume~0.offset_24))) (select (select |v_#memory_int_92| (select (select |v_#memory_$Pointer$.base_39| v_~consume~0.base_24) .cse3)) (+ (select (select |v_#memory_$Pointer$.offset_39| v_~consume~0.base_24) .cse3) (* 4 .cse1)))) v_~state12~0_52) (let ((.cse4 (<= 0 .cse1))) (or (and .cse0 (not .cse4)) (and |v_thread2_#t~short8#1_66| .cse4))) (not (= (ite (and (<= 0 v_~front1~0_96) (< v_~front1~0_96 v_~n_queue~0_38)) 1 0) 0)))) InVars {~state12~0=v_~state12~0_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, ~front1~0=v_~front1~0_96, ~queue1~0.offset=v_~queue1~0.offset_59, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} OutVars{~state12~0=v_~state12~0_52, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_1|, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_77, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem10#1.offset=|v_thread2Thread1of1ForFork1_#t~mem10#1.offset_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, thread2Thread1of1ForFork1_#t~post13#1=|v_thread2Thread1of1ForFork1_#t~post13#1_1|, thread2Thread1of1ForFork1_#t~short8#1=|v_thread2Thread1of1ForFork1_#t~short8#1_1|, ~front1~0=v_~front1~0_95, ~queue1~0.offset=v_~queue1~0.offset_59, thread2Thread1of1ForFork1_#t~mem10#1.base=|v_thread2Thread1of1ForFork1_#t~mem10#1.base_1|, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} AuxVars[|v_thread2_#t~short8#1_66|, |v_thread2_#t~mem7#1_42|, |v_thread2_#t~short8#1_65|] AssignedVars[~state12~0, thread2Thread1of1ForFork1_#t~post12#1, ~size1~0, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem10#1.offset, thread2Thread1of1ForFork1_#t~post13#1, thread2Thread1of1ForFork1_#t~short8#1, ~front1~0, thread2Thread1of1ForFork1_#t~mem10#1.base][368], [395#(= ~finished2~0 0), Black: 3535#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 3306#(<= ~state11~0 ~state21~0), Black: 4101#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 8041#(<= 1 ~size1~0), 263#L134-2true, Black: 4099#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 9099#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= 0 ~size1~0)), Black: 4093#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9097#(and (<= 1 ~size1~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 400#(= ~finished1~0 0), Black: 6615#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 6926#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6928#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6930#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 7985#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9107#(or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (not (<= ~size1~0 0)) (= ~finished1~0 (* 256 (div ~finished1~0 256))))) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (= ~finished1~0 (* 256 (div ~finished1~0 256)))))), Black: 8001#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 9110#(and (or (and (not (<= ~size1~0 0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0))) (not (= ~finished1~0 (* 256 (div ~finished1~0 256))))), Black: 8005#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 5975#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~2#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 8009#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (or (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (not |thread3Thread1of1ForFork2_#t~short16#1|)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8011#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7999#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 9114#true, Black: 8007#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8017#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 75#L94-6true, Black: 412#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3165#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~state11~0)) (< ~state21~0 0) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< ~state21~0 0) (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~state21~0 0) (<= ~n_update~0 ~state21~0))), Black: 7987#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9108#(not (= ~finished1~0 (* 256 (div ~finished1~0 256)))), 362#L81true, 8089#(<= 0 ~size1~0), 7983#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 427#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 390#true, Black: 425#(<= ~n_queue~0 0), 5973#(and (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 429#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 441#true]) [2022-11-20 11:30:56,405 INFO L383 tUnfolder$Statistics]: this new event has 308 ancestors and is cut-off event [2022-11-20 11:30:56,405 INFO L386 tUnfolder$Statistics]: existing Event has 308 ancestors and is cut-off event [2022-11-20 11:30:56,405 INFO L386 tUnfolder$Statistics]: existing Event has 308 ancestors and is cut-off event [2022-11-20 11:30:56,405 INFO L386 tUnfolder$Statistics]: existing Event has 308 ancestors and is cut-off event [2022-11-20 11:30:56,446 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1209] L73-->L81: Formula: (let ((.cse0 (not |v_thread2_#t~short8#1_66|)) (.cse1 (select (select |v_#memory_int_92| v_~queue1~0.base_59) (+ (* v_~front1~0_96 4) v_~queue1~0.offset_59)))) (and (not (= (ite (and (< v_~state12~0_53 v_~n1~0_26) (<= 0 v_~state12~0_53)) 1 0) 0)) (= (+ v_~size1~0_77 1) v_~size1~0_78) (= v_~front1~0_95 (+ v_~front1~0_96 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (or (and .cse0 (= |v_thread2_#t~mem7#1_42| |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) (= |v_thread2_#t~short8#1_66| |v_thread2_#t~short8#1_65|)) (and (= |v_thread2_#t~mem7#1_42| .cse1) (let ((.cse2 (< |v_thread2_#t~mem7#1_42| v_~n2~0_14))) (or (and .cse2 |v_thread2_#t~short8#1_65|) (and (not |v_thread2_#t~short8#1_65|) (not .cse2)))) |v_thread2_#t~short8#1_66|)) (not (= (ite (< 0 v_~size1~0_78) 1 0) 0)) (= (ite |v_thread2_#t~short8#1_65| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (let ((.cse3 (+ (* v_~state12~0_53 4) v_~consume~0.offset_24))) (select (select |v_#memory_int_92| (select (select |v_#memory_$Pointer$.base_39| v_~consume~0.base_24) .cse3)) (+ (select (select |v_#memory_$Pointer$.offset_39| v_~consume~0.base_24) .cse3) (* 4 .cse1)))) v_~state12~0_52) (let ((.cse4 (<= 0 .cse1))) (or (and .cse0 (not .cse4)) (and |v_thread2_#t~short8#1_66| .cse4))) (not (= (ite (and (<= 0 v_~front1~0_96) (< v_~front1~0_96 v_~n_queue~0_38)) 1 0) 0)))) InVars {~state12~0=v_~state12~0_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, ~front1~0=v_~front1~0_96, ~queue1~0.offset=v_~queue1~0.offset_59, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} OutVars{~state12~0=v_~state12~0_52, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_1|, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_77, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem10#1.offset=|v_thread2Thread1of1ForFork1_#t~mem10#1.offset_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, thread2Thread1of1ForFork1_#t~post13#1=|v_thread2Thread1of1ForFork1_#t~post13#1_1|, thread2Thread1of1ForFork1_#t~short8#1=|v_thread2Thread1of1ForFork1_#t~short8#1_1|, ~front1~0=v_~front1~0_95, ~queue1~0.offset=v_~queue1~0.offset_59, thread2Thread1of1ForFork1_#t~mem10#1.base=|v_thread2Thread1of1ForFork1_#t~mem10#1.base_1|, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} AuxVars[|v_thread2_#t~short8#1_66|, |v_thread2_#t~mem7#1_42|, |v_thread2_#t~short8#1_65|] AssignedVars[~state12~0, thread2Thread1of1ForFork1_#t~post12#1, ~size1~0, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem10#1.offset, thread2Thread1of1ForFork1_#t~post13#1, thread2Thread1of1ForFork1_#t~short8#1, ~front1~0, thread2Thread1of1ForFork1_#t~mem10#1.base][368], [395#(= ~finished2~0 0), Black: 3535#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 3306#(<= ~state11~0 ~state21~0), Black: 4101#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 8041#(<= 1 ~size1~0), 263#L134-2true, Black: 4099#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 9099#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= 0 ~size1~0)), Black: 4093#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9097#(and (<= 1 ~size1~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 400#(= ~finished1~0 0), Black: 6615#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 6926#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6928#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 7985#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6930#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 9107#(or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (not (<= ~size1~0 0)) (= ~finished1~0 (* 256 (div ~finished1~0 256))))) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (= ~finished1~0 (* 256 (div ~finished1~0 256)))))), Black: 8001#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 9110#(and (or (and (not (<= ~size1~0 0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0))) (not (= ~finished1~0 (* 256 (div ~finished1~0 256))))), Black: 8005#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 5975#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~2#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 8009#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (or (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (not |thread3Thread1of1ForFork2_#t~short16#1|)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8011#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7999#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 9114#true, Black: 8007#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 285#L94-8true, Black: 8017#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 412#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3165#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~state11~0)) (< ~state21~0 0) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< ~state21~0 0) (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~state21~0 0) (<= ~n_update~0 ~state21~0))), Black: 7987#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9108#(not (= ~finished1~0 (* 256 (div ~finished1~0 256)))), 362#L81true, 8089#(<= 0 ~size1~0), 7983#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 427#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 390#true, Black: 425#(<= ~n_queue~0 0), 5973#(and (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 429#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 441#true]) [2022-11-20 11:30:56,446 INFO L383 tUnfolder$Statistics]: this new event has 310 ancestors and is cut-off event [2022-11-20 11:30:56,446 INFO L386 tUnfolder$Statistics]: existing Event has 310 ancestors and is cut-off event [2022-11-20 11:30:56,446 INFO L386 tUnfolder$Statistics]: existing Event has 310 ancestors and is cut-off event [2022-11-20 11:30:56,446 INFO L386 tUnfolder$Statistics]: existing Event has 310 ancestors and is cut-off event [2022-11-20 11:30:56,479 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1209] L73-->L81: Formula: (let ((.cse0 (not |v_thread2_#t~short8#1_66|)) (.cse1 (select (select |v_#memory_int_92| v_~queue1~0.base_59) (+ (* v_~front1~0_96 4) v_~queue1~0.offset_59)))) (and (not (= (ite (and (< v_~state12~0_53 v_~n1~0_26) (<= 0 v_~state12~0_53)) 1 0) 0)) (= (+ v_~size1~0_77 1) v_~size1~0_78) (= v_~front1~0_95 (+ v_~front1~0_96 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (or (and .cse0 (= |v_thread2_#t~mem7#1_42| |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) (= |v_thread2_#t~short8#1_66| |v_thread2_#t~short8#1_65|)) (and (= |v_thread2_#t~mem7#1_42| .cse1) (let ((.cse2 (< |v_thread2_#t~mem7#1_42| v_~n2~0_14))) (or (and .cse2 |v_thread2_#t~short8#1_65|) (and (not |v_thread2_#t~short8#1_65|) (not .cse2)))) |v_thread2_#t~short8#1_66|)) (not (= (ite (< 0 v_~size1~0_78) 1 0) 0)) (= (ite |v_thread2_#t~short8#1_65| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (let ((.cse3 (+ (* v_~state12~0_53 4) v_~consume~0.offset_24))) (select (select |v_#memory_int_92| (select (select |v_#memory_$Pointer$.base_39| v_~consume~0.base_24) .cse3)) (+ (select (select |v_#memory_$Pointer$.offset_39| v_~consume~0.base_24) .cse3) (* 4 .cse1)))) v_~state12~0_52) (let ((.cse4 (<= 0 .cse1))) (or (and .cse0 (not .cse4)) (and |v_thread2_#t~short8#1_66| .cse4))) (not (= (ite (and (<= 0 v_~front1~0_96) (< v_~front1~0_96 v_~n_queue~0_38)) 1 0) 0)))) InVars {~state12~0=v_~state12~0_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, ~front1~0=v_~front1~0_96, ~queue1~0.offset=v_~queue1~0.offset_59, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} OutVars{~state12~0=v_~state12~0_52, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_1|, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_77, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem10#1.offset=|v_thread2Thread1of1ForFork1_#t~mem10#1.offset_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, thread2Thread1of1ForFork1_#t~post13#1=|v_thread2Thread1of1ForFork1_#t~post13#1_1|, thread2Thread1of1ForFork1_#t~short8#1=|v_thread2Thread1of1ForFork1_#t~short8#1_1|, ~front1~0=v_~front1~0_95, ~queue1~0.offset=v_~queue1~0.offset_59, thread2Thread1of1ForFork1_#t~mem10#1.base=|v_thread2Thread1of1ForFork1_#t~mem10#1.base_1|, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} AuxVars[|v_thread2_#t~short8#1_66|, |v_thread2_#t~mem7#1_42|, |v_thread2_#t~short8#1_65|] AssignedVars[~state12~0, thread2Thread1of1ForFork1_#t~post12#1, ~size1~0, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem10#1.offset, thread2Thread1of1ForFork1_#t~post13#1, thread2Thread1of1ForFork1_#t~short8#1, ~front1~0, thread2Thread1of1ForFork1_#t~mem10#1.base][368], [395#(= ~finished2~0 0), Black: 3535#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 3306#(<= ~state11~0 ~state21~0), Black: 4101#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 8041#(<= 1 ~size1~0), 263#L134-2true, Black: 4099#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 9099#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= 0 ~size1~0)), Black: 4093#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9097#(and (<= 1 ~size1~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 400#(= ~finished1~0 0), 147#L38-6true, Black: 6615#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 6926#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6928#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6930#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 7985#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9107#(or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (not (<= ~size1~0 0)) (= ~finished1~0 (* 256 (div ~finished1~0 256))))) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (= ~finished1~0 (* 256 (div ~finished1~0 256)))))), Black: 8001#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 9110#(and (or (and (not (<= ~size1~0 0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0))) (not (= ~finished1~0 (* 256 (div ~finished1~0 256))))), Black: 8005#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 5975#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~2#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 8009#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (or (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (not |thread3Thread1of1ForFork2_#t~short16#1|)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8011#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7999#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 9114#true, Black: 8007#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8017#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 412#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3165#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~state11~0)) (< ~state21~0 0) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< ~state21~0 0) (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~state21~0 0) (<= ~n_update~0 ~state21~0))), Black: 7987#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9108#(not (= ~finished1~0 (* 256 (div ~finished1~0 256)))), 362#L81true, 8089#(<= 0 ~size1~0), 7983#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 427#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 390#true, Black: 425#(<= ~n_queue~0 0), 5973#(and (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 429#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 441#true]) [2022-11-20 11:30:56,479 INFO L383 tUnfolder$Statistics]: this new event has 312 ancestors and is cut-off event [2022-11-20 11:30:56,479 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-20 11:30:56,479 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-20 11:30:56,479 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-20 11:30:56,647 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1209] L73-->L81: Formula: (let ((.cse0 (not |v_thread2_#t~short8#1_66|)) (.cse1 (select (select |v_#memory_int_92| v_~queue1~0.base_59) (+ (* v_~front1~0_96 4) v_~queue1~0.offset_59)))) (and (not (= (ite (and (< v_~state12~0_53 v_~n1~0_26) (<= 0 v_~state12~0_53)) 1 0) 0)) (= (+ v_~size1~0_77 1) v_~size1~0_78) (= v_~front1~0_95 (+ v_~front1~0_96 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (or (and .cse0 (= |v_thread2_#t~mem7#1_42| |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) (= |v_thread2_#t~short8#1_66| |v_thread2_#t~short8#1_65|)) (and (= |v_thread2_#t~mem7#1_42| .cse1) (let ((.cse2 (< |v_thread2_#t~mem7#1_42| v_~n2~0_14))) (or (and .cse2 |v_thread2_#t~short8#1_65|) (and (not |v_thread2_#t~short8#1_65|) (not .cse2)))) |v_thread2_#t~short8#1_66|)) (not (= (ite (< 0 v_~size1~0_78) 1 0) 0)) (= (ite |v_thread2_#t~short8#1_65| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (let ((.cse3 (+ (* v_~state12~0_53 4) v_~consume~0.offset_24))) (select (select |v_#memory_int_92| (select (select |v_#memory_$Pointer$.base_39| v_~consume~0.base_24) .cse3)) (+ (select (select |v_#memory_$Pointer$.offset_39| v_~consume~0.base_24) .cse3) (* 4 .cse1)))) v_~state12~0_52) (let ((.cse4 (<= 0 .cse1))) (or (and .cse0 (not .cse4)) (and |v_thread2_#t~short8#1_66| .cse4))) (not (= (ite (and (<= 0 v_~front1~0_96) (< v_~front1~0_96 v_~n_queue~0_38)) 1 0) 0)))) InVars {~state12~0=v_~state12~0_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, ~front1~0=v_~front1~0_96, ~queue1~0.offset=v_~queue1~0.offset_59, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} OutVars{~state12~0=v_~state12~0_52, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_1|, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_77, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem10#1.offset=|v_thread2Thread1of1ForFork1_#t~mem10#1.offset_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, thread2Thread1of1ForFork1_#t~post13#1=|v_thread2Thread1of1ForFork1_#t~post13#1_1|, thread2Thread1of1ForFork1_#t~short8#1=|v_thread2Thread1of1ForFork1_#t~short8#1_1|, ~front1~0=v_~front1~0_95, ~queue1~0.offset=v_~queue1~0.offset_59, thread2Thread1of1ForFork1_#t~mem10#1.base=|v_thread2Thread1of1ForFork1_#t~mem10#1.base_1|, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} AuxVars[|v_thread2_#t~short8#1_66|, |v_thread2_#t~mem7#1_42|, |v_thread2_#t~short8#1_65|] AssignedVars[~state12~0, thread2Thread1of1ForFork1_#t~post12#1, ~size1~0, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem10#1.offset, thread2Thread1of1ForFork1_#t~post13#1, thread2Thread1of1ForFork1_#t~short8#1, ~front1~0, thread2Thread1of1ForFork1_#t~mem10#1.base][368], [395#(= ~finished2~0 0), Black: 3535#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 3306#(<= ~state11~0 ~state21~0), Black: 4101#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 8041#(<= 1 ~size1~0), 263#L134-2true, Black: 4099#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 9099#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= 0 ~size1~0)), Black: 4093#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9097#(and (<= 1 ~size1~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 400#(= ~finished1~0 0), Black: 6615#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 6926#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6928#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6930#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 7985#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9107#(or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (not (<= ~size1~0 0)) (= ~finished1~0 (* 256 (div ~finished1~0 256))))) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (= ~finished1~0 (* 256 (div ~finished1~0 256)))))), Black: 8001#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 9110#(and (or (and (not (<= ~size1~0 0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0))) (not (= ~finished1~0 (* 256 (div ~finished1~0 256))))), Black: 8005#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 5975#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~2#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), 168#L37-5true, Black: 8009#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (or (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (not |thread3Thread1of1ForFork2_#t~short16#1|)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8011#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7999#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 9114#true, Black: 8007#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8017#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 412#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3165#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~state11~0)) (< ~state21~0 0) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< ~state21~0 0) (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~state21~0 0) (<= ~n_update~0 ~state21~0))), Black: 7987#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9108#(not (= ~finished1~0 (* 256 (div ~finished1~0 256)))), 362#L81true, 8089#(<= 0 ~size1~0), 7983#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 427#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 425#(<= ~n_queue~0 0), 390#true, 5973#(and (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 429#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 441#true]) [2022-11-20 11:30:56,648 INFO L383 tUnfolder$Statistics]: this new event has 313 ancestors and is cut-off event [2022-11-20 11:30:56,648 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-20 11:30:56,648 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-20 11:30:56,649 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-20 11:30:57,570 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1209] L73-->L81: Formula: (let ((.cse0 (not |v_thread2_#t~short8#1_66|)) (.cse1 (select (select |v_#memory_int_92| v_~queue1~0.base_59) (+ (* v_~front1~0_96 4) v_~queue1~0.offset_59)))) (and (not (= (ite (and (< v_~state12~0_53 v_~n1~0_26) (<= 0 v_~state12~0_53)) 1 0) 0)) (= (+ v_~size1~0_77 1) v_~size1~0_78) (= v_~front1~0_95 (+ v_~front1~0_96 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (or (and .cse0 (= |v_thread2_#t~mem7#1_42| |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) (= |v_thread2_#t~short8#1_66| |v_thread2_#t~short8#1_65|)) (and (= |v_thread2_#t~mem7#1_42| .cse1) (let ((.cse2 (< |v_thread2_#t~mem7#1_42| v_~n2~0_14))) (or (and .cse2 |v_thread2_#t~short8#1_65|) (and (not |v_thread2_#t~short8#1_65|) (not .cse2)))) |v_thread2_#t~short8#1_66|)) (not (= (ite (< 0 v_~size1~0_78) 1 0) 0)) (= (ite |v_thread2_#t~short8#1_65| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (let ((.cse3 (+ (* v_~state12~0_53 4) v_~consume~0.offset_24))) (select (select |v_#memory_int_92| (select (select |v_#memory_$Pointer$.base_39| v_~consume~0.base_24) .cse3)) (+ (select (select |v_#memory_$Pointer$.offset_39| v_~consume~0.base_24) .cse3) (* 4 .cse1)))) v_~state12~0_52) (let ((.cse4 (<= 0 .cse1))) (or (and .cse0 (not .cse4)) (and |v_thread2_#t~short8#1_66| .cse4))) (not (= (ite (and (<= 0 v_~front1~0_96) (< v_~front1~0_96 v_~n_queue~0_38)) 1 0) 0)))) InVars {~state12~0=v_~state12~0_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, ~front1~0=v_~front1~0_96, ~queue1~0.offset=v_~queue1~0.offset_59, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} OutVars{~state12~0=v_~state12~0_52, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_1|, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_77, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem10#1.offset=|v_thread2Thread1of1ForFork1_#t~mem10#1.offset_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, thread2Thread1of1ForFork1_#t~post13#1=|v_thread2Thread1of1ForFork1_#t~post13#1_1|, thread2Thread1of1ForFork1_#t~short8#1=|v_thread2Thread1of1ForFork1_#t~short8#1_1|, ~front1~0=v_~front1~0_95, ~queue1~0.offset=v_~queue1~0.offset_59, thread2Thread1of1ForFork1_#t~mem10#1.base=|v_thread2Thread1of1ForFork1_#t~mem10#1.base_1|, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} AuxVars[|v_thread2_#t~short8#1_66|, |v_thread2_#t~mem7#1_42|, |v_thread2_#t~short8#1_65|] AssignedVars[~state12~0, thread2Thread1of1ForFork1_#t~post12#1, ~size1~0, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem10#1.offset, thread2Thread1of1ForFork1_#t~post13#1, thread2Thread1of1ForFork1_#t~short8#1, ~front1~0, thread2Thread1of1ForFork1_#t~mem10#1.base][368], [Black: 3535#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), 345#L92-2true, Black: 3306#(<= ~state11~0 ~state21~0), Black: 4101#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 8041#(<= 1 ~size1~0), Black: 395#(= ~finished2~0 0), 263#L134-2true, Black: 4099#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 9099#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= 0 ~size1~0)), Black: 4093#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9097#(and (<= 1 ~size1~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 400#(= ~finished1~0 0), Black: 6615#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 6926#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6928#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6930#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 7985#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9107#(or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (not (<= ~size1~0 0)) (= ~finished1~0 (* 256 (div ~finished1~0 256))))) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (= ~finished1~0 (* 256 (div ~finished1~0 256)))))), Black: 8001#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 9110#(and (or (and (not (<= ~size1~0 0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0))) (not (= ~finished1~0 (* 256 (div ~finished1~0 256))))), Black: 8005#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 5975#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~2#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 8009#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (or (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (not |thread3Thread1of1ForFork2_#t~short16#1|)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8011#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7999#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 9114#true, Black: 8007#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8017#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 412#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3165#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~state11~0)) (< ~state21~0 0) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< ~state21~0 0) (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~state21~0 0) (<= ~n_update~0 ~state21~0))), Black: 7987#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9108#(not (= ~finished1~0 (* 256 (div ~finished1~0 256)))), 362#L81true, 8089#(<= 0 ~size1~0), 7983#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 427#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 390#true, Black: 425#(<= ~n_queue~0 0), 5973#(and (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 429#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 441#true]) [2022-11-20 11:30:57,571 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-20 11:30:57,571 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 11:30:57,571 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 11:30:57,571 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-20 11:30:57,708 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1209] L73-->L81: Formula: (let ((.cse0 (not |v_thread2_#t~short8#1_66|)) (.cse1 (select (select |v_#memory_int_92| v_~queue1~0.base_59) (+ (* v_~front1~0_96 4) v_~queue1~0.offset_59)))) (and (not (= (ite (and (< v_~state12~0_53 v_~n1~0_26) (<= 0 v_~state12~0_53)) 1 0) 0)) (= (+ v_~size1~0_77 1) v_~size1~0_78) (= v_~front1~0_95 (+ v_~front1~0_96 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (or (and .cse0 (= |v_thread2_#t~mem7#1_42| |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) (= |v_thread2_#t~short8#1_66| |v_thread2_#t~short8#1_65|)) (and (= |v_thread2_#t~mem7#1_42| .cse1) (let ((.cse2 (< |v_thread2_#t~mem7#1_42| v_~n2~0_14))) (or (and .cse2 |v_thread2_#t~short8#1_65|) (and (not |v_thread2_#t~short8#1_65|) (not .cse2)))) |v_thread2_#t~short8#1_66|)) (not (= (ite (< 0 v_~size1~0_78) 1 0) 0)) (= (ite |v_thread2_#t~short8#1_65| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (let ((.cse3 (+ (* v_~state12~0_53 4) v_~consume~0.offset_24))) (select (select |v_#memory_int_92| (select (select |v_#memory_$Pointer$.base_39| v_~consume~0.base_24) .cse3)) (+ (select (select |v_#memory_$Pointer$.offset_39| v_~consume~0.base_24) .cse3) (* 4 .cse1)))) v_~state12~0_52) (let ((.cse4 (<= 0 .cse1))) (or (and .cse0 (not .cse4)) (and |v_thread2_#t~short8#1_66| .cse4))) (not (= (ite (and (<= 0 v_~front1~0_96) (< v_~front1~0_96 v_~n_queue~0_38)) 1 0) 0)))) InVars {~state12~0=v_~state12~0_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, ~front1~0=v_~front1~0_96, ~queue1~0.offset=v_~queue1~0.offset_59, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} OutVars{~state12~0=v_~state12~0_52, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_1|, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_77, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem10#1.offset=|v_thread2Thread1of1ForFork1_#t~mem10#1.offset_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, thread2Thread1of1ForFork1_#t~post13#1=|v_thread2Thread1of1ForFork1_#t~post13#1_1|, thread2Thread1of1ForFork1_#t~short8#1=|v_thread2Thread1of1ForFork1_#t~short8#1_1|, ~front1~0=v_~front1~0_95, ~queue1~0.offset=v_~queue1~0.offset_59, thread2Thread1of1ForFork1_#t~mem10#1.base=|v_thread2Thread1of1ForFork1_#t~mem10#1.base_1|, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} AuxVars[|v_thread2_#t~short8#1_66|, |v_thread2_#t~mem7#1_42|, |v_thread2_#t~short8#1_65|] AssignedVars[~state12~0, thread2Thread1of1ForFork1_#t~post12#1, ~size1~0, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem10#1.offset, thread2Thread1of1ForFork1_#t~post13#1, thread2Thread1of1ForFork1_#t~short8#1, ~front1~0, thread2Thread1of1ForFork1_#t~mem10#1.base][368], [288#L38true, Black: 3535#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 3306#(<= ~state11~0 ~state21~0), Black: 4101#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 8041#(<= 1 ~size1~0), Black: 395#(= ~finished2~0 0), 263#L134-2true, Black: 4099#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 9099#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= 0 ~size1~0)), Black: 4093#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9097#(and (<= 1 ~size1~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 400#(= ~finished1~0 0), Black: 6615#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 6926#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6928#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6930#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 7985#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9107#(or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (not (<= ~size1~0 0)) (= ~finished1~0 (* 256 (div ~finished1~0 256))))) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (= ~finished1~0 (* 256 (div ~finished1~0 256)))))), Black: 8001#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 9110#(and (or (and (not (<= ~size1~0 0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0))) (not (= ~finished1~0 (* 256 (div ~finished1~0 256))))), Black: 8005#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 5975#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~2#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 8009#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (or (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (not |thread3Thread1of1ForFork2_#t~short16#1|)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8011#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7999#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 9114#true, Black: 8007#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8017#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 412#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3165#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~state11~0)) (< ~state21~0 0) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< ~state21~0 0) (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~state21~0 0) (<= ~n_update~0 ~state21~0))), Black: 7987#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9108#(not (= ~finished1~0 (* 256 (div ~finished1~0 256)))), 362#L81true, 8089#(<= 0 ~size1~0), 7983#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 427#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 390#true, Black: 425#(<= ~n_queue~0 0), 5973#(and (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 429#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 441#true]) [2022-11-20 11:30:57,708 INFO L383 tUnfolder$Statistics]: this new event has 341 ancestors and is cut-off event [2022-11-20 11:30:57,709 INFO L386 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2022-11-20 11:30:57,709 INFO L386 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2022-11-20 11:30:57,709 INFO L386 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2022-11-20 11:30:57,940 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1209] L73-->L81: Formula: (let ((.cse0 (not |v_thread2_#t~short8#1_66|)) (.cse1 (select (select |v_#memory_int_92| v_~queue1~0.base_59) (+ (* v_~front1~0_96 4) v_~queue1~0.offset_59)))) (and (not (= (ite (and (< v_~state12~0_53 v_~n1~0_26) (<= 0 v_~state12~0_53)) 1 0) 0)) (= (+ v_~size1~0_77 1) v_~size1~0_78) (= v_~front1~0_95 (+ v_~front1~0_96 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (or (and .cse0 (= |v_thread2_#t~mem7#1_42| |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) (= |v_thread2_#t~short8#1_66| |v_thread2_#t~short8#1_65|)) (and (= |v_thread2_#t~mem7#1_42| .cse1) (let ((.cse2 (< |v_thread2_#t~mem7#1_42| v_~n2~0_14))) (or (and .cse2 |v_thread2_#t~short8#1_65|) (and (not |v_thread2_#t~short8#1_65|) (not .cse2)))) |v_thread2_#t~short8#1_66|)) (not (= (ite (< 0 v_~size1~0_78) 1 0) 0)) (= (ite |v_thread2_#t~short8#1_65| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (let ((.cse3 (+ (* v_~state12~0_53 4) v_~consume~0.offset_24))) (select (select |v_#memory_int_92| (select (select |v_#memory_$Pointer$.base_39| v_~consume~0.base_24) .cse3)) (+ (select (select |v_#memory_$Pointer$.offset_39| v_~consume~0.base_24) .cse3) (* 4 .cse1)))) v_~state12~0_52) (let ((.cse4 (<= 0 .cse1))) (or (and .cse0 (not .cse4)) (and |v_thread2_#t~short8#1_66| .cse4))) (not (= (ite (and (<= 0 v_~front1~0_96) (< v_~front1~0_96 v_~n_queue~0_38)) 1 0) 0)))) InVars {~state12~0=v_~state12~0_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, ~front1~0=v_~front1~0_96, ~queue1~0.offset=v_~queue1~0.offset_59, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} OutVars{~state12~0=v_~state12~0_52, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_1|, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_77, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem10#1.offset=|v_thread2Thread1of1ForFork1_#t~mem10#1.offset_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, thread2Thread1of1ForFork1_#t~post13#1=|v_thread2Thread1of1ForFork1_#t~post13#1_1|, thread2Thread1of1ForFork1_#t~short8#1=|v_thread2Thread1of1ForFork1_#t~short8#1_1|, ~front1~0=v_~front1~0_95, ~queue1~0.offset=v_~queue1~0.offset_59, thread2Thread1of1ForFork1_#t~mem10#1.base=|v_thread2Thread1of1ForFork1_#t~mem10#1.base_1|, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} AuxVars[|v_thread2_#t~short8#1_66|, |v_thread2_#t~mem7#1_42|, |v_thread2_#t~short8#1_65|] AssignedVars[~state12~0, thread2Thread1of1ForFork1_#t~post12#1, ~size1~0, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem10#1.offset, thread2Thread1of1ForFork1_#t~post13#1, thread2Thread1of1ForFork1_#t~short8#1, ~front1~0, thread2Thread1of1ForFork1_#t~mem10#1.base][368], [Black: 3535#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 3306#(<= ~state11~0 ~state21~0), Black: 4101#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 8041#(<= 1 ~size1~0), Black: 395#(= ~finished2~0 0), 263#L134-2true, Black: 4099#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 9099#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= 0 ~size1~0)), Black: 4093#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9097#(and (<= 1 ~size1~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 400#(= ~finished1~0 0), Black: 6615#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 6926#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6928#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6930#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 7985#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9107#(or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (not (<= ~size1~0 0)) (= ~finished1~0 (* 256 (div ~finished1~0 256))))) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (= ~finished1~0 (* 256 (div ~finished1~0 256)))))), Black: 8001#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 9110#(and (or (and (not (<= ~size1~0 0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0))) (not (= ~finished1~0 (* 256 (div ~finished1~0 256))))), Black: 8005#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 5975#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~2#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 8009#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (or (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (not |thread3Thread1of1ForFork2_#t~short16#1|)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8011#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7999#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 9114#true, Black: 8007#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8017#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 412#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3165#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~state11~0)) (< ~state21~0 0) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< ~state21~0 0) (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~state21~0 0) (<= ~n_update~0 ~state21~0))), Black: 7987#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9108#(not (= ~finished1~0 (* 256 (div ~finished1~0 256)))), 362#L81true, 8089#(<= 0 ~size1~0), 7983#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 427#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 390#true, Black: 425#(<= ~n_queue~0 0), 5973#(and (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 429#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 357#L37-1true, 441#true]) [2022-11-20 11:30:57,940 INFO L383 tUnfolder$Statistics]: this new event has 342 ancestors and is cut-off event [2022-11-20 11:30:57,940 INFO L386 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2022-11-20 11:30:57,941 INFO L386 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2022-11-20 11:30:57,941 INFO L386 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2022-11-20 11:30:58,153 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1279] thread3EXIT-->L136-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][427], [Black: 3535#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 3306#(<= ~state11~0 ~state21~0), Black: 395#(= ~finished2~0 0), Black: 4101#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 8041#(<= 1 ~size1~0), Black: 4099#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 9099#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= 0 ~size1~0)), Black: 4093#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9097#(and (<= 1 ~size1~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 400#(= ~finished1~0 0), Black: 6615#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 6926#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6928#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 7985#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6930#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 9107#(or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (not (<= ~size1~0 0)) (= ~finished1~0 (* 256 (div ~finished1~0 256))))) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (= ~finished1~0 (* 256 (div ~finished1~0 256)))))), Black: 8001#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 8005#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 5975#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~2#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 8009#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (or (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (not |thread3Thread1of1ForFork2_#t~short16#1|)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8011#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7999#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 9114#true, Black: 8007#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8017#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 412#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3165#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~state11~0)) (< ~state21~0 0) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< ~state21~0 0) (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~state21~0 0) (<= ~n_update~0 ~state21~0))), Black: 7987#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 8089#(<= 0 ~size1~0), 43#L136-2true, 7983#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 427#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 425#(<= ~n_queue~0 0), 390#true, 5973#(and (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 429#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9110#(and (or (and (not (<= ~size1~0 0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0))) (not (= ~finished1~0 (* 256 (div ~finished1~0 256))))), 441#true]) [2022-11-20 11:30:58,153 INFO L383 tUnfolder$Statistics]: this new event has 346 ancestors and is not cut-off event [2022-11-20 11:30:58,153 INFO L386 tUnfolder$Statistics]: existing Event has 346 ancestors and is not cut-off event [2022-11-20 11:30:58,153 INFO L386 tUnfolder$Statistics]: existing Event has 346 ancestors and is not cut-off event [2022-11-20 11:30:58,153 INFO L386 tUnfolder$Statistics]: existing Event has 346 ancestors and is not cut-off event [2022-11-20 11:30:58,264 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1209] L73-->L81: Formula: (let ((.cse0 (not |v_thread2_#t~short8#1_66|)) (.cse1 (select (select |v_#memory_int_92| v_~queue1~0.base_59) (+ (* v_~front1~0_96 4) v_~queue1~0.offset_59)))) (and (not (= (ite (and (< v_~state12~0_53 v_~n1~0_26) (<= 0 v_~state12~0_53)) 1 0) 0)) (= (+ v_~size1~0_77 1) v_~size1~0_78) (= v_~front1~0_95 (+ v_~front1~0_96 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (or (and .cse0 (= |v_thread2_#t~mem7#1_42| |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) (= |v_thread2_#t~short8#1_66| |v_thread2_#t~short8#1_65|)) (and (= |v_thread2_#t~mem7#1_42| .cse1) (let ((.cse2 (< |v_thread2_#t~mem7#1_42| v_~n2~0_14))) (or (and .cse2 |v_thread2_#t~short8#1_65|) (and (not |v_thread2_#t~short8#1_65|) (not .cse2)))) |v_thread2_#t~short8#1_66|)) (not (= (ite (< 0 v_~size1~0_78) 1 0) 0)) (= (ite |v_thread2_#t~short8#1_65| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (let ((.cse3 (+ (* v_~state12~0_53 4) v_~consume~0.offset_24))) (select (select |v_#memory_int_92| (select (select |v_#memory_$Pointer$.base_39| v_~consume~0.base_24) .cse3)) (+ (select (select |v_#memory_$Pointer$.offset_39| v_~consume~0.base_24) .cse3) (* 4 .cse1)))) v_~state12~0_52) (let ((.cse4 (<= 0 .cse1))) (or (and .cse0 (not .cse4)) (and |v_thread2_#t~short8#1_66| .cse4))) (not (= (ite (and (<= 0 v_~front1~0_96) (< v_~front1~0_96 v_~n_queue~0_38)) 1 0) 0)))) InVars {~state12~0=v_~state12~0_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, ~front1~0=v_~front1~0_96, ~queue1~0.offset=v_~queue1~0.offset_59, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} OutVars{~state12~0=v_~state12~0_52, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_1|, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_77, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem10#1.offset=|v_thread2Thread1of1ForFork1_#t~mem10#1.offset_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, thread2Thread1of1ForFork1_#t~post13#1=|v_thread2Thread1of1ForFork1_#t~post13#1_1|, thread2Thread1of1ForFork1_#t~short8#1=|v_thread2Thread1of1ForFork1_#t~short8#1_1|, ~front1~0=v_~front1~0_95, ~queue1~0.offset=v_~queue1~0.offset_59, thread2Thread1of1ForFork1_#t~mem10#1.base=|v_thread2Thread1of1ForFork1_#t~mem10#1.base_1|, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} AuxVars[|v_thread2_#t~short8#1_66|, |v_thread2_#t~mem7#1_42|, |v_thread2_#t~short8#1_65|] AssignedVars[~state12~0, thread2Thread1of1ForFork1_#t~post12#1, ~size1~0, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem10#1.offset, thread2Thread1of1ForFork1_#t~post13#1, thread2Thread1of1ForFork1_#t~short8#1, ~front1~0, thread2Thread1of1ForFork1_#t~mem10#1.base][368], [Black: 3535#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), 373#L94-1true, Black: 3306#(<= ~state11~0 ~state21~0), Black: 4101#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 8041#(<= 1 ~size1~0), Black: 395#(= ~finished2~0 0), 263#L134-2true, Black: 4099#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 9099#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= 0 ~size1~0)), Black: 4093#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9097#(and (<= 1 ~size1~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 400#(= ~finished1~0 0), Black: 6615#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 6926#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6928#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6930#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 7985#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9107#(or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (not (<= ~size1~0 0)) (= ~finished1~0 (* 256 (div ~finished1~0 256))))) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (= ~finished1~0 (* 256 (div ~finished1~0 256)))))), Black: 8001#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 9110#(and (or (and (not (<= ~size1~0 0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0))) (not (= ~finished1~0 (* 256 (div ~finished1~0 256))))), Black: 8005#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 5975#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~2#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 8009#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (or (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (not |thread3Thread1of1ForFork2_#t~short16#1|)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8011#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7999#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 9114#true, Black: 8007#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8017#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 412#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3165#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~state11~0)) (< ~state21~0 0) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< ~state21~0 0) (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~state21~0 0) (<= ~n_update~0 ~state21~0))), Black: 7987#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9108#(not (= ~finished1~0 (* 256 (div ~finished1~0 256)))), 362#L81true, 8089#(<= 0 ~size1~0), 7983#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 427#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 425#(<= ~n_queue~0 0), 390#true, 5973#(and (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 429#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 441#true]) [2022-11-20 11:30:58,264 INFO L383 tUnfolder$Statistics]: this new event has 350 ancestors and is cut-off event [2022-11-20 11:30:58,265 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-20 11:30:58,265 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-20 11:30:58,265 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-20 11:30:58,302 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1209] L73-->L81: Formula: (let ((.cse0 (not |v_thread2_#t~short8#1_66|)) (.cse1 (select (select |v_#memory_int_92| v_~queue1~0.base_59) (+ (* v_~front1~0_96 4) v_~queue1~0.offset_59)))) (and (not (= (ite (and (< v_~state12~0_53 v_~n1~0_26) (<= 0 v_~state12~0_53)) 1 0) 0)) (= (+ v_~size1~0_77 1) v_~size1~0_78) (= v_~front1~0_95 (+ v_~front1~0_96 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (or (and .cse0 (= |v_thread2_#t~mem7#1_42| |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) (= |v_thread2_#t~short8#1_66| |v_thread2_#t~short8#1_65|)) (and (= |v_thread2_#t~mem7#1_42| .cse1) (let ((.cse2 (< |v_thread2_#t~mem7#1_42| v_~n2~0_14))) (or (and .cse2 |v_thread2_#t~short8#1_65|) (and (not |v_thread2_#t~short8#1_65|) (not .cse2)))) |v_thread2_#t~short8#1_66|)) (not (= (ite (< 0 v_~size1~0_78) 1 0) 0)) (= (ite |v_thread2_#t~short8#1_65| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (let ((.cse3 (+ (* v_~state12~0_53 4) v_~consume~0.offset_24))) (select (select |v_#memory_int_92| (select (select |v_#memory_$Pointer$.base_39| v_~consume~0.base_24) .cse3)) (+ (select (select |v_#memory_$Pointer$.offset_39| v_~consume~0.base_24) .cse3) (* 4 .cse1)))) v_~state12~0_52) (let ((.cse4 (<= 0 .cse1))) (or (and .cse0 (not .cse4)) (and |v_thread2_#t~short8#1_66| .cse4))) (not (= (ite (and (<= 0 v_~front1~0_96) (< v_~front1~0_96 v_~n_queue~0_38)) 1 0) 0)))) InVars {~state12~0=v_~state12~0_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, ~front1~0=v_~front1~0_96, ~queue1~0.offset=v_~queue1~0.offset_59, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} OutVars{~state12~0=v_~state12~0_52, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_1|, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_77, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem10#1.offset=|v_thread2Thread1of1ForFork1_#t~mem10#1.offset_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, thread2Thread1of1ForFork1_#t~post13#1=|v_thread2Thread1of1ForFork1_#t~post13#1_1|, thread2Thread1of1ForFork1_#t~short8#1=|v_thread2Thread1of1ForFork1_#t~short8#1_1|, ~front1~0=v_~front1~0_95, ~queue1~0.offset=v_~queue1~0.offset_59, thread2Thread1of1ForFork1_#t~mem10#1.base=|v_thread2Thread1of1ForFork1_#t~mem10#1.base_1|, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} AuxVars[|v_thread2_#t~short8#1_66|, |v_thread2_#t~mem7#1_42|, |v_thread2_#t~short8#1_65|] AssignedVars[~state12~0, thread2Thread1of1ForFork1_#t~post12#1, ~size1~0, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem10#1.offset, thread2Thread1of1ForFork1_#t~post13#1, thread2Thread1of1ForFork1_#t~short8#1, ~front1~0, thread2Thread1of1ForFork1_#t~mem10#1.base][368], [Black: 3535#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 3306#(<= ~state11~0 ~state21~0), Black: 4101#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 8041#(<= 1 ~size1~0), Black: 395#(= ~finished2~0 0), 263#L134-2true, Black: 4099#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 9099#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= 0 ~size1~0)), Black: 4093#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9097#(and (<= 1 ~size1~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 400#(= ~finished1~0 0), Black: 6615#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 6926#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6928#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6930#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 7985#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9107#(or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (not (<= ~size1~0 0)) (= ~finished1~0 (* 256 (div ~finished1~0 256))))) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (= ~finished1~0 (* 256 (div ~finished1~0 256)))))), Black: 8001#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 9110#(and (or (and (not (<= ~size1~0 0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0))) (not (= ~finished1~0 (* 256 (div ~finished1~0 256))))), Black: 8005#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 5975#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~2#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 8009#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (or (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (not |thread3Thread1of1ForFork2_#t~short16#1|)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8011#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7999#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 9114#true, Black: 8007#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8017#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 412#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3165#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~state11~0)) (< ~state21~0 0) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< ~state21~0 0) (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~state21~0 0) (<= ~n_update~0 ~state21~0))), Black: 7987#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9108#(not (= ~finished1~0 (* 256 (div ~finished1~0 256)))), 362#L81true, 8089#(<= 0 ~size1~0), 7983#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 427#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 425#(<= ~n_queue~0 0), 390#true, 5973#(and (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), 28#L94-2true, Black: 429#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 441#true]) [2022-11-20 11:30:58,302 INFO L383 tUnfolder$Statistics]: this new event has 351 ancestors and is cut-off event [2022-11-20 11:30:58,302 INFO L386 tUnfolder$Statistics]: existing Event has 351 ancestors and is cut-off event [2022-11-20 11:30:58,302 INFO L386 tUnfolder$Statistics]: existing Event has 351 ancestors and is cut-off event [2022-11-20 11:30:58,303 INFO L386 tUnfolder$Statistics]: existing Event has 351 ancestors and is cut-off event [2022-11-20 11:30:58,337 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1209] L73-->L81: Formula: (let ((.cse0 (not |v_thread2_#t~short8#1_66|)) (.cse1 (select (select |v_#memory_int_92| v_~queue1~0.base_59) (+ (* v_~front1~0_96 4) v_~queue1~0.offset_59)))) (and (not (= (ite (and (< v_~state12~0_53 v_~n1~0_26) (<= 0 v_~state12~0_53)) 1 0) 0)) (= (+ v_~size1~0_77 1) v_~size1~0_78) (= v_~front1~0_95 (+ v_~front1~0_96 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (or (and .cse0 (= |v_thread2_#t~mem7#1_42| |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) (= |v_thread2_#t~short8#1_66| |v_thread2_#t~short8#1_65|)) (and (= |v_thread2_#t~mem7#1_42| .cse1) (let ((.cse2 (< |v_thread2_#t~mem7#1_42| v_~n2~0_14))) (or (and .cse2 |v_thread2_#t~short8#1_65|) (and (not |v_thread2_#t~short8#1_65|) (not .cse2)))) |v_thread2_#t~short8#1_66|)) (not (= (ite (< 0 v_~size1~0_78) 1 0) 0)) (= (ite |v_thread2_#t~short8#1_65| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (let ((.cse3 (+ (* v_~state12~0_53 4) v_~consume~0.offset_24))) (select (select |v_#memory_int_92| (select (select |v_#memory_$Pointer$.base_39| v_~consume~0.base_24) .cse3)) (+ (select (select |v_#memory_$Pointer$.offset_39| v_~consume~0.base_24) .cse3) (* 4 .cse1)))) v_~state12~0_52) (let ((.cse4 (<= 0 .cse1))) (or (and .cse0 (not .cse4)) (and |v_thread2_#t~short8#1_66| .cse4))) (not (= (ite (and (<= 0 v_~front1~0_96) (< v_~front1~0_96 v_~n_queue~0_38)) 1 0) 0)))) InVars {~state12~0=v_~state12~0_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, ~front1~0=v_~front1~0_96, ~queue1~0.offset=v_~queue1~0.offset_59, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} OutVars{~state12~0=v_~state12~0_52, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_1|, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_77, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem10#1.offset=|v_thread2Thread1of1ForFork1_#t~mem10#1.offset_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, thread2Thread1of1ForFork1_#t~post13#1=|v_thread2Thread1of1ForFork1_#t~post13#1_1|, thread2Thread1of1ForFork1_#t~short8#1=|v_thread2Thread1of1ForFork1_#t~short8#1_1|, ~front1~0=v_~front1~0_95, ~queue1~0.offset=v_~queue1~0.offset_59, thread2Thread1of1ForFork1_#t~mem10#1.base=|v_thread2Thread1of1ForFork1_#t~mem10#1.base_1|, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} AuxVars[|v_thread2_#t~short8#1_66|, |v_thread2_#t~mem7#1_42|, |v_thread2_#t~short8#1_65|] AssignedVars[~state12~0, thread2Thread1of1ForFork1_#t~post12#1, ~size1~0, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem10#1.offset, thread2Thread1of1ForFork1_#t~post13#1, thread2Thread1of1ForFork1_#t~short8#1, ~front1~0, thread2Thread1of1ForFork1_#t~mem10#1.base][368], [Black: 3535#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 3306#(<= ~state11~0 ~state21~0), Black: 4101#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 8041#(<= 1 ~size1~0), Black: 395#(= ~finished2~0 0), 263#L134-2true, Black: 4099#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 9099#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= 0 ~size1~0)), Black: 4093#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9097#(and (<= 1 ~size1~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 400#(= ~finished1~0 0), Black: 6615#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 6926#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6928#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 7985#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6930#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 9107#(or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (not (<= ~size1~0 0)) (= ~finished1~0 (* 256 (div ~finished1~0 256))))) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (= ~finished1~0 (* 256 (div ~finished1~0 256)))))), Black: 8001#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 9110#(and (or (and (not (<= ~size1~0 0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0))) (not (= ~finished1~0 (* 256 (div ~finished1~0 256))))), Black: 8005#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 5975#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~2#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 8009#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (or (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (not |thread3Thread1of1ForFork2_#t~short16#1|)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8011#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7999#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 9114#true, Black: 8007#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8017#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 412#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3165#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~state11~0)) (< ~state21~0 0) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< ~state21~0 0) (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~state21~0 0) (<= ~n_update~0 ~state21~0))), Black: 7987#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9108#(not (= ~finished1~0 (* 256 (div ~finished1~0 256)))), 362#L81true, 8089#(<= 0 ~size1~0), 7983#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 427#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 390#true, Black: 425#(<= ~n_queue~0 0), 5973#(and (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 429#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 13#L94-3true, 441#true]) [2022-11-20 11:30:58,337 INFO L383 tUnfolder$Statistics]: this new event has 352 ancestors and is cut-off event [2022-11-20 11:30:58,337 INFO L386 tUnfolder$Statistics]: existing Event has 352 ancestors and is cut-off event [2022-11-20 11:30:58,337 INFO L386 tUnfolder$Statistics]: existing Event has 352 ancestors and is cut-off event [2022-11-20 11:30:58,337 INFO L386 tUnfolder$Statistics]: existing Event has 352 ancestors and is cut-off event [2022-11-20 11:30:58,368 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1209] L73-->L81: Formula: (let ((.cse0 (not |v_thread2_#t~short8#1_66|)) (.cse1 (select (select |v_#memory_int_92| v_~queue1~0.base_59) (+ (* v_~front1~0_96 4) v_~queue1~0.offset_59)))) (and (not (= (ite (and (< v_~state12~0_53 v_~n1~0_26) (<= 0 v_~state12~0_53)) 1 0) 0)) (= (+ v_~size1~0_77 1) v_~size1~0_78) (= v_~front1~0_95 (+ v_~front1~0_96 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (or (and .cse0 (= |v_thread2_#t~mem7#1_42| |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) (= |v_thread2_#t~short8#1_66| |v_thread2_#t~short8#1_65|)) (and (= |v_thread2_#t~mem7#1_42| .cse1) (let ((.cse2 (< |v_thread2_#t~mem7#1_42| v_~n2~0_14))) (or (and .cse2 |v_thread2_#t~short8#1_65|) (and (not |v_thread2_#t~short8#1_65|) (not .cse2)))) |v_thread2_#t~short8#1_66|)) (not (= (ite (< 0 v_~size1~0_78) 1 0) 0)) (= (ite |v_thread2_#t~short8#1_65| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (let ((.cse3 (+ (* v_~state12~0_53 4) v_~consume~0.offset_24))) (select (select |v_#memory_int_92| (select (select |v_#memory_$Pointer$.base_39| v_~consume~0.base_24) .cse3)) (+ (select (select |v_#memory_$Pointer$.offset_39| v_~consume~0.base_24) .cse3) (* 4 .cse1)))) v_~state12~0_52) (let ((.cse4 (<= 0 .cse1))) (or (and .cse0 (not .cse4)) (and |v_thread2_#t~short8#1_66| .cse4))) (not (= (ite (and (<= 0 v_~front1~0_96) (< v_~front1~0_96 v_~n_queue~0_38)) 1 0) 0)))) InVars {~state12~0=v_~state12~0_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, ~front1~0=v_~front1~0_96, ~queue1~0.offset=v_~queue1~0.offset_59, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} OutVars{~state12~0=v_~state12~0_52, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_1|, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_77, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem10#1.offset=|v_thread2Thread1of1ForFork1_#t~mem10#1.offset_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, thread2Thread1of1ForFork1_#t~post13#1=|v_thread2Thread1of1ForFork1_#t~post13#1_1|, thread2Thread1of1ForFork1_#t~short8#1=|v_thread2Thread1of1ForFork1_#t~short8#1_1|, ~front1~0=v_~front1~0_95, ~queue1~0.offset=v_~queue1~0.offset_59, thread2Thread1of1ForFork1_#t~mem10#1.base=|v_thread2Thread1of1ForFork1_#t~mem10#1.base_1|, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} AuxVars[|v_thread2_#t~short8#1_66|, |v_thread2_#t~mem7#1_42|, |v_thread2_#t~short8#1_65|] AssignedVars[~state12~0, thread2Thread1of1ForFork1_#t~post12#1, ~size1~0, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem10#1.offset, thread2Thread1of1ForFork1_#t~post13#1, thread2Thread1of1ForFork1_#t~short8#1, ~front1~0, thread2Thread1of1ForFork1_#t~mem10#1.base][368], [Black: 3535#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 3306#(<= ~state11~0 ~state21~0), Black: 4101#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 8041#(<= 1 ~size1~0), Black: 395#(= ~finished2~0 0), 263#L134-2true, Black: 4099#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 9099#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= 0 ~size1~0)), Black: 4093#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9097#(and (<= 1 ~size1~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 400#(= ~finished1~0 0), 124#L94-4true, Black: 6615#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 6926#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6928#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 7985#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6930#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 9107#(or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (not (<= ~size1~0 0)) (= ~finished1~0 (* 256 (div ~finished1~0 256))))) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (= ~finished1~0 (* 256 (div ~finished1~0 256)))))), Black: 8001#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 9110#(and (or (and (not (<= ~size1~0 0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0))) (not (= ~finished1~0 (* 256 (div ~finished1~0 256))))), Black: 8005#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 5975#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~2#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 8009#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (or (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (not |thread3Thread1of1ForFork2_#t~short16#1|)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8011#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7999#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 9114#true, Black: 8007#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8017#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 412#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3165#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~state11~0)) (< ~state21~0 0) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< ~state21~0 0) (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~state21~0 0) (<= ~n_update~0 ~state21~0))), Black: 7987#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9108#(not (= ~finished1~0 (* 256 (div ~finished1~0 256)))), 362#L81true, 8089#(<= 0 ~size1~0), 7983#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 427#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 390#true, Black: 425#(<= ~n_queue~0 0), 5973#(and (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 429#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 441#true]) [2022-11-20 11:30:58,368 INFO L383 tUnfolder$Statistics]: this new event has 353 ancestors and is cut-off event [2022-11-20 11:30:58,368 INFO L386 tUnfolder$Statistics]: existing Event has 353 ancestors and is cut-off event [2022-11-20 11:30:58,368 INFO L386 tUnfolder$Statistics]: existing Event has 353 ancestors and is cut-off event [2022-11-20 11:30:58,368 INFO L386 tUnfolder$Statistics]: existing Event has 353 ancestors and is cut-off event [2022-11-20 11:30:58,399 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1209] L73-->L81: Formula: (let ((.cse0 (not |v_thread2_#t~short8#1_66|)) (.cse1 (select (select |v_#memory_int_92| v_~queue1~0.base_59) (+ (* v_~front1~0_96 4) v_~queue1~0.offset_59)))) (and (not (= (ite (and (< v_~state12~0_53 v_~n1~0_26) (<= 0 v_~state12~0_53)) 1 0) 0)) (= (+ v_~size1~0_77 1) v_~size1~0_78) (= v_~front1~0_95 (+ v_~front1~0_96 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (or (and .cse0 (= |v_thread2_#t~mem7#1_42| |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) (= |v_thread2_#t~short8#1_66| |v_thread2_#t~short8#1_65|)) (and (= |v_thread2_#t~mem7#1_42| .cse1) (let ((.cse2 (< |v_thread2_#t~mem7#1_42| v_~n2~0_14))) (or (and .cse2 |v_thread2_#t~short8#1_65|) (and (not |v_thread2_#t~short8#1_65|) (not .cse2)))) |v_thread2_#t~short8#1_66|)) (not (= (ite (< 0 v_~size1~0_78) 1 0) 0)) (= (ite |v_thread2_#t~short8#1_65| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (let ((.cse3 (+ (* v_~state12~0_53 4) v_~consume~0.offset_24))) (select (select |v_#memory_int_92| (select (select |v_#memory_$Pointer$.base_39| v_~consume~0.base_24) .cse3)) (+ (select (select |v_#memory_$Pointer$.offset_39| v_~consume~0.base_24) .cse3) (* 4 .cse1)))) v_~state12~0_52) (let ((.cse4 (<= 0 .cse1))) (or (and .cse0 (not .cse4)) (and |v_thread2_#t~short8#1_66| .cse4))) (not (= (ite (and (<= 0 v_~front1~0_96) (< v_~front1~0_96 v_~n_queue~0_38)) 1 0) 0)))) InVars {~state12~0=v_~state12~0_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, ~front1~0=v_~front1~0_96, ~queue1~0.offset=v_~queue1~0.offset_59, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} OutVars{~state12~0=v_~state12~0_52, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_1|, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_77, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem10#1.offset=|v_thread2Thread1of1ForFork1_#t~mem10#1.offset_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, thread2Thread1of1ForFork1_#t~post13#1=|v_thread2Thread1of1ForFork1_#t~post13#1_1|, thread2Thread1of1ForFork1_#t~short8#1=|v_thread2Thread1of1ForFork1_#t~short8#1_1|, ~front1~0=v_~front1~0_95, ~queue1~0.offset=v_~queue1~0.offset_59, thread2Thread1of1ForFork1_#t~mem10#1.base=|v_thread2Thread1of1ForFork1_#t~mem10#1.base_1|, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} AuxVars[|v_thread2_#t~short8#1_66|, |v_thread2_#t~mem7#1_42|, |v_thread2_#t~short8#1_65|] AssignedVars[~state12~0, thread2Thread1of1ForFork1_#t~post12#1, ~size1~0, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem10#1.offset, thread2Thread1of1ForFork1_#t~post13#1, thread2Thread1of1ForFork1_#t~short8#1, ~front1~0, thread2Thread1of1ForFork1_#t~mem10#1.base][368], [Black: 3535#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 3306#(<= ~state11~0 ~state21~0), Black: 4101#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 8041#(<= 1 ~size1~0), Black: 395#(= ~finished2~0 0), 263#L134-2true, Black: 4099#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 9099#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= 0 ~size1~0)), Black: 4093#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9097#(and (<= 1 ~size1~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 400#(= ~finished1~0 0), Black: 6615#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 6926#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6928#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6930#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 7985#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9107#(or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (not (<= ~size1~0 0)) (= ~finished1~0 (* 256 (div ~finished1~0 256))))) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (= ~finished1~0 (* 256 (div ~finished1~0 256)))))), Black: 8001#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 9110#(and (or (and (not (<= ~size1~0 0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0))) (not (= ~finished1~0 (* 256 (div ~finished1~0 256))))), Black: 8005#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 5975#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~2#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 8009#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (or (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (not |thread3Thread1of1ForFork2_#t~short16#1|)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8011#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7999#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 9114#true, Black: 8007#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8017#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 75#L94-6true, Black: 412#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3165#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~state11~0)) (< ~state21~0 0) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< ~state21~0 0) (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~state21~0 0) (<= ~n_update~0 ~state21~0))), Black: 7987#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9108#(not (= ~finished1~0 (* 256 (div ~finished1~0 256)))), 362#L81true, 8089#(<= 0 ~size1~0), 7983#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 427#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 425#(<= ~n_queue~0 0), 390#true, 5973#(and (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 429#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 441#true]) [2022-11-20 11:30:58,399 INFO L383 tUnfolder$Statistics]: this new event has 354 ancestors and is cut-off event [2022-11-20 11:30:58,400 INFO L386 tUnfolder$Statistics]: existing Event has 354 ancestors and is cut-off event [2022-11-20 11:30:58,400 INFO L386 tUnfolder$Statistics]: existing Event has 354 ancestors and is cut-off event [2022-11-20 11:30:58,400 INFO L386 tUnfolder$Statistics]: existing Event has 354 ancestors and is cut-off event [2022-11-20 11:30:58,467 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1209] L73-->L81: Formula: (let ((.cse0 (not |v_thread2_#t~short8#1_66|)) (.cse1 (select (select |v_#memory_int_92| v_~queue1~0.base_59) (+ (* v_~front1~0_96 4) v_~queue1~0.offset_59)))) (and (not (= (ite (and (< v_~state12~0_53 v_~n1~0_26) (<= 0 v_~state12~0_53)) 1 0) 0)) (= (+ v_~size1~0_77 1) v_~size1~0_78) (= v_~front1~0_95 (+ v_~front1~0_96 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (or (and .cse0 (= |v_thread2_#t~mem7#1_42| |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) (= |v_thread2_#t~short8#1_66| |v_thread2_#t~short8#1_65|)) (and (= |v_thread2_#t~mem7#1_42| .cse1) (let ((.cse2 (< |v_thread2_#t~mem7#1_42| v_~n2~0_14))) (or (and .cse2 |v_thread2_#t~short8#1_65|) (and (not |v_thread2_#t~short8#1_65|) (not .cse2)))) |v_thread2_#t~short8#1_66|)) (not (= (ite (< 0 v_~size1~0_78) 1 0) 0)) (= (ite |v_thread2_#t~short8#1_65| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (let ((.cse3 (+ (* v_~state12~0_53 4) v_~consume~0.offset_24))) (select (select |v_#memory_int_92| (select (select |v_#memory_$Pointer$.base_39| v_~consume~0.base_24) .cse3)) (+ (select (select |v_#memory_$Pointer$.offset_39| v_~consume~0.base_24) .cse3) (* 4 .cse1)))) v_~state12~0_52) (let ((.cse4 (<= 0 .cse1))) (or (and .cse0 (not .cse4)) (and |v_thread2_#t~short8#1_66| .cse4))) (not (= (ite (and (<= 0 v_~front1~0_96) (< v_~front1~0_96 v_~n_queue~0_38)) 1 0) 0)))) InVars {~state12~0=v_~state12~0_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, ~front1~0=v_~front1~0_96, ~queue1~0.offset=v_~queue1~0.offset_59, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} OutVars{~state12~0=v_~state12~0_52, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_1|, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_77, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem10#1.offset=|v_thread2Thread1of1ForFork1_#t~mem10#1.offset_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, thread2Thread1of1ForFork1_#t~post13#1=|v_thread2Thread1of1ForFork1_#t~post13#1_1|, thread2Thread1of1ForFork1_#t~short8#1=|v_thread2Thread1of1ForFork1_#t~short8#1_1|, ~front1~0=v_~front1~0_95, ~queue1~0.offset=v_~queue1~0.offset_59, thread2Thread1of1ForFork1_#t~mem10#1.base=|v_thread2Thread1of1ForFork1_#t~mem10#1.base_1|, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} AuxVars[|v_thread2_#t~short8#1_66|, |v_thread2_#t~mem7#1_42|, |v_thread2_#t~short8#1_65|] AssignedVars[~state12~0, thread2Thread1of1ForFork1_#t~post12#1, ~size1~0, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem10#1.offset, thread2Thread1of1ForFork1_#t~post13#1, thread2Thread1of1ForFork1_#t~short8#1, ~front1~0, thread2Thread1of1ForFork1_#t~mem10#1.base][368], [Black: 3535#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 3306#(<= ~state11~0 ~state21~0), Black: 4101#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 8041#(<= 1 ~size1~0), Black: 395#(= ~finished2~0 0), 263#L134-2true, Black: 4099#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 9099#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= 0 ~size1~0)), Black: 4093#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9097#(and (<= 1 ~size1~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 400#(= ~finished1~0 0), Black: 6615#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 6926#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6928#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6930#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 7985#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9107#(or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (not (<= ~size1~0 0)) (= ~finished1~0 (* 256 (div ~finished1~0 256))))) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (= ~finished1~0 (* 256 (div ~finished1~0 256)))))), Black: 8001#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 9110#(and (or (and (not (<= ~size1~0 0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0))) (not (= ~finished1~0 (* 256 (div ~finished1~0 256))))), Black: 8005#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 5975#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~2#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 8009#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (or (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (not |thread3Thread1of1ForFork2_#t~short16#1|)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8011#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7999#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 9114#true, Black: 8007#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 285#L94-8true, Black: 8017#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 412#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3165#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~state11~0)) (< ~state21~0 0) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< ~state21~0 0) (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~state21~0 0) (<= ~n_update~0 ~state21~0))), Black: 7987#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9108#(not (= ~finished1~0 (* 256 (div ~finished1~0 256)))), 362#L81true, 8089#(<= 0 ~size1~0), 7983#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 427#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 390#true, Black: 425#(<= ~n_queue~0 0), 5973#(and (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 429#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 441#true]) [2022-11-20 11:30:58,467 INFO L383 tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event [2022-11-20 11:30:58,467 INFO L386 tUnfolder$Statistics]: existing Event has 356 ancestors and is cut-off event [2022-11-20 11:30:58,467 INFO L386 tUnfolder$Statistics]: existing Event has 356 ancestors and is cut-off event [2022-11-20 11:30:58,467 INFO L386 tUnfolder$Statistics]: existing Event has 356 ancestors and is cut-off event [2022-11-20 11:30:58,519 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1209] L73-->L81: Formula: (let ((.cse0 (not |v_thread2_#t~short8#1_66|)) (.cse1 (select (select |v_#memory_int_92| v_~queue1~0.base_59) (+ (* v_~front1~0_96 4) v_~queue1~0.offset_59)))) (and (not (= (ite (and (< v_~state12~0_53 v_~n1~0_26) (<= 0 v_~state12~0_53)) 1 0) 0)) (= (+ v_~size1~0_77 1) v_~size1~0_78) (= v_~front1~0_95 (+ v_~front1~0_96 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (or (and .cse0 (= |v_thread2_#t~mem7#1_42| |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) (= |v_thread2_#t~short8#1_66| |v_thread2_#t~short8#1_65|)) (and (= |v_thread2_#t~mem7#1_42| .cse1) (let ((.cse2 (< |v_thread2_#t~mem7#1_42| v_~n2~0_14))) (or (and .cse2 |v_thread2_#t~short8#1_65|) (and (not |v_thread2_#t~short8#1_65|) (not .cse2)))) |v_thread2_#t~short8#1_66|)) (not (= (ite (< 0 v_~size1~0_78) 1 0) 0)) (= (ite |v_thread2_#t~short8#1_65| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (let ((.cse3 (+ (* v_~state12~0_53 4) v_~consume~0.offset_24))) (select (select |v_#memory_int_92| (select (select |v_#memory_$Pointer$.base_39| v_~consume~0.base_24) .cse3)) (+ (select (select |v_#memory_$Pointer$.offset_39| v_~consume~0.base_24) .cse3) (* 4 .cse1)))) v_~state12~0_52) (let ((.cse4 (<= 0 .cse1))) (or (and .cse0 (not .cse4)) (and |v_thread2_#t~short8#1_66| .cse4))) (not (= (ite (and (<= 0 v_~front1~0_96) (< v_~front1~0_96 v_~n_queue~0_38)) 1 0) 0)))) InVars {~state12~0=v_~state12~0_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, ~front1~0=v_~front1~0_96, ~queue1~0.offset=v_~queue1~0.offset_59, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} OutVars{~state12~0=v_~state12~0_52, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_1|, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_77, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem10#1.offset=|v_thread2Thread1of1ForFork1_#t~mem10#1.offset_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, thread2Thread1of1ForFork1_#t~post13#1=|v_thread2Thread1of1ForFork1_#t~post13#1_1|, thread2Thread1of1ForFork1_#t~short8#1=|v_thread2Thread1of1ForFork1_#t~short8#1_1|, ~front1~0=v_~front1~0_95, ~queue1~0.offset=v_~queue1~0.offset_59, thread2Thread1of1ForFork1_#t~mem10#1.base=|v_thread2Thread1of1ForFork1_#t~mem10#1.base_1|, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} AuxVars[|v_thread2_#t~short8#1_66|, |v_thread2_#t~mem7#1_42|, |v_thread2_#t~short8#1_65|] AssignedVars[~state12~0, thread2Thread1of1ForFork1_#t~post12#1, ~size1~0, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem10#1.offset, thread2Thread1of1ForFork1_#t~post13#1, thread2Thread1of1ForFork1_#t~short8#1, ~front1~0, thread2Thread1of1ForFork1_#t~mem10#1.base][368], [Black: 3535#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 3306#(<= ~state11~0 ~state21~0), Black: 4101#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 8041#(<= 1 ~size1~0), Black: 395#(= ~finished2~0 0), 263#L134-2true, Black: 4099#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 9099#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= 0 ~size1~0)), Black: 4093#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9097#(and (<= 1 ~size1~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 400#(= ~finished1~0 0), 147#L38-6true, Black: 6615#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 6926#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6928#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6930#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 7985#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9107#(or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (not (<= ~size1~0 0)) (= ~finished1~0 (* 256 (div ~finished1~0 256))))) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (= ~finished1~0 (* 256 (div ~finished1~0 256)))))), Black: 8001#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 9110#(and (or (and (not (<= ~size1~0 0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0))) (not (= ~finished1~0 (* 256 (div ~finished1~0 256))))), Black: 8005#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 5975#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~2#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 8009#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (or (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (not |thread3Thread1of1ForFork2_#t~short16#1|)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8011#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7999#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 9114#true, Black: 8007#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8017#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 412#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3165#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~state11~0)) (< ~state21~0 0) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< ~state21~0 0) (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~state21~0 0) (<= ~n_update~0 ~state21~0))), Black: 7987#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9108#(not (= ~finished1~0 (* 256 (div ~finished1~0 256)))), 362#L81true, 8089#(<= 0 ~size1~0), 7983#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 427#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 425#(<= ~n_queue~0 0), 390#true, 5973#(and (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 429#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 441#true]) [2022-11-20 11:30:58,519 INFO L383 tUnfolder$Statistics]: this new event has 358 ancestors and is cut-off event [2022-11-20 11:30:58,519 INFO L386 tUnfolder$Statistics]: existing Event has 358 ancestors and is cut-off event [2022-11-20 11:30:58,519 INFO L386 tUnfolder$Statistics]: existing Event has 358 ancestors and is cut-off event [2022-11-20 11:30:58,519 INFO L386 tUnfolder$Statistics]: existing Event has 358 ancestors and is cut-off event [2022-11-20 11:30:58,549 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1209] L73-->L81: Formula: (let ((.cse0 (not |v_thread2_#t~short8#1_66|)) (.cse1 (select (select |v_#memory_int_92| v_~queue1~0.base_59) (+ (* v_~front1~0_96 4) v_~queue1~0.offset_59)))) (and (not (= (ite (and (< v_~state12~0_53 v_~n1~0_26) (<= 0 v_~state12~0_53)) 1 0) 0)) (= (+ v_~size1~0_77 1) v_~size1~0_78) (= v_~front1~0_95 (+ v_~front1~0_96 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (or (and .cse0 (= |v_thread2_#t~mem7#1_42| |v_thread2Thread1of1ForFork1_#t~mem7#1_1|) (= |v_thread2_#t~short8#1_66| |v_thread2_#t~short8#1_65|)) (and (= |v_thread2_#t~mem7#1_42| .cse1) (let ((.cse2 (< |v_thread2_#t~mem7#1_42| v_~n2~0_14))) (or (and .cse2 |v_thread2_#t~short8#1_65|) (and (not |v_thread2_#t~short8#1_65|) (not .cse2)))) |v_thread2_#t~short8#1_66|)) (not (= (ite (< 0 v_~size1~0_78) 1 0) 0)) (= (ite |v_thread2_#t~short8#1_65| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (let ((.cse3 (+ (* v_~state12~0_53 4) v_~consume~0.offset_24))) (select (select |v_#memory_int_92| (select (select |v_#memory_$Pointer$.base_39| v_~consume~0.base_24) .cse3)) (+ (select (select |v_#memory_$Pointer$.offset_39| v_~consume~0.base_24) .cse3) (* 4 .cse1)))) v_~state12~0_52) (let ((.cse4 (<= 0 .cse1))) (or (and .cse0 (not .cse4)) (and |v_thread2_#t~short8#1_66| .cse4))) (not (= (ite (and (<= 0 v_~front1~0_96) (< v_~front1~0_96 v_~n_queue~0_38)) 1 0) 0)))) InVars {~state12~0=v_~state12~0_53, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_78, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, ~front1~0=v_~front1~0_96, ~queue1~0.offset=v_~queue1~0.offset_59, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} OutVars{~state12~0=v_~state12~0_52, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_39|, ~n2~0=v_~n2~0_14, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_1|, ~n1~0=v_~n1~0_26, ~size1~0=v_~size1~0_77, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem10#1.offset=|v_thread2Thread1of1ForFork1_#t~mem10#1.offset_1|, ~queue1~0.base=v_~queue1~0.base_59, ~n_queue~0=v_~n_queue~0_38, ~consume~0.base=v_~consume~0.base_24, #memory_int=|v_#memory_int_92|, thread2Thread1of1ForFork1_#t~post13#1=|v_thread2Thread1of1ForFork1_#t~post13#1_1|, thread2Thread1of1ForFork1_#t~short8#1=|v_thread2Thread1of1ForFork1_#t~short8#1_1|, ~front1~0=v_~front1~0_95, ~queue1~0.offset=v_~queue1~0.offset_59, thread2Thread1of1ForFork1_#t~mem10#1.base=|v_thread2Thread1of1ForFork1_#t~mem10#1.base_1|, ~consume~0.offset=v_~consume~0.offset_24, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_39|} AuxVars[|v_thread2_#t~short8#1_66|, |v_thread2_#t~mem7#1_42|, |v_thread2_#t~short8#1_65|] AssignedVars[~state12~0, thread2Thread1of1ForFork1_#t~post12#1, ~size1~0, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem10#1.offset, thread2Thread1of1ForFork1_#t~post13#1, thread2Thread1of1ForFork1_#t~short8#1, ~front1~0, thread2Thread1of1ForFork1_#t~mem10#1.base][368], [Black: 3535#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 3306#(<= ~state11~0 ~state21~0), Black: 4101#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 8041#(<= 1 ~size1~0), Black: 395#(= ~finished2~0 0), 263#L134-2true, Black: 4099#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~state11~0 ~state21~0) (<= ~n_update~0 0)), Black: 9099#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= 0 ~size1~0)), Black: 4093#(and (<= ~state11~0 ~state21~0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_update~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 9097#(and (<= 1 ~size1~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)), Black: 400#(= ~finished1~0 0), Black: 6615#(<= |ULTIMATE.start_main_~i~0#1| 0), Black: 6926#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 6928#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0)), Black: 7985#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6930#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= ~n1~0 0) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|)), Black: 9107#(or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (not (<= ~size1~0 0)) (= ~finished1~0 (* 256 (div ~finished1~0 256))))) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (= ~finished1~0 (* 256 (div ~finished1~0 256)))))), Black: 8001#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 9110#(and (or (and (not (<= ~size1~0 0)) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (and (<= ~size1~0 0) (= |thread2Thread1of1ForFork1_~cond~0#1| 0))) (not (= ~finished1~0 (* 256 (div ~finished1~0 256))))), Black: 8005#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1|) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 5975#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~2#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), 168#L37-5true, Black: 8009#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (or (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (not |thread3Thread1of1ForFork2_#t~short16#1|)) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8011#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 7999#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), 9114#true, Black: 8007#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 8017#(and (= 0 |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= |thread3Thread1of1ForFork2_#t~mem14#1| (select (select |#memory_int| ~produce~0.base) (+ ~produce~0.offset (* ~state21~0 4)))) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short16#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 |thread3Thread1of1ForFork2_#t~mem15#1|)), Black: 412#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3165#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~state11~0)) (< ~state21~0 0) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< ~state21~0 0) (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_update~0 ~state21~0)) (or (not (<= 0 ~state11~0)) (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~state21~0 0) (<= ~n_update~0 ~state21~0))), Black: 7987#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9108#(not (= ~finished1~0 (* 256 (div ~finished1~0 256)))), 362#L81true, 8089#(<= 0 ~size1~0), 7983#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 427#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 390#true, Black: 425#(<= ~n_queue~0 0), 5973#(and (<= 1 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 1 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 1 ~n_update~0)), Black: 429#(and (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_queue~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 441#true]) [2022-11-20 11:30:58,549 INFO L383 tUnfolder$Statistics]: this new event has 359 ancestors and is cut-off event [2022-11-20 11:30:58,550 INFO L386 tUnfolder$Statistics]: existing Event has 359 ancestors and is cut-off event [2022-11-20 11:30:58,550 INFO L386 tUnfolder$Statistics]: existing Event has 359 ancestors and is cut-off event [2022-11-20 11:30:58,550 INFO L386 tUnfolder$Statistics]: existing Event has 359 ancestors and is cut-off event [2022-11-20 11:30:59,203 INFO L130 PetriNetUnfolder]: 2957/10584 cut-off events. [2022-11-20 11:30:59,203 INFO L131 PetriNetUnfolder]: For 552387/610308 co-relation queries the response was YES. [2022-11-20 11:30:59,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47580 conditions, 10584 events. 2957/10584 cut-off events. For 552387/610308 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 100621 event pairs, 915 based on Foata normal form. 974/10483 useless extension candidates. Maximal degree in co-relation 47542. Up to 1975 conditions per place. [2022-11-20 11:30:59,371 INFO L137 encePairwiseOnDemand]: 408/414 looper letters, 65 selfloop transitions, 21 changer transitions 0/437 dead transitions. [2022-11-20 11:30:59,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 437 transitions, 2055 flow [2022-11-20 11:30:59,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:30:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 11:30:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1890 transitions. [2022-11-20 11:30:59,375 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2022-11-20 11:30:59,376 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1890 transitions. [2022-11-20 11:30:59,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1890 transitions. [2022-11-20 11:30:59,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:30:59,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1890 transitions. [2022-11-20 11:30:59,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 378.0) internal successors, (1890), 5 states have internal predecessors, (1890), 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) [2022-11-20 11:30:59,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 414.0) internal successors, (2484), 6 states have internal predecessors, (2484), 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) [2022-11-20 11:30:59,385 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 414.0) internal successors, (2484), 6 states have internal predecessors, (2484), 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) [2022-11-20 11:30:59,386 INFO L175 Difference]: Start difference. First operand has 407 places, 395 transitions, 1321 flow. Second operand 5 states and 1890 transitions. [2022-11-20 11:30:59,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 437 transitions, 2055 flow [2022-11-20 11:30:59,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 437 transitions, 2021 flow, removed 17 selfloop flow, removed 0 redundant places. [2022-11-20 11:30:59,422 INFO L231 Difference]: Finished difference. Result has 415 places, 406 transitions, 1505 flow [2022-11-20 11:30:59,423 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=1281, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1505, PETRI_PLACES=415, PETRI_TRANSITIONS=406} [2022-11-20 11:30:59,424 INFO L288 CegarLoopForPetriNet]: 373 programPoint places, 42 predicate places. [2022-11-20 11:30:59,424 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 406 transitions, 1505 flow [2022-11-20 11:30:59,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 373.25) internal successors, (1493), 4 states have internal predecessors, (1493), 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) [2022-11-20 11:30:59,425 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:30:59,425 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:30:59,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 11:30:59,426 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 11:30:59,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:30:59,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1310153445, now seen corresponding path program 1 times [2022-11-20 11:30:59,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:30:59,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88040341] [2022-11-20 11:30:59,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:30:59,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:31:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 11:31:20,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:31:20,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88040341] [2022-11-20 11:31:20,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88040341] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:31:20,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093466593] [2022-11-20 11:31:20,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:31:20,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:31:20,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:31:20,419 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:31:20,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6a6942-af81-4303-9dc6-66ec7b4ef3c6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 11:31:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:31:20,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-20 11:31:20,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:31:25,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 11:31:25,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:31:25,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:31:26,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:31:29,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2022-11-20 11:31:29,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-11-20 11:31:30,503 INFO L321 Elim1Store]: treesize reduction 57, result has 38.7 percent of original size [2022-11-20 11:31:30,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 68 [2022-11-20 11:31:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:31:30,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:31:33,147 INFO L321 Elim1Store]: treesize reduction 4, result has 97.1 percent of original size [2022-11-20 11:31:33,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 186 [2022-11-20 11:31:33,189 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:31:33,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 152 [2022-11-20 11:31:35,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-11-20 11:31:35,775 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 11:31:35,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 90 [2022-11-20 11:31:35,974 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 11:31:35,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 14 [2022-11-20 11:31:36,165 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 11:31:36,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 14 [2022-11-20 11:31:36,338 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 11:31:36,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 14 [2022-11-20 11:31:36,513 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 11:31:36,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 14 [2022-11-20 11:31:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:31:39,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093466593] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:31:39,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:31:39,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 36, 28] total 113 [2022-11-20 11:31:39,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790486714] [2022-11-20 11:31:39,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:31:39,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 113 states [2022-11-20 11:31:39,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:31:39,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2022-11-20 11:31:39,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=12054, Unknown=0, NotChecked=0, Total=12656 [2022-11-20 11:31:39,521 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 414 [2022-11-20 11:31:39,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 406 transitions, 1505 flow. Second operand has 113 states, 113 states have (on average 151.20353982300884) internal successors, (17086), 113 states have internal predecessors, (17086), 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) [2022-11-20 11:31:39,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:31:39,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 414 [2022-11-20 11:31:39,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand