./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc --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 675e4a71573eb5ca191c78078c954ea41743d39a46f0fa586376ee48e7dc4190 --- 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-5e519f3 [2022-11-02 20:18:40,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:18:40,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:18:41,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:18:41,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:18:41,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:18:41,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:18:41,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:18:41,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:18:41,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:18:41,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:18:41,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:18:41,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:18:41,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:18:41,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:18:41,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:18:41,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:18:41,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:18:41,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:18:41,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:18:41,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:18:41,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:18:41,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:18:41,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:18:41,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:18:41,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:18:41,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:18:41,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:18:41,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:18:41,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:18:41,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:18:41,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:18:41,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:18:41,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:18:41,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:18:41,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:18:41,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:18:41,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:18:41,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:18:41,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:18:41,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:18:41,088 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:18:41,135 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:18:41,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:18:41,136 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:18:41,137 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:18:41,138 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:18:41,138 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:18:41,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:18:41,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:18:41,139 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:18:41,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:18:41,141 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:18:41,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:18:41,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:18:41,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:18:41,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:18:41,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:18:41,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:18:41,143 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:18:41,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:18:41,143 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:18:41,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:18:41,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:18:41,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:18:41,145 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:18:41,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:18:41,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:18:41,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:18:41,146 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:18:41,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:18:41,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:18:41,146 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:18:41,147 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:18:41,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:18:41,147 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_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/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_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc 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 -> 675e4a71573eb5ca191c78078c954ea41743d39a46f0fa586376ee48e7dc4190 [2022-11-02 20:18:41,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:18:41,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:18:41,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:18:41,531 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:18:41,532 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:18:41,533 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2022-11-02 20:18:41,622 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/data/99e7819cc/73f317844f354f358879194b08047766/FLAGa1c6affab [2022-11-02 20:18:42,193 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:18:42,194 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2022-11-02 20:18:42,202 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/data/99e7819cc/73f317844f354f358879194b08047766/FLAGa1c6affab [2022-11-02 20:18:42,528 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/data/99e7819cc/73f317844f354f358879194b08047766 [2022-11-02 20:18:42,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:18:42,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:18:42,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:18:42,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:18:42,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:18:42,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:18:42" (1/1) ... [2022-11-02 20:18:42,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57807872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:42, skipping insertion in model container [2022-11-02 20:18:42,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:18:42" (1/1) ... [2022-11-02 20:18:42,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:18:42,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:18:42,881 WARN L230 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_28b52913-7d08-4845-b5ca-475722eb7669/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c[4351,4364] [2022-11-02 20:18:42,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:18:42,917 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:18:42,969 WARN L230 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_28b52913-7d08-4845-b5ca-475722eb7669/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c[4351,4364] [2022-11-02 20:18:42,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:18:42,989 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:18:42,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:42 WrapperNode [2022-11-02 20:18:42,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:18:42,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:18:42,991 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:18:42,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:18:43,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:42" (1/1) ... [2022-11-02 20:18:43,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:42" (1/1) ... [2022-11-02 20:18:43,079 INFO L138 Inliner]: procedures = 27, calls = 87, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 350 [2022-11-02 20:18:43,079 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:18:43,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:18:43,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:18:43,080 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:18:43,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:42" (1/1) ... [2022-11-02 20:18:43,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:42" (1/1) ... [2022-11-02 20:18:43,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:42" (1/1) ... [2022-11-02 20:18:43,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:42" (1/1) ... [2022-11-02 20:18:43,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:42" (1/1) ... [2022-11-02 20:18:43,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:42" (1/1) ... [2022-11-02 20:18:43,144 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:42" (1/1) ... [2022-11-02 20:18:43,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:42" (1/1) ... [2022-11-02 20:18:43,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:18:43,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:18:43,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:18:43,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:18:43,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:42" (1/1) ... [2022-11-02 20:18:43,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:18:43,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:18:43,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:18:43,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:18:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:18:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:18:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:18:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:18:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:18:43,254 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:18:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:18:43,254 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:18:43,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:18:43,256 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:18:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-02 20:18:43,256 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-02 20:18:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:18:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:18:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:18:43,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:18:43,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:18:43,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:18:43,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:18:43,259 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:18:43,448 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:18:43,464 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:18:44,047 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:18:44,304 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:18:44,304 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-11-02 20:18:44,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:18:44 BoogieIcfgContainer [2022-11-02 20:18:44,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:18:44,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:18:44,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:18:44,314 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:18:44,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:18:42" (1/3) ... [2022-11-02 20:18:44,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b0b1c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:18:44, skipping insertion in model container [2022-11-02 20:18:44,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:42" (2/3) ... [2022-11-02 20:18:44,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b0b1c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:18:44, skipping insertion in model container [2022-11-02 20:18:44,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:18:44" (3/3) ... [2022-11-02 20:18:44,334 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series.wvr.c [2022-11-02 20:18:44,344 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:18:44,355 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:18:44,355 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:18:44,355 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:18:44,499 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-02 20:18:44,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 267 transitions, 566 flow [2022-11-02 20:18:44,764 INFO L130 PetriNetUnfolder]: 22/263 cut-off events. [2022-11-02 20:18:44,764 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:18:44,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 263 events. 22/263 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 135 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2022-11-02 20:18:44,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 258 places, 267 transitions, 566 flow [2022-11-02 20:18:44,781 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 241 places, 250 transitions, 524 flow [2022-11-02 20:18:44,804 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:18:44,814 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;@760fed3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:18:44,814 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-02 20:18:44,902 INFO L130 PetriNetUnfolder]: 22/249 cut-off events. [2022-11-02 20:18:44,902 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:18:44,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:18:44,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:18:44,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:18:44,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:44,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1654884382, now seen corresponding path program 1 times [2022-11-02 20:18:44,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:44,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301390643] [2022-11-02 20:18:44,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:44,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:45,428 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-02 20:18:45,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:45,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301390643] [2022-11-02 20:18:45,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301390643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:45,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:45,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:18:45,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077529067] [2022-11-02 20:18:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:45,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:18:45,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:45,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:18:45,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:18:45,494 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 267 [2022-11-02 20:18:45,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 250 transitions, 524 flow. Second operand has 2 states, 2 states have (on average 242.5) internal successors, (485), 2 states have internal predecessors, (485), 0 states have call successors, (0), 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-02 20:18:45,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:18:45,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 267 [2022-11-02 20:18:45,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:18:45,793 INFO L130 PetriNetUnfolder]: 227/786 cut-off events. [2022-11-02 20:18:45,793 INFO L131 PetriNetUnfolder]: For 146/147 co-relation queries the response was YES. [2022-11-02 20:18:45,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 786 events. 227/786 cut-off events. For 146/147 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3404 event pairs, 121 based on Foata normal form. 200/898 useless extension candidates. Maximal degree in co-relation 906. Up to 306 conditions per place. [2022-11-02 20:18:45,805 INFO L137 encePairwiseOnDemand]: 252/267 looper letters, 14 selfloop transitions, 0 changer transitions 8/235 dead transitions. [2022-11-02 20:18:45,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 235 transitions, 522 flow [2022-11-02 20:18:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:18:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 20:18:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 503 transitions. [2022-11-02 20:18:45,820 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9419475655430711 [2022-11-02 20:18:45,821 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 503 transitions. [2022-11-02 20:18:45,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 503 transitions. [2022-11-02 20:18:45,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:18:45,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 503 transitions. [2022-11-02 20:18:45,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 251.5) internal successors, (503), 2 states have internal predecessors, (503), 0 states have call successors, (0), 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-02 20:18:45,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 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-02 20:18:45,837 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 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-02 20:18:45,839 INFO L175 Difference]: Start difference. First operand has 241 places, 250 transitions, 524 flow. Second operand 2 states and 503 transitions. [2022-11-02 20:18:45,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 235 transitions, 522 flow [2022-11-02 20:18:45,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 235 transitions, 506 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-02 20:18:45,850 INFO L231 Difference]: Finished difference. Result has 234 places, 227 transitions, 462 flow [2022-11-02 20:18:45,853 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=462, PETRI_PLACES=234, PETRI_TRANSITIONS=227} [2022-11-02 20:18:45,856 INFO L287 CegarLoopForPetriNet]: 241 programPoint places, -7 predicate places. [2022-11-02 20:18:45,857 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 227 transitions, 462 flow [2022-11-02 20:18:45,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 242.5) internal successors, (485), 2 states have internal predecessors, (485), 0 states have call successors, (0), 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-02 20:18:45,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:18:45,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:18:45,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:18:45,859 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:18:45,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:45,859 INFO L85 PathProgramCache]: Analyzing trace with hash -384006521, now seen corresponding path program 1 times [2022-11-02 20:18:45,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:45,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489748606] [2022-11-02 20:18:45,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:45,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:46,616 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-02 20:18:46,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:46,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489748606] [2022-11-02 20:18:46,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489748606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:46,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:46,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:18:46,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347206032] [2022-11-02 20:18:46,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:46,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:18:46,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:46,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:18:46,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:18:46,635 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 267 [2022-11-02 20:18:46,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 227 transitions, 462 flow. Second operand has 5 states, 5 states have (on average 204.2) internal successors, (1021), 5 states have internal predecessors, (1021), 0 states have call successors, (0), 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-02 20:18:46,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:18:46,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 267 [2022-11-02 20:18:46,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:18:47,056 INFO L130 PetriNetUnfolder]: 252/862 cut-off events. [2022-11-02 20:18:47,057 INFO L131 PetriNetUnfolder]: For 39/40 co-relation queries the response was YES. [2022-11-02 20:18:47,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 862 events. 252/862 cut-off events. For 39/40 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3927 event pairs, 32 based on Foata normal form. 1/778 useless extension candidates. Maximal degree in co-relation 1263. Up to 249 conditions per place. [2022-11-02 20:18:47,067 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 54 selfloop transitions, 3 changer transitions 4/241 dead transitions. [2022-11-02 20:18:47,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 241 transitions, 617 flow [2022-11-02 20:18:47,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:18:47,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:18:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1042 transitions. [2022-11-02 20:18:47,075 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7805243445692884 [2022-11-02 20:18:47,075 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1042 transitions. [2022-11-02 20:18:47,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1042 transitions. [2022-11-02 20:18:47,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:18:47,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1042 transitions. [2022-11-02 20:18:47,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 208.4) internal successors, (1042), 5 states have internal predecessors, (1042), 0 states have call successors, (0), 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-02 20:18:47,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 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-02 20:18:47,087 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 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-02 20:18:47,087 INFO L175 Difference]: Start difference. First operand has 234 places, 227 transitions, 462 flow. Second operand 5 states and 1042 transitions. [2022-11-02 20:18:47,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 241 transitions, 617 flow [2022-11-02 20:18:47,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 241 transitions, 617 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:18:47,100 INFO L231 Difference]: Finished difference. Result has 233 places, 229 transitions, 485 flow [2022-11-02 20:18:47,101 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=485, PETRI_PLACES=233, PETRI_TRANSITIONS=229} [2022-11-02 20:18:47,101 INFO L287 CegarLoopForPetriNet]: 241 programPoint places, -8 predicate places. [2022-11-02 20:18:47,102 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 229 transitions, 485 flow [2022-11-02 20:18:47,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 204.2) internal successors, (1021), 5 states have internal predecessors, (1021), 0 states have call successors, (0), 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-02 20:18:47,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:18:47,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:18:47,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:18:47,104 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:18:47,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:47,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1410714274, now seen corresponding path program 1 times [2022-11-02 20:18:47,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:47,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710124942] [2022-11-02 20:18:47,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:47,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:47,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:47,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710124942] [2022-11-02 20:18:47,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710124942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:47,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:47,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:18:47,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92194621] [2022-11-02 20:18:47,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:47,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:18:47,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:47,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:18:47,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:47,410 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 267 [2022-11-02 20:18:47,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 229 transitions, 485 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-02 20:18:47,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:18:47,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 267 [2022-11-02 20:18:47,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:18:47,849 INFO L130 PetriNetUnfolder]: 398/1217 cut-off events. [2022-11-02 20:18:47,850 INFO L131 PetriNetUnfolder]: For 214/214 co-relation queries the response was YES. [2022-11-02 20:18:47,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2017 conditions, 1217 events. 398/1217 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6534 event pairs, 190 based on Foata normal form. 17/1064 useless extension candidates. Maximal degree in co-relation 2010. Up to 432 conditions per place. [2022-11-02 20:18:47,862 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 33 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2022-11-02 20:18:47,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 242 transitions, 593 flow [2022-11-02 20:18:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:18:47,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:18:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2022-11-02 20:18:47,867 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9063670411985019 [2022-11-02 20:18:47,867 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 726 transitions. [2022-11-02 20:18:47,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 726 transitions. [2022-11-02 20:18:47,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:18:47,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 726 transitions. [2022-11-02 20:18:47,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 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-02 20:18:47,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 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-02 20:18:47,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 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-02 20:18:47,873 INFO L175 Difference]: Start difference. First operand has 233 places, 229 transitions, 485 flow. Second operand 3 states and 726 transitions. [2022-11-02 20:18:47,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 242 transitions, 593 flow [2022-11-02 20:18:47,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 242 transitions, 585 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-11-02 20:18:47,880 INFO L231 Difference]: Finished difference. Result has 231 places, 230 transitions, 492 flow [2022-11-02 20:18:47,881 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=231, PETRI_TRANSITIONS=230} [2022-11-02 20:18:47,883 INFO L287 CegarLoopForPetriNet]: 241 programPoint places, -10 predicate places. [2022-11-02 20:18:47,883 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 230 transitions, 492 flow [2022-11-02 20:18:47,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-02 20:18:47,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:18:47,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:18:47,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:18:47,885 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:18:47,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:47,886 INFO L85 PathProgramCache]: Analyzing trace with hash 439470156, now seen corresponding path program 1 times [2022-11-02 20:18:47,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:47,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901832083] [2022-11-02 20:18:47,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:47,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:48,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:48,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901832083] [2022-11-02 20:18:48,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901832083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:48,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:48,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:18:48,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390918947] [2022-11-02 20:18:48,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:48,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:18:48,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:48,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:18:48,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:18:48,118 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 267 [2022-11-02 20:18:48,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 230 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-02 20:18:48,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:18:48,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 267 [2022-11-02 20:18:48,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:18:48,449 INFO L130 PetriNetUnfolder]: 300/1082 cut-off events. [2022-11-02 20:18:48,449 INFO L131 PetriNetUnfolder]: For 359/360 co-relation queries the response was YES. [2022-11-02 20:18:48,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1813 conditions, 1082 events. 300/1082 cut-off events. For 359/360 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5578 event pairs, 106 based on Foata normal form. 14/946 useless extension candidates. Maximal degree in co-relation 1807. Up to 353 conditions per place. [2022-11-02 20:18:48,459 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 34 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2022-11-02 20:18:48,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 243 transitions, 609 flow [2022-11-02 20:18:48,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:18:48,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:18:48,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2022-11-02 20:18:48,467 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9051186017478152 [2022-11-02 20:18:48,467 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 725 transitions. [2022-11-02 20:18:48,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 725 transitions. [2022-11-02 20:18:48,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:18:48,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 725 transitions. [2022-11-02 20:18:48,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 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-02 20:18:48,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 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-02 20:18:48,472 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 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-02 20:18:48,473 INFO L175 Difference]: Start difference. First operand has 231 places, 230 transitions, 492 flow. Second operand 3 states and 725 transitions. [2022-11-02 20:18:48,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 243 transitions, 609 flow [2022-11-02 20:18:48,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 243 transitions, 606 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:18:48,481 INFO L231 Difference]: Finished difference. Result has 233 places, 231 transitions, 504 flow [2022-11-02 20:18:48,482 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=233, PETRI_TRANSITIONS=231} [2022-11-02 20:18:48,484 INFO L287 CegarLoopForPetriNet]: 241 programPoint places, -8 predicate places. [2022-11-02 20:18:48,484 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 231 transitions, 504 flow [2022-11-02 20:18:48,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 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-02 20:18:48,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:18:48,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:18:48,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:18:48,485 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:18:48,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:48,486 INFO L85 PathProgramCache]: Analyzing trace with hash -640292115, now seen corresponding path program 1 times [2022-11-02 20:18:48,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:48,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55471351] [2022-11-02 20:18:48,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:48,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:48,898 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-02 20:18:48,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:48,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55471351] [2022-11-02 20:18:48,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55471351] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:48,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:48,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:18:48,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490801902] [2022-11-02 20:18:48,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:48,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:18:48,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:48,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:18:48,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:18:48,904 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 267 [2022-11-02 20:18:48,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 231 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 0 states have call successors, (0), 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-02 20:18:48,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:18:48,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 267 [2022-11-02 20:18:48,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:18:49,365 INFO L130 PetriNetUnfolder]: 214/1036 cut-off events. [2022-11-02 20:18:49,366 INFO L131 PetriNetUnfolder]: For 388/389 co-relation queries the response was YES. [2022-11-02 20:18:49,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1787 conditions, 1036 events. 214/1036 cut-off events. For 388/389 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4770 event pairs, 98 based on Foata normal form. 12/945 useless extension candidates. Maximal degree in co-relation 1780. Up to 301 conditions per place. [2022-11-02 20:18:49,377 INFO L137 encePairwiseOnDemand]: 257/267 looper letters, 87 selfloop transitions, 11 changer transitions 0/273 dead transitions. [2022-11-02 20:18:49,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 273 transitions, 805 flow [2022-11-02 20:18:49,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:18:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:18:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1884 transitions. [2022-11-02 20:18:49,382 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.784019975031211 [2022-11-02 20:18:49,383 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1884 transitions. [2022-11-02 20:18:49,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1884 transitions. [2022-11-02 20:18:49,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:18:49,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1884 transitions. [2022-11-02 20:18:49,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 209.33333333333334) internal successors, (1884), 9 states have internal predecessors, (1884), 0 states have call successors, (0), 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-02 20:18:49,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 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-02 20:18:49,398 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 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-02 20:18:49,399 INFO L175 Difference]: Start difference. First operand has 233 places, 231 transitions, 504 flow. Second operand 9 states and 1884 transitions. [2022-11-02 20:18:49,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 273 transitions, 805 flow [2022-11-02 20:18:49,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 273 transitions, 802 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:18:49,408 INFO L231 Difference]: Finished difference. Result has 242 places, 235 transitions, 544 flow [2022-11-02 20:18:49,408 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=544, PETRI_PLACES=242, PETRI_TRANSITIONS=235} [2022-11-02 20:18:49,412 INFO L287 CegarLoopForPetriNet]: 241 programPoint places, 1 predicate places. [2022-11-02 20:18:49,412 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 235 transitions, 544 flow [2022-11-02 20:18:49,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 0 states have call successors, (0), 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-02 20:18:49,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:18:49,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:18:49,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:18:49,414 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:18:49,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:49,416 INFO L85 PathProgramCache]: Analyzing trace with hash -92488863, now seen corresponding path program 1 times [2022-11-02 20:18:49,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:49,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112433687] [2022-11-02 20:18:49,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:49,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:49,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:49,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112433687] [2022-11-02 20:18:49,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112433687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:49,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:49,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:18:49,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115568876] [2022-11-02 20:18:49,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:49,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:18:49,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:49,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:18:49,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:18:49,864 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 267 [2022-11-02 20:18:49,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 235 transitions, 544 flow. Second operand has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 0 states have call successors, (0), 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-02 20:18:49,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:18:49,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 267 [2022-11-02 20:18:49,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:18:50,407 INFO L130 PetriNetUnfolder]: 240/1368 cut-off events. [2022-11-02 20:18:50,407 INFO L131 PetriNetUnfolder]: For 512/514 co-relation queries the response was YES. [2022-11-02 20:18:50,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2278 conditions, 1368 events. 240/1368 cut-off events. For 512/514 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 7353 event pairs, 110 based on Foata normal form. 20/1256 useless extension candidates. Maximal degree in co-relation 2269. Up to 367 conditions per place. [2022-11-02 20:18:50,418 INFO L137 encePairwiseOnDemand]: 257/267 looper letters, 78 selfloop transitions, 12 changer transitions 0/265 dead transitions. [2022-11-02 20:18:50,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 265 transitions, 806 flow [2022-11-02 20:18:50,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:18:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:18:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1872 transitions. [2022-11-02 20:18:50,423 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7790262172284644 [2022-11-02 20:18:50,423 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1872 transitions. [2022-11-02 20:18:50,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1872 transitions. [2022-11-02 20:18:50,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:18:50,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1872 transitions. [2022-11-02 20:18:50,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 208.0) internal successors, (1872), 9 states have internal predecessors, (1872), 0 states have call successors, (0), 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-02 20:18:50,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 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-02 20:18:50,438 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 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-02 20:18:50,439 INFO L175 Difference]: Start difference. First operand has 242 places, 235 transitions, 544 flow. Second operand 9 states and 1872 transitions. [2022-11-02 20:18:50,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 265 transitions, 806 flow [2022-11-02 20:18:50,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 265 transitions, 797 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 20:18:50,449 INFO L231 Difference]: Finished difference. Result has 249 places, 239 transitions, 579 flow [2022-11-02 20:18:50,450 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=579, PETRI_PLACES=249, PETRI_TRANSITIONS=239} [2022-11-02 20:18:50,452 INFO L287 CegarLoopForPetriNet]: 241 programPoint places, 8 predicate places. [2022-11-02 20:18:50,452 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 239 transitions, 579 flow [2022-11-02 20:18:50,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 0 states have call successors, (0), 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-02 20:18:50,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:18:50,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:18:50,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:18:50,454 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:18:50,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:50,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2121067101, now seen corresponding path program 1 times [2022-11-02 20:18:50,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:50,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305498946] [2022-11-02 20:18:50,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:50,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:18:51,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:51,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305498946] [2022-11-02 20:18:51,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305498946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:51,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:51,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:18:51,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38110038] [2022-11-02 20:18:51,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:51,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:18:51,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:51,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:18:51,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:18:51,242 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 267 [2022-11-02 20:18:51,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 239 transitions, 579 flow. Second operand has 8 states, 8 states have (on average 193.375) internal successors, (1547), 8 states have internal predecessors, (1547), 0 states have call successors, (0), 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-02 20:18:51,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:18:51,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 267 [2022-11-02 20:18:51,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:18:54,279 INFO L130 PetriNetUnfolder]: 4073/10483 cut-off events. [2022-11-02 20:18:54,280 INFO L131 PetriNetUnfolder]: For 3358/3392 co-relation queries the response was YES. [2022-11-02 20:18:54,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19454 conditions, 10483 events. 4073/10483 cut-off events. For 3358/3392 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 95012 event pairs, 1859 based on Foata normal form. 0/9112 useless extension candidates. Maximal degree in co-relation 19443. Up to 2358 conditions per place. [2022-11-02 20:18:54,382 INFO L137 encePairwiseOnDemand]: 256/267 looper letters, 127 selfloop transitions, 11 changer transitions 0/301 dead transitions. [2022-11-02 20:18:54,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 301 transitions, 1047 flow [2022-11-02 20:18:54,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:18:54,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:18:54,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1804 transitions. [2022-11-02 20:18:54,388 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7507282563462339 [2022-11-02 20:18:54,388 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1804 transitions. [2022-11-02 20:18:54,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1804 transitions. [2022-11-02 20:18:54,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:18:54,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1804 transitions. [2022-11-02 20:18:54,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 200.44444444444446) internal successors, (1804), 9 states have internal predecessors, (1804), 0 states have call successors, (0), 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-02 20:18:54,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 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-02 20:18:54,401 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 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-02 20:18:54,401 INFO L175 Difference]: Start difference. First operand has 249 places, 239 transitions, 579 flow. Second operand 9 states and 1804 transitions. [2022-11-02 20:18:54,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 301 transitions, 1047 flow [2022-11-02 20:18:54,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 301 transitions, 1036 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 20:18:54,417 INFO L231 Difference]: Finished difference. Result has 258 places, 243 transitions, 618 flow [2022-11-02 20:18:54,417 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=618, PETRI_PLACES=258, PETRI_TRANSITIONS=243} [2022-11-02 20:18:54,418 INFO L287 CegarLoopForPetriNet]: 241 programPoint places, 17 predicate places. [2022-11-02 20:18:54,418 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 243 transitions, 618 flow [2022-11-02 20:18:54,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.375) internal successors, (1547), 8 states have internal predecessors, (1547), 0 states have call successors, (0), 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-02 20:18:54,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:18:54,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:18:54,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:18:54,420 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:18:54,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:54,421 INFO L85 PathProgramCache]: Analyzing trace with hash -2112815307, now seen corresponding path program 1 times [2022-11-02 20:18:54,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:54,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267526891] [2022-11-02 20:18:54,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:54,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:55,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:18:55,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:55,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267526891] [2022-11-02 20:18:55,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267526891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:55,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:55,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:18:55,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349829930] [2022-11-02 20:18:55,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:55,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:18:55,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:55,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:18:55,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:18:55,153 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 267 [2022-11-02 20:18:55,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 243 transitions, 618 flow. Second operand has 8 states, 8 states have (on average 193.375) internal successors, (1547), 8 states have internal predecessors, (1547), 0 states have call successors, (0), 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-02 20:18:55,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:18:55,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 267 [2022-11-02 20:18:55,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:18:58,090 INFO L130 PetriNetUnfolder]: 4404/10744 cut-off events. [2022-11-02 20:18:58,090 INFO L131 PetriNetUnfolder]: For 4375/4375 co-relation queries the response was YES. [2022-11-02 20:18:58,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21274 conditions, 10744 events. 4404/10744 cut-off events. For 4375/4375 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 97436 event pairs, 1910 based on Foata normal form. 0/9373 useless extension candidates. Maximal degree in co-relation 21259. Up to 3027 conditions per place. [2022-11-02 20:18:58,198 INFO L137 encePairwiseOnDemand]: 256/267 looper letters, 95 selfloop transitions, 9 changer transitions 21/288 dead transitions. [2022-11-02 20:18:58,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 288 transitions, 1008 flow [2022-11-02 20:18:58,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:18:58,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:18:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1793 transitions. [2022-11-02 20:18:58,204 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7461506450270495 [2022-11-02 20:18:58,204 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1793 transitions. [2022-11-02 20:18:58,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1793 transitions. [2022-11-02 20:18:58,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:18:58,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1793 transitions. [2022-11-02 20:18:58,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 199.22222222222223) internal successors, (1793), 9 states have internal predecessors, (1793), 0 states have call successors, (0), 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-02 20:18:58,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 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-02 20:18:58,217 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 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-02 20:18:58,218 INFO L175 Difference]: Start difference. First operand has 258 places, 243 transitions, 618 flow. Second operand 9 states and 1793 transitions. [2022-11-02 20:18:58,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 288 transitions, 1008 flow [2022-11-02 20:18:58,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 288 transitions, 995 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:18:58,230 INFO L231 Difference]: Finished difference. Result has 265 places, 242 transitions, 624 flow [2022-11-02 20:18:58,231 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=624, PETRI_PLACES=265, PETRI_TRANSITIONS=242} [2022-11-02 20:18:58,233 INFO L287 CegarLoopForPetriNet]: 241 programPoint places, 24 predicate places. [2022-11-02 20:18:58,233 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 242 transitions, 624 flow [2022-11-02 20:18:58,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.375) internal successors, (1547), 8 states have internal predecessors, (1547), 0 states have call successors, (0), 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-02 20:18:58,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:18:58,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:18:58,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:18:58,235 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:18:58,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:58,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1768384768, now seen corresponding path program 1 times [2022-11-02 20:18:58,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:58,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078425184] [2022-11-02 20:18:58,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:58,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:59,116 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-02 20:18:59,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:59,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078425184] [2022-11-02 20:18:59,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078425184] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:18:59,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315161079] [2022-11-02 20:18:59,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:59,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:18:59,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:18:59,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:18:59,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:18:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:59,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:18:59,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:18:59,947 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-02 20:18:59,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:19:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:19:00,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315161079] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:19:00,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:19:00,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 8] total 22 [2022-11-02 20:19:00,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546025496] [2022-11-02 20:19:00,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:00,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:19:00,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:00,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:19:00,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:19:00,535 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 267 [2022-11-02 20:19:00,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 242 transitions, 624 flow. Second operand has 10 states, 10 states have (on average 187.0) internal successors, (1870), 10 states have internal predecessors, (1870), 0 states have call successors, (0), 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-02 20:19:00,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:19:00,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 267 [2022-11-02 20:19:00,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:19:04,300 INFO L130 PetriNetUnfolder]: 7637/13409 cut-off events. [2022-11-02 20:19:04,300 INFO L131 PetriNetUnfolder]: For 6706/6706 co-relation queries the response was YES. [2022-11-02 20:19:04,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32107 conditions, 13409 events. 7637/13409 cut-off events. For 6706/6706 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 100078 event pairs, 371 based on Foata normal form. 418/12892 useless extension candidates. Maximal degree in co-relation 32089. Up to 2150 conditions per place. [2022-11-02 20:19:04,423 INFO L137 encePairwiseOnDemand]: 248/267 looper letters, 199 selfloop transitions, 38 changer transitions 3/397 dead transitions. [2022-11-02 20:19:04,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 397 transitions, 1634 flow [2022-11-02 20:19:04,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:19:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-02 20:19:04,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3833 transitions. [2022-11-02 20:19:04,433 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7177902621722847 [2022-11-02 20:19:04,433 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3833 transitions. [2022-11-02 20:19:04,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3833 transitions. [2022-11-02 20:19:04,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:19:04,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3833 transitions. [2022-11-02 20:19:04,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 191.65) internal successors, (3833), 20 states have internal predecessors, (3833), 0 states have call successors, (0), 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-02 20:19:04,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 267.0) internal successors, (5607), 21 states have internal predecessors, (5607), 0 states have call successors, (0), 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-02 20:19:04,459 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 267.0) internal successors, (5607), 21 states have internal predecessors, (5607), 0 states have call successors, (0), 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-02 20:19:04,459 INFO L175 Difference]: Start difference. First operand has 265 places, 242 transitions, 624 flow. Second operand 20 states and 3833 transitions. [2022-11-02 20:19:04,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 397 transitions, 1634 flow [2022-11-02 20:19:04,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 397 transitions, 1590 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-11-02 20:19:04,492 INFO L231 Difference]: Finished difference. Result has 282 places, 260 transitions, 808 flow [2022-11-02 20:19:04,493 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=808, PETRI_PLACES=282, PETRI_TRANSITIONS=260} [2022-11-02 20:19:04,493 INFO L287 CegarLoopForPetriNet]: 241 programPoint places, 41 predicate places. [2022-11-02 20:19:04,494 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 260 transitions, 808 flow [2022-11-02 20:19:04,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 187.0) internal successors, (1870), 10 states have internal predecessors, (1870), 0 states have call successors, (0), 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-02 20:19:04,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:04,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:19:04,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:19:04,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-02 20:19:04,720 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:19:04,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:04,721 INFO L85 PathProgramCache]: Analyzing trace with hash -986887890, now seen corresponding path program 1 times [2022-11-02 20:19:04,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:04,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849413823] [2022-11-02 20:19:04,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:04,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:05,398 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-02 20:19:05,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:05,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849413823] [2022-11-02 20:19:05,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849413823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:05,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:05,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:19:05,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109506760] [2022-11-02 20:19:05,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:05,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:19:05,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:05,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:19:05,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:19:05,403 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 267 [2022-11-02 20:19:05,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 260 transitions, 808 flow. Second operand has 9 states, 9 states have (on average 189.44444444444446) internal successors, (1705), 9 states have internal predecessors, (1705), 0 states have call successors, (0), 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-02 20:19:05,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:19:05,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 267 [2022-11-02 20:19:05,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:19:08,386 INFO L130 PetriNetUnfolder]: 5812/10391 cut-off events. [2022-11-02 20:19:08,386 INFO L131 PetriNetUnfolder]: For 16423/16423 co-relation queries the response was YES. [2022-11-02 20:19:08,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28409 conditions, 10391 events. 5812/10391 cut-off events. For 16423/16423 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 76998 event pairs, 919 based on Foata normal form. 304/10137 useless extension candidates. Maximal degree in co-relation 28385. Up to 4434 conditions per place. [2022-11-02 20:19:08,505 INFO L137 encePairwiseOnDemand]: 257/267 looper letters, 170 selfloop transitions, 14 changer transitions 7/353 dead transitions. [2022-11-02 20:19:08,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 353 transitions, 1632 flow [2022-11-02 20:19:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:19:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:19:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1970 transitions. [2022-11-02 20:19:08,512 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7378277153558053 [2022-11-02 20:19:08,512 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1970 transitions. [2022-11-02 20:19:08,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1970 transitions. [2022-11-02 20:19:08,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:19:08,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1970 transitions. [2022-11-02 20:19:08,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 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-02 20:19:08,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 267.0) internal successors, (2937), 11 states have internal predecessors, (2937), 0 states have call successors, (0), 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-02 20:19:08,525 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 267.0) internal successors, (2937), 11 states have internal predecessors, (2937), 0 states have call successors, (0), 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-02 20:19:08,525 INFO L175 Difference]: Start difference. First operand has 282 places, 260 transitions, 808 flow. Second operand 10 states and 1970 transitions. [2022-11-02 20:19:08,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 353 transitions, 1632 flow [2022-11-02 20:19:08,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 353 transitions, 1540 flow, removed 10 selfloop flow, removed 12 redundant places. [2022-11-02 20:19:08,591 INFO L231 Difference]: Finished difference. Result has 281 places, 264 transitions, 827 flow [2022-11-02 20:19:08,592 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=827, PETRI_PLACES=281, PETRI_TRANSITIONS=264} [2022-11-02 20:19:08,593 INFO L287 CegarLoopForPetriNet]: 241 programPoint places, 40 predicate places. [2022-11-02 20:19:08,594 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 264 transitions, 827 flow [2022-11-02 20:19:08,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 189.44444444444446) internal successors, (1705), 9 states have internal predecessors, (1705), 0 states have call successors, (0), 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-02 20:19:08,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:08,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:19:08,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:19:08,595 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:19:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:08,596 INFO L85 PathProgramCache]: Analyzing trace with hash -179703123, now seen corresponding path program 1 times [2022-11-02 20:19:08,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:08,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568640072] [2022-11-02 20:19:08,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:08,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:19:09,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:09,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568640072] [2022-11-02 20:19:09,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568640072] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:19:09,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353529604] [2022-11-02 20:19:09,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:09,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:09,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:19:09,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:19:09,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:19:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:09,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:19:09,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:19:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:19:09,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:19:09,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353529604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:09,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:19:09,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-11-02 20:19:09,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37188184] [2022-11-02 20:19:09,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:09,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:19:09,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:09,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:19:09,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:19:09,757 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 267 [2022-11-02 20:19:09,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 264 transitions, 827 flow. Second operand has 6 states, 6 states have (on average 225.5) internal successors, (1353), 6 states have internal predecessors, (1353), 0 states have call successors, (0), 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-02 20:19:09,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:19:09,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 267 [2022-11-02 20:19:09,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:19:16,365 INFO L130 PetriNetUnfolder]: 15926/28124 cut-off events. [2022-11-02 20:19:16,365 INFO L131 PetriNetUnfolder]: For 58105/58513 co-relation queries the response was YES. [2022-11-02 20:19:16,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83649 conditions, 28124 events. 15926/28124 cut-off events. For 58105/58513 co-relation queries the response was YES. Maximal size of possible extension queue 1670. Compared 251270 event pairs, 1746 based on Foata normal form. 548/25858 useless extension candidates. Maximal degree in co-relation 83623. Up to 3831 conditions per place. [2022-11-02 20:19:16,717 INFO L137 encePairwiseOnDemand]: 258/267 looper letters, 172 selfloop transitions, 67 changer transitions 0/447 dead transitions. [2022-11-02 20:19:16,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 447 transitions, 2290 flow [2022-11-02 20:19:16,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:19:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:19:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2349 transitions. [2022-11-02 20:19:16,724 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8797752808988764 [2022-11-02 20:19:16,725 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2349 transitions. [2022-11-02 20:19:16,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2349 transitions. [2022-11-02 20:19:16,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:19:16,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2349 transitions. [2022-11-02 20:19:16,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 234.9) internal successors, (2349), 10 states have internal predecessors, (2349), 0 states have call successors, (0), 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-02 20:19:16,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 267.0) internal successors, (2937), 11 states have internal predecessors, (2937), 0 states have call successors, (0), 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-02 20:19:16,738 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 267.0) internal successors, (2937), 11 states have internal predecessors, (2937), 0 states have call successors, (0), 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-02 20:19:16,739 INFO L175 Difference]: Start difference. First operand has 281 places, 264 transitions, 827 flow. Second operand 10 states and 2349 transitions. [2022-11-02 20:19:16,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 447 transitions, 2290 flow [2022-11-02 20:19:16,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 447 transitions, 2245 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-11-02 20:19:16,916 INFO L231 Difference]: Finished difference. Result has 289 places, 322 transitions, 1514 flow [2022-11-02 20:19:16,917 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1514, PETRI_PLACES=289, PETRI_TRANSITIONS=322} [2022-11-02 20:19:16,917 INFO L287 CegarLoopForPetriNet]: 241 programPoint places, 48 predicate places. [2022-11-02 20:19:16,918 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 322 transitions, 1514 flow [2022-11-02 20:19:16,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.5) internal successors, (1353), 6 states have internal predecessors, (1353), 0 states have call successors, (0), 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-02 20:19:16,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:16,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:19:16,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:19:17,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:17,147 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:19:17,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:17,148 INFO L85 PathProgramCache]: Analyzing trace with hash 782344715, now seen corresponding path program 1 times [2022-11-02 20:19:17,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:17,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033746820] [2022-11-02 20:19:17,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:17,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:19:17,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:17,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033746820] [2022-11-02 20:19:17,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033746820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:17,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:17,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:19:17,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704883491] [2022-11-02 20:19:17,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:17,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:19:17,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:17,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:19:17,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:19:17,629 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 267 [2022-11-02 20:19:17,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 322 transitions, 1514 flow. Second operand has 5 states, 5 states have (on average 232.8) internal successors, (1164), 5 states have internal predecessors, (1164), 0 states have call successors, (0), 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-02 20:19:17,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:19:17,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 267 [2022-11-02 20:19:17,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:19:20,812 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L74-->L80: Formula: (let ((.cse0 (select (select |v_#memory_int_94| v_~f~0.base_46) (+ v_~f~0.offset_46 (* v_~j~0_46 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< v_~q2_back~0_68 2147483647) 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|) (not (= (ite (and (<= 0 v_~q2_back~0_68) (< v_~q2_back~0_68 v_~n2~0_24)) 1 0) 0)) (= v_~q2_back~0_67 (+ v_~q2_back~0_68 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int_94| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* v_~q2_back~0_68 4)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)))) InVars {~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_94|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_68, ~f~0.offset=v_~f~0.offset_46} OutVars{~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, 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|, ~f~0.offset=v_~f~0.offset_46, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_94|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0][391], [Black: 313#(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|)), 104#L104true, 243#L148-4true, 1135#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 37#L122true, 110#L57true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 2421#(<= (+ 1 ~q2_front~0) ~q2_back~0), 141#L80true, Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:20,812 INFO L383 tUnfolder$Statistics]: this new event has 195 ancestors and is not cut-off event [2022-11-02 20:19:20,812 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-02 20:19:20,812 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is not cut-off event [2022-11-02 20:19:20,812 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-02 20:19:21,196 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1011] L97-->L101: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_72 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (= (select (select |v_#memory_int_88| v_~q1~0.base_27) (+ v_~q1~0.offset_27 (* 4 v_~q1_front~0_55))) |v_thread3Thread1of1ForFork2_plus_#in~b#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (<= v_~total~0_71 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (<= 0 (+ v_~total~0_71 2147483648)) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_26) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_63)) 1 0) 0)) (= v_~total~0_71 |v_thread3Thread1of1ForFork2_plus_#res#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_27, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_63, ~n1~0=v_~n1~0_26, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_88|, ~total~0=v_~total~0_72} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_27, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_26, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_71, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_88|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][288], [Black: 313#(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|)), 243#L148-4true, 102#L60true, 1135#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 120#L119true, 14#L83true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2420#(<= ~q2_front~0 ~q2_back~0), 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 5#L101true, Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:21,196 INFO L383 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-11-02 20:19:21,197 INFO L386 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-11-02 20:19:21,197 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-11-02 20:19:21,197 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-11-02 20:19:21,313 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L74-->L80: Formula: (let ((.cse0 (select (select |v_#memory_int_94| v_~f~0.base_46) (+ v_~f~0.offset_46 (* v_~j~0_46 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< v_~q2_back~0_68 2147483647) 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|) (not (= (ite (and (<= 0 v_~q2_back~0_68) (< v_~q2_back~0_68 v_~n2~0_24)) 1 0) 0)) (= v_~q2_back~0_67 (+ v_~q2_back~0_68 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int_94| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* v_~q2_back~0_68 4)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)))) InVars {~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_94|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_68, ~f~0.offset=v_~f~0.offset_46} OutVars{~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, 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|, ~f~0.offset=v_~f~0.offset_46, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_94|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0][391], [Black: 313#(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|)), 104#L104true, 243#L148-4true, 1135#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 110#L57true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 2421#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 179#L114-1true, 141#L80true, Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:21,313 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is not cut-off event [2022-11-02 20:19:21,313 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-02 20:19:21,313 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-02 20:19:21,313 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is not cut-off event [2022-11-02 20:19:21,314 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L74-->L80: Formula: (let ((.cse0 (select (select |v_#memory_int_94| v_~f~0.base_46) (+ v_~f~0.offset_46 (* v_~j~0_46 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< v_~q2_back~0_68 2147483647) 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|) (not (= (ite (and (<= 0 v_~q2_back~0_68) (< v_~q2_back~0_68 v_~n2~0_24)) 1 0) 0)) (= v_~q2_back~0_67 (+ v_~q2_back~0_68 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int_94| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* v_~q2_back~0_68 4)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)))) InVars {~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_94|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_68, ~f~0.offset=v_~f~0.offset_46} OutVars{~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, 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|, ~f~0.offset=v_~f~0.offset_46, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_94|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0][391], [Black: 313#(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|)), 20#L115true, 104#L104true, 243#L148-4true, 1135#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 110#L57true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 2421#(<= (+ 1 ~q2_front~0) ~q2_back~0), 141#L80true, Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:21,314 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is not cut-off event [2022-11-02 20:19:21,315 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-02 20:19:21,315 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-02 20:19:21,315 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is not cut-off event [2022-11-02 20:19:21,379 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L74-->L80: Formula: (let ((.cse0 (select (select |v_#memory_int_94| v_~f~0.base_46) (+ v_~f~0.offset_46 (* v_~j~0_46 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< v_~q2_back~0_68 2147483647) 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|) (not (= (ite (and (<= 0 v_~q2_back~0_68) (< v_~q2_back~0_68 v_~n2~0_24)) 1 0) 0)) (= v_~q2_back~0_67 (+ v_~q2_back~0_68 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int_94| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* v_~q2_back~0_68 4)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)))) InVars {~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_94|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_68, ~f~0.offset=v_~f~0.offset_46} OutVars{~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, 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|, ~f~0.offset=v_~f~0.offset_46, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_94|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0][373], [Black: 313#(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|)), 2424#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 104#L104true, 243#L148-4true, 1135#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 120#L119true, 110#L57true, 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 141#L80true, Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:21,379 INFO L383 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2022-11-02 20:19:21,379 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 20:19:21,379 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 20:19:21,380 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-11-02 20:19:21,387 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1011] L97-->L101: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_72 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (= (select (select |v_#memory_int_88| v_~q1~0.base_27) (+ v_~q1~0.offset_27 (* 4 v_~q1_front~0_55))) |v_thread3Thread1of1ForFork2_plus_#in~b#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (<= v_~total~0_71 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (<= 0 (+ v_~total~0_71 2147483648)) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_26) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_63)) 1 0) 0)) (= v_~total~0_71 |v_thread3Thread1of1ForFork2_plus_#res#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_27, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_63, ~n1~0=v_~n1~0_26, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_88|, ~total~0=v_~total~0_72} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_27, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_26, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_71, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_88|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][371], [Black: 313#(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|)), 243#L148-4true, Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 120#L119true, 110#L57true, 2426#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 5#L101true, Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 141#L80true, Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0))]) [2022-11-02 20:19:21,387 INFO L383 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2022-11-02 20:19:21,387 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-02 20:19:21,387 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-02 20:19:21,387 INFO L386 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-11-02 20:19:21,471 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L74-->L80: Formula: (let ((.cse0 (select (select |v_#memory_int_94| v_~f~0.base_46) (+ v_~f~0.offset_46 (* v_~j~0_46 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< v_~q2_back~0_68 2147483647) 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|) (not (= (ite (and (<= 0 v_~q2_back~0_68) (< v_~q2_back~0_68 v_~n2~0_24)) 1 0) 0)) (= v_~q2_back~0_67 (+ v_~q2_back~0_68 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int_94| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* v_~q2_back~0_68 4)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)))) InVars {~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_94|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_68, ~f~0.offset=v_~f~0.offset_46} OutVars{~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, 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|, ~f~0.offset=v_~f~0.offset_46, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_94|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0][391], [Black: 313#(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|)), 104#L104true, 243#L148-4true, 102#L60true, 1135#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 2421#(<= (+ 1 ~q2_front~0) ~q2_back~0), 179#L114-1true, 141#L80true, Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:21,471 INFO L383 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-11-02 20:19:21,471 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 20:19:21,471 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-02 20:19:21,471 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 20:19:21,472 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L74-->L80: Formula: (let ((.cse0 (select (select |v_#memory_int_94| v_~f~0.base_46) (+ v_~f~0.offset_46 (* v_~j~0_46 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< v_~q2_back~0_68 2147483647) 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|) (not (= (ite (and (<= 0 v_~q2_back~0_68) (< v_~q2_back~0_68 v_~n2~0_24)) 1 0) 0)) (= v_~q2_back~0_67 (+ v_~q2_back~0_68 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int_94| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* v_~q2_back~0_68 4)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)))) InVars {~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_94|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_68, ~f~0.offset=v_~f~0.offset_46} OutVars{~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, 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|, ~f~0.offset=v_~f~0.offset_46, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_94|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0][391], [Black: 313#(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|)), 20#L115true, 104#L104true, 243#L148-4true, 102#L60true, 1135#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 2421#(<= (+ 1 ~q2_front~0) ~q2_back~0), 141#L80true, Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:21,472 INFO L383 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-11-02 20:19:21,472 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 20:19:21,472 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 20:19:21,472 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-02 20:19:21,506 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1002] L74-->L80: Formula: (let ((.cse0 (select (select |v_#memory_int_94| v_~f~0.base_46) (+ v_~f~0.offset_46 (* v_~j~0_46 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< v_~q2_back~0_68 2147483647) 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|) (not (= (ite (and (<= 0 v_~q2_back~0_68) (< v_~q2_back~0_68 v_~n2~0_24)) 1 0) 0)) (= v_~q2_back~0_67 (+ v_~q2_back~0_68 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int_94| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* v_~q2_back~0_68 4)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)))) InVars {~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_94|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_68, ~f~0.offset=v_~f~0.offset_46} OutVars{~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, 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|, ~f~0.offset=v_~f~0.offset_46, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_94|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0][373], [Black: 313#(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|)), 2424#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 104#L104true, 243#L148-4true, 1135#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), 261#true, Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 120#L119true, 110#L57true, 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 141#L80true, Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:21,506 INFO L383 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-11-02 20:19:21,506 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 20:19:21,507 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 20:19:21,507 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-02 20:19:21,507 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-11-02 20:19:21,508 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L74-->L80: Formula: (let ((.cse0 (select (select |v_#memory_int_94| v_~f~0.base_46) (+ v_~f~0.offset_46 (* v_~j~0_46 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< v_~q2_back~0_68 2147483647) 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|) (not (= (ite (and (<= 0 v_~q2_back~0_68) (< v_~q2_back~0_68 v_~n2~0_24)) 1 0) 0)) (= v_~q2_back~0_67 (+ v_~q2_back~0_68 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int_94| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* v_~q2_back~0_68 4)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)))) InVars {~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_94|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_68, ~f~0.offset=v_~f~0.offset_46} OutVars{~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, 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|, ~f~0.offset=v_~f~0.offset_46, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_94|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0][373], [Black: 313#(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|)), 2424#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 104#L104true, 243#L148-4true, 102#L60true, 1135#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), 261#true, Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 120#L119true, 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 141#L80true, Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:21,508 INFO L383 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2022-11-02 20:19:21,508 INFO L386 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-11-02 20:19:21,508 INFO L386 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-11-02 20:19:21,508 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-02 20:19:21,642 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L57: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_60) v_~q1_back~0_59) (not (= (ite (and (< v_~q1_back~0_60 v_~n1~0_24) (<= 0 v_~q1_back~0_60)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_82| v_~q1~0.base_21) (+ (* 4 v_~q1_back~0_60) v_~q1~0.offset_21)) (select (select |v_#memory_int_82| v_~f~0.base_42) (+ v_~f~0.offset_42 (* v_~i~0_27 4)))) 1 0) 0)) (= (ite (< v_~q1_back~0_60 2147483647) 1 0) |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_21, ~q1_back~0=v_~q1_back~0_60, ~i~0=v_~i~0_27, ~f~0.base=v_~f~0.base_42, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_21, #memory_int=|v_#memory_int_82|, ~f~0.offset=v_~f~0.offset_42} OutVars{~q1~0.offset=v_~q1~0.offset_21, ~i~0=v_~i~0_27, ~f~0.base=v_~f~0.base_42, ~n1~0=v_~n1~0_24, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_42, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_59, ~q1~0.base=v_~q1~0.base_21, #memory_int=|v_#memory_int_82|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][351], [Black: 313#(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|)), 104#L104true, 243#L148-4true, Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 279#(<= ~q1_back~0 ~q1_front~0), 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 120#L119true, 110#L57true, 2426#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 362#true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3#L73-1true, Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:21,642 INFO L383 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2022-11-02 20:19:21,643 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-02 20:19:21,643 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 20:19:21,643 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-11-02 20:19:21,647 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L57: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_60) v_~q1_back~0_59) (not (= (ite (and (< v_~q1_back~0_60 v_~n1~0_24) (<= 0 v_~q1_back~0_60)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_82| v_~q1~0.base_21) (+ (* 4 v_~q1_back~0_60) v_~q1~0.offset_21)) (select (select |v_#memory_int_82| v_~f~0.base_42) (+ v_~f~0.offset_42 (* v_~i~0_27 4)))) 1 0) 0)) (= (ite (< v_~q1_back~0_60 2147483647) 1 0) |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_21, ~q1_back~0=v_~q1_back~0_60, ~i~0=v_~i~0_27, ~f~0.base=v_~f~0.base_42, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_21, #memory_int=|v_#memory_int_82|, ~f~0.offset=v_~f~0.offset_42} OutVars{~q1~0.offset=v_~q1~0.offset_21, ~i~0=v_~i~0_27, ~f~0.base=v_~f~0.base_42, ~n1~0=v_~n1~0_24, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_42, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_59, ~q1~0.base=v_~q1~0.base_21, #memory_int=|v_#memory_int_82|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][319], [Black: 313#(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|)), 2424#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 20#L115true, 104#L104true, 243#L148-4true, Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 110#L57true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 362#true, 3#L73-1true, Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:21,647 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-02 20:19:21,647 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-02 20:19:21,647 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-02 20:19:21,647 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-02 20:19:21,648 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([993] L52-->L57: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_60) v_~q1_back~0_59) (not (= (ite (and (< v_~q1_back~0_60 v_~n1~0_24) (<= 0 v_~q1_back~0_60)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_82| v_~q1~0.base_21) (+ (* 4 v_~q1_back~0_60) v_~q1~0.offset_21)) (select (select |v_#memory_int_82| v_~f~0.base_42) (+ v_~f~0.offset_42 (* v_~i~0_27 4)))) 1 0) 0)) (= (ite (< v_~q1_back~0_60 2147483647) 1 0) |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_21, ~q1_back~0=v_~q1_back~0_60, ~i~0=v_~i~0_27, ~f~0.base=v_~f~0.base_42, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_21, #memory_int=|v_#memory_int_82|, ~f~0.offset=v_~f~0.offset_42} OutVars{~q1~0.offset=v_~q1~0.offset_21, ~i~0=v_~i~0_27, ~f~0.base=v_~f~0.base_42, ~n1~0=v_~n1~0_24, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_42, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_59, ~q1~0.base=v_~q1~0.base_21, #memory_int=|v_#memory_int_82|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][351], [Black: 313#(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|)), 104#L104true, 243#L148-4true, Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 120#L119true, 110#L57true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2426#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 362#true, 3#L73-1true, Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:21,648 INFO L383 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2022-11-02 20:19:21,648 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-02 20:19:21,648 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 20:19:21,648 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-11-02 20:19:21,648 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-02 20:19:21,693 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L74-->L80: Formula: (let ((.cse0 (select (select |v_#memory_int_94| v_~f~0.base_46) (+ v_~f~0.offset_46 (* v_~j~0_46 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< v_~q2_back~0_68 2147483647) 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|) (not (= (ite (and (<= 0 v_~q2_back~0_68) (< v_~q2_back~0_68 v_~n2~0_24)) 1 0) 0)) (= v_~q2_back~0_67 (+ v_~q2_back~0_68 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int_94| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* v_~q2_back~0_68 4)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)))) InVars {~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_94|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_68, ~f~0.offset=v_~f~0.offset_46} OutVars{~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, 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|, ~f~0.offset=v_~f~0.offset_46, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_94|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0][391], [Black: 313#(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|)), 104#L104true, 243#L148-4true, 1135#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 120#L119true, 110#L57true, 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 2421#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 141#L80true, Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:21,694 INFO L383 tUnfolder$Statistics]: this new event has 197 ancestors and is not cut-off event [2022-11-02 20:19:21,694 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is not cut-off event [2022-11-02 20:19:21,694 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is not cut-off event [2022-11-02 20:19:21,694 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is not cut-off event [2022-11-02 20:19:21,761 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1011] L97-->L101: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_72 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (= (select (select |v_#memory_int_88| v_~q1~0.base_27) (+ v_~q1~0.offset_27 (* 4 v_~q1_front~0_55))) |v_thread3Thread1of1ForFork2_plus_#in~b#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (<= v_~total~0_71 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (<= 0 (+ v_~total~0_71 2147483648)) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_26) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_63)) 1 0) 0)) (= v_~total~0_71 |v_thread3Thread1of1ForFork2_plus_#res#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_27, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_63, ~n1~0=v_~n1~0_26, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_88|, ~total~0=v_~total~0_72} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_27, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_26, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_71, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_88|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][371], [Black: 313#(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|)), 243#L148-4true, 1135#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 120#L119true, 110#L57true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 14#L83true, 2426#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 5#L101true, Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:21,761 INFO L383 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-11-02 20:19:21,762 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-11-02 20:19:21,762 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-02 20:19:21,762 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-02 20:19:21,830 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L74-->L80: Formula: (let ((.cse0 (select (select |v_#memory_int_94| v_~f~0.base_46) (+ v_~f~0.offset_46 (* v_~j~0_46 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< v_~q2_back~0_68 2147483647) 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|) (not (= (ite (and (<= 0 v_~q2_back~0_68) (< v_~q2_back~0_68 v_~n2~0_24)) 1 0) 0)) (= v_~q2_back~0_67 (+ v_~q2_back~0_68 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int_94| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* v_~q2_back~0_68 4)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)))) InVars {~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_94|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_68, ~f~0.offset=v_~f~0.offset_46} OutVars{~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, 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|, ~f~0.offset=v_~f~0.offset_46, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_94|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0][391], [Black: 313#(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|)), 104#L104true, 243#L148-4true, 102#L60true, 1135#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 120#L119true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 2421#(<= (+ 1 ~q2_front~0) ~q2_back~0), 141#L80true, Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:21,830 INFO L383 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2022-11-02 20:19:21,830 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-02 20:19:21,830 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 20:19:21,830 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 20:19:22,325 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L57: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_60) v_~q1_back~0_59) (not (= (ite (and (< v_~q1_back~0_60 v_~n1~0_24) (<= 0 v_~q1_back~0_60)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_82| v_~q1~0.base_21) (+ (* 4 v_~q1_back~0_60) v_~q1~0.offset_21)) (select (select |v_#memory_int_82| v_~f~0.base_42) (+ v_~f~0.offset_42 (* v_~i~0_27 4)))) 1 0) 0)) (= (ite (< v_~q1_back~0_60 2147483647) 1 0) |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_21, ~q1_back~0=v_~q1_back~0_60, ~i~0=v_~i~0_27, ~f~0.base=v_~f~0.base_42, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_21, #memory_int=|v_#memory_int_82|, ~f~0.offset=v_~f~0.offset_42} OutVars{~q1~0.offset=v_~q1~0.offset_21, ~i~0=v_~i~0_27, ~f~0.base=v_~f~0.base_42, ~n1~0=v_~n1~0_24, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_42, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_59, ~q1~0.base=v_~q1~0.base_21, #memory_int=|v_#memory_int_82|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][380], [Black: 313#(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|)), 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), 2424#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 104#L104true, 243#L148-4true, Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 37#L122true, 110#L57true, 362#true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3#L73-1true, Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:22,326 INFO L383 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-11-02 20:19:22,326 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 20:19:22,326 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-02 20:19:22,326 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-02 20:19:22,766 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L57: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_60) v_~q1_back~0_59) (not (= (ite (and (< v_~q1_back~0_60 v_~n1~0_24) (<= 0 v_~q1_back~0_60)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_82| v_~q1~0.base_21) (+ (* 4 v_~q1_back~0_60) v_~q1~0.offset_21)) (select (select |v_#memory_int_82| v_~f~0.base_42) (+ v_~f~0.offset_42 (* v_~i~0_27 4)))) 1 0) 0)) (= (ite (< v_~q1_back~0_60 2147483647) 1 0) |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_21, ~q1_back~0=v_~q1_back~0_60, ~i~0=v_~i~0_27, ~f~0.base=v_~f~0.base_42, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_21, #memory_int=|v_#memory_int_82|, ~f~0.offset=v_~f~0.offset_42} OutVars{~q1~0.offset=v_~q1~0.offset_21, ~i~0=v_~i~0_27, ~f~0.base=v_~f~0.base_42, ~n1~0=v_~n1~0_24, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_42, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_59, ~q1~0.base=v_~q1~0.base_21, #memory_int=|v_#memory_int_82|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][336], [Black: 313#(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|)), 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), 104#L104true, 243#L148-4true, Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 110#L57true, 362#true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3#L73-1true, 2420#(<= ~q2_front~0 ~q2_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 179#L114-1true, Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:22,767 INFO L383 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2022-11-02 20:19:22,767 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-02 20:19:22,767 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-02 20:19:22,767 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-02 20:19:22,768 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L57: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_60) v_~q1_back~0_59) (not (= (ite (and (< v_~q1_back~0_60 v_~n1~0_24) (<= 0 v_~q1_back~0_60)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_82| v_~q1~0.base_21) (+ (* 4 v_~q1_back~0_60) v_~q1~0.offset_21)) (select (select |v_#memory_int_82| v_~f~0.base_42) (+ v_~f~0.offset_42 (* v_~i~0_27 4)))) 1 0) 0)) (= (ite (< v_~q1_back~0_60 2147483647) 1 0) |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_21, ~q1_back~0=v_~q1_back~0_60, ~i~0=v_~i~0_27, ~f~0.base=v_~f~0.base_42, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_21, #memory_int=|v_#memory_int_82|, ~f~0.offset=v_~f~0.offset_42} OutVars{~q1~0.offset=v_~q1~0.offset_21, ~i~0=v_~i~0_27, ~f~0.base=v_~f~0.base_42, ~n1~0=v_~n1~0_24, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_42, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_59, ~q1~0.base=v_~q1~0.base_21, #memory_int=|v_#memory_int_82|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][336], [Black: 313#(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|)), 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), 20#L115true, 104#L104true, 243#L148-4true, Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 110#L57true, 362#true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3#L73-1true, 2420#(<= ~q2_front~0 ~q2_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:22,768 INFO L383 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2022-11-02 20:19:22,768 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-02 20:19:22,769 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-02 20:19:22,769 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-02 20:19:22,838 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L57: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_60) v_~q1_back~0_59) (not (= (ite (and (< v_~q1_back~0_60 v_~n1~0_24) (<= 0 v_~q1_back~0_60)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_82| v_~q1~0.base_21) (+ (* 4 v_~q1_back~0_60) v_~q1~0.offset_21)) (select (select |v_#memory_int_82| v_~f~0.base_42) (+ v_~f~0.offset_42 (* v_~i~0_27 4)))) 1 0) 0)) (= (ite (< v_~q1_back~0_60 2147483647) 1 0) |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_21, ~q1_back~0=v_~q1_back~0_60, ~i~0=v_~i~0_27, ~f~0.base=v_~f~0.base_42, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_21, #memory_int=|v_#memory_int_82|, ~f~0.offset=v_~f~0.offset_42} OutVars{~q1~0.offset=v_~q1~0.offset_21, ~i~0=v_~i~0_27, ~f~0.base=v_~f~0.base_42, ~n1~0=v_~n1~0_24, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_42, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_59, ~q1~0.base=v_~q1~0.base_21, #memory_int=|v_#memory_int_82|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][380], [Black: 313#(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|)), 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), 2424#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 20#L115true, 104#L104true, 243#L148-4true, Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 110#L57true, 362#true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3#L73-1true, Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:22,839 INFO L383 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2022-11-02 20:19:22,839 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-02 20:19:22,839 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-02 20:19:22,839 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-02 20:19:23,127 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L57: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_60) v_~q1_back~0_59) (not (= (ite (and (< v_~q1_back~0_60 v_~n1~0_24) (<= 0 v_~q1_back~0_60)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_82| v_~q1~0.base_21) (+ (* 4 v_~q1_back~0_60) v_~q1~0.offset_21)) (select (select |v_#memory_int_82| v_~f~0.base_42) (+ v_~f~0.offset_42 (* v_~i~0_27 4)))) 1 0) 0)) (= (ite (< v_~q1_back~0_60 2147483647) 1 0) |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_21, ~q1_back~0=v_~q1_back~0_60, ~i~0=v_~i~0_27, ~f~0.base=v_~f~0.base_42, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_21, #memory_int=|v_#memory_int_82|, ~f~0.offset=v_~f~0.offset_42} OutVars{~q1~0.offset=v_~q1~0.offset_21, ~i~0=v_~i~0_27, ~f~0.base=v_~f~0.base_42, ~n1~0=v_~n1~0_24, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_42, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_59, ~q1~0.base=v_~q1~0.base_21, #memory_int=|v_#memory_int_82|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][336], [Black: 313#(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|)), 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), 104#L104true, 243#L148-4true, Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 120#L119true, 110#L57true, 362#true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3#L73-1true, 2420#(<= ~q2_front~0 ~q2_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:23,127 INFO L383 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2022-11-02 20:19:23,127 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-02 20:19:23,128 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-02 20:19:23,128 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-02 20:19:23,986 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L74-->L80: Formula: (let ((.cse0 (select (select |v_#memory_int_94| v_~f~0.base_46) (+ v_~f~0.offset_46 (* v_~j~0_46 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< v_~q2_back~0_68 2147483647) 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|) (not (= (ite (and (<= 0 v_~q2_back~0_68) (< v_~q2_back~0_68 v_~n2~0_24)) 1 0) 0)) (= v_~q2_back~0_67 (+ v_~q2_back~0_68 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int_94| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* v_~q2_back~0_68 4)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)))) InVars {~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_94|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_68, ~f~0.offset=v_~f~0.offset_46} OutVars{~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, 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|, ~f~0.offset=v_~f~0.offset_46, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_94|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0][391], [Black: 313#(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|)), 104#L104true, 1135#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), 103#L149-2true, Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 37#L122true, 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 2421#(<= (+ 1 ~q2_front~0) ~q2_back~0), 141#L80true, Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:23,986 INFO L383 tUnfolder$Statistics]: this new event has 207 ancestors and is cut-off event [2022-11-02 20:19:23,986 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-02 20:19:23,986 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-02 20:19:23,986 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-02 20:19:24,034 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1011] L97-->L101: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_72 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (= (select (select |v_#memory_int_88| v_~q1~0.base_27) (+ v_~q1~0.offset_27 (* 4 v_~q1_front~0_55))) |v_thread3Thread1of1ForFork2_plus_#in~b#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (<= v_~total~0_71 2147483647) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (<= 0 (+ v_~total~0_71 2147483648)) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_26) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_63)) 1 0) 0)) (= v_~total~0_71 |v_thread3Thread1of1ForFork2_plus_#res#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_27, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_63, ~n1~0=v_~n1~0_26, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_88|, ~total~0=v_~total~0_72} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_27, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_26, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_71, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_88|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][288], [Black: 313#(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|)), 1135#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), 103#L149-2true, Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 120#L119true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 14#L83true, 2420#(<= ~q2_front~0 ~q2_back~0), 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 5#L101true, Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:24,034 INFO L383 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2022-11-02 20:19:24,034 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-02 20:19:24,034 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-02 20:19:24,034 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-02 20:19:24,124 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L74-->L80: Formula: (let ((.cse0 (select (select |v_#memory_int_94| v_~f~0.base_46) (+ v_~f~0.offset_46 (* v_~j~0_46 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< v_~q2_back~0_68 2147483647) 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|) (not (= (ite (and (<= 0 v_~q2_back~0_68) (< v_~q2_back~0_68 v_~n2~0_24)) 1 0) 0)) (= v_~q2_back~0_67 (+ v_~q2_back~0_68 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int_94| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* v_~q2_back~0_68 4)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)))) InVars {~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_94|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_68, ~f~0.offset=v_~f~0.offset_46} OutVars{~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, 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|, ~f~0.offset=v_~f~0.offset_46, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_94|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0][391], [Black: 313#(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|)), 104#L104true, 1135#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), 103#L149-2true, Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 2421#(<= (+ 1 ~q2_front~0) ~q2_back~0), 179#L114-1true, 141#L80true, Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:24,124 INFO L383 tUnfolder$Statistics]: this new event has 208 ancestors and is cut-off event [2022-11-02 20:19:24,124 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-02 20:19:24,124 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-02 20:19:24,124 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-02 20:19:24,126 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L74-->L80: Formula: (let ((.cse0 (select (select |v_#memory_int_94| v_~f~0.base_46) (+ v_~f~0.offset_46 (* v_~j~0_46 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< v_~q2_back~0_68 2147483647) 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|) (not (= (ite (and (<= 0 v_~q2_back~0_68) (< v_~q2_back~0_68 v_~n2~0_24)) 1 0) 0)) (= v_~q2_back~0_67 (+ v_~q2_back~0_68 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int_94| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* v_~q2_back~0_68 4)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)))) InVars {~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_94|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_68, ~f~0.offset=v_~f~0.offset_46} OutVars{~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, 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|, ~f~0.offset=v_~f~0.offset_46, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_94|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0][391], [Black: 313#(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|)), 20#L115true, 104#L104true, 1135#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), 103#L149-2true, Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 2421#(<= (+ 1 ~q2_front~0) ~q2_back~0), 141#L80true, Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:24,126 INFO L383 tUnfolder$Statistics]: this new event has 208 ancestors and is cut-off event [2022-11-02 20:19:24,126 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-02 20:19:24,126 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-02 20:19:24,126 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-02 20:19:24,154 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L74-->L80: Formula: (let ((.cse0 (select (select |v_#memory_int_94| v_~f~0.base_46) (+ v_~f~0.offset_46 (* v_~j~0_46 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< v_~q2_back~0_68 2147483647) 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|) (not (= (ite (and (<= 0 v_~q2_back~0_68) (< v_~q2_back~0_68 v_~n2~0_24)) 1 0) 0)) (= v_~q2_back~0_67 (+ v_~q2_back~0_68 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int_94| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* v_~q2_back~0_68 4)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)))) InVars {~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_94|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_68, ~f~0.offset=v_~f~0.offset_46} OutVars{~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, 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|, ~f~0.offset=v_~f~0.offset_46, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_94|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0][373], [Black: 313#(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|)), 2424#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 104#L104true, 1135#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 103#L149-2true, Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), 261#true, Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 120#L119true, 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 141#L80true, Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:24,155 INFO L383 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-11-02 20:19:24,155 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-02 20:19:24,155 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-02 20:19:24,155 INFO L386 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-11-02 20:19:24,262 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1002] L74-->L80: Formula: (let ((.cse0 (select (select |v_#memory_int_94| v_~f~0.base_46) (+ v_~f~0.offset_46 (* v_~j~0_46 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= (ite (< v_~q2_back~0_68 2147483647) 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|) (not (= (ite (and (<= 0 v_~q2_back~0_68) (< v_~q2_back~0_68 v_~n2~0_24)) 1 0) 0)) (= v_~q2_back~0_67 (+ v_~q2_back~0_68 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int_94| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* v_~q2_back~0_68 4)))) 0) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)))) InVars {~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_94|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_68, ~f~0.offset=v_~f~0.offset_46} OutVars{~j~0=v_~j~0_46, ~n2~0=v_~n2~0_24, ~f~0.base=v_~f~0.base_46, ~q2~0.offset=v_~q2~0.offset_35, 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|, ~f~0.offset=v_~f~0.offset_46, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_1|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, #memory_int=|v_#memory_int_94|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_back~0][391], [Black: 313#(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|)), 104#L104true, 1135#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 266#(= ~total~0 0), Black: 332#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1681#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1683#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 362#true, Black: 279#(<= ~q1_back~0 ~q1_front~0), 103#L149-2true, Black: 1675#(and (<= ~j~0 0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), Black: 1667#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (< ~j~0 ~N~0)) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (< ~j~0 ~N~0)) (<= ~j~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~j~0 ~N~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)))), Black: 1679#(and (or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))) (<= ~j~0 0) (< ~j~0 ~N~0)), Black: 1082#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))), Black: 284#(<= ~q2_back~0 ~q2_front~0), Black: 1086#(or (not (< ~q1_front~0 ~q1_back~0)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= 0 ~q1_front~0))), Black: 1671#(and (<= ~j~0 0) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0))) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (< ~j~0 ~N~0)), 261#true, 120#L119true, 2400#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 351#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 2404#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 1725#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 2277#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1))), Black: 2406#(and (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 296#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2408#(and (<= ~q1_front~0 ~q1_back~0) (or (and (not (< ~q2_front~0 ~q2_back~0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 0)) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 2402#(and (<= ~q1_front~0 ~q1_back~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), 2421#(<= (+ 1 ~q2_front~0) ~q2_back~0), 141#L80true, Black: 1704#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1712#(and (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 1714#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 1716#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))]) [2022-11-02 20:19:24,263 INFO L383 tUnfolder$Statistics]: this new event has 209 ancestors and is cut-off event [2022-11-02 20:19:24,263 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-02 20:19:24,263 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-02 20:19:24,263 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-02 20:19:24,982 INFO L130 PetriNetUnfolder]: 14169/27608 cut-off events. [2022-11-02 20:19:24,982 INFO L131 PetriNetUnfolder]: For 155352/157250 co-relation queries the response was YES. [2022-11-02 20:19:25,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109268 conditions, 27608 events. 14169/27608 cut-off events. For 155352/157250 co-relation queries the response was YES. Maximal size of possible extension queue 1709. Compared 271785 event pairs, 2043 based on Foata normal form. 732/25892 useless extension candidates. Maximal degree in co-relation 109235. Up to 7216 conditions per place. [2022-11-02 20:19:25,403 INFO L137 encePairwiseOnDemand]: 261/267 looper letters, 212 selfloop transitions, 33 changer transitions 0/480 dead transitions. [2022-11-02 20:19:25,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 480 transitions, 3476 flow [2022-11-02 20:19:25,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:19:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:19:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1433 transitions. [2022-11-02 20:19:25,409 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8945068664169787 [2022-11-02 20:19:25,409 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1433 transitions. [2022-11-02 20:19:25,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1433 transitions. [2022-11-02 20:19:25,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:19:25,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1433 transitions. [2022-11-02 20:19:25,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 238.83333333333334) internal successors, (1433), 6 states have internal predecessors, (1433), 0 states have call successors, (0), 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-02 20:19:25,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 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-02 20:19:25,417 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 0 states have call successors, (0), 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-02 20:19:25,418 INFO L175 Difference]: Start difference. First operand has 289 places, 322 transitions, 1514 flow. Second operand 6 states and 1433 transitions. [2022-11-02 20:19:25,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 480 transitions, 3476 flow [2022-11-02 20:19:25,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 480 transitions, 3429 flow, removed 23 selfloop flow, removed 1 redundant places. [2022-11-02 20:19:25,842 INFO L231 Difference]: Finished difference. Result has 297 places, 348 transitions, 1858 flow [2022-11-02 20:19:25,842 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1497, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1858, PETRI_PLACES=297, PETRI_TRANSITIONS=348} [2022-11-02 20:19:25,843 INFO L287 CegarLoopForPetriNet]: 241 programPoint places, 56 predicate places. [2022-11-02 20:19:25,844 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 348 transitions, 1858 flow [2022-11-02 20:19:25,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 232.8) internal successors, (1164), 5 states have internal predecessors, (1164), 0 states have call successors, (0), 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-02 20:19:25,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:25,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:19:25,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:19:25,845 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:19:25,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:25,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2129259181, now seen corresponding path program 2 times [2022-11-02 20:19:25,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:25,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891857351] [2022-11-02 20:19:25,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:25,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:19:26,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:26,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891857351] [2022-11-02 20:19:26,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891857351] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:19:26,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185093262] [2022-11-02 20:19:26,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:19:26,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:26,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:19:26,610 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:19:26,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:19:26,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:19:26,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:19:26,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:19:26,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:19:27,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:19:27,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:19:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:19:28,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185093262] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:19:28,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:19:28,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 9] total 23 [2022-11-02 20:19:28,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080998910] [2022-11-02 20:19:28,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:28,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:19:28,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:28,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:19:28,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:19:28,123 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 267 [2022-11-02 20:19:28,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 348 transitions, 1858 flow. Second operand has 10 states, 10 states have (on average 187.7) internal successors, (1877), 10 states have internal predecessors, (1877), 0 states have call successors, (0), 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-02 20:19:28,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:19:28,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 267 [2022-11-02 20:19:28,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:19:44,190 INFO L130 PetriNetUnfolder]: 37487/62578 cut-off events. [2022-11-02 20:19:44,190 INFO L131 PetriNetUnfolder]: For 372490/372502 co-relation queries the response was YES. [2022-11-02 20:19:44,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260274 conditions, 62578 events. 37487/62578 cut-off events. For 372490/372502 co-relation queries the response was YES. Maximal size of possible extension queue 3012. Compared 564463 event pairs, 2950 based on Foata normal form. 1339/63025 useless extension candidates. Maximal degree in co-relation 260237. Up to 25309 conditions per place. [2022-11-02 20:19:45,039 INFO L137 encePairwiseOnDemand]: 249/267 looper letters, 369 selfloop transitions, 67 changer transitions 0/596 dead transitions. [2022-11-02 20:19:45,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 596 transitions, 5045 flow [2022-11-02 20:19:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:19:45,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-02 20:19:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2862 transitions. [2022-11-02 20:19:45,048 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7146067415730337 [2022-11-02 20:19:45,048 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2862 transitions. [2022-11-02 20:19:45,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2862 transitions. [2022-11-02 20:19:45,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:19:45,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2862 transitions. [2022-11-02 20:19:45,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 190.8) internal successors, (2862), 15 states have internal predecessors, (2862), 0 states have call successors, (0), 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-02 20:19:45,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 267.0) internal successors, (4272), 16 states have internal predecessors, (4272), 0 states have call successors, (0), 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-02 20:19:45,065 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 267.0) internal successors, (4272), 16 states have internal predecessors, (4272), 0 states have call successors, (0), 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-02 20:19:45,066 INFO L175 Difference]: Start difference. First operand has 297 places, 348 transitions, 1858 flow. Second operand 15 states and 2862 transitions. [2022-11-02 20:19:45,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 596 transitions, 5045 flow [2022-11-02 20:19:45,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 596 transitions, 5028 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-11-02 20:19:45,790 INFO L231 Difference]: Finished difference. Result has 316 places, 387 transitions, 2517 flow [2022-11-02 20:19:45,791 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1847, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2517, PETRI_PLACES=316, PETRI_TRANSITIONS=387} [2022-11-02 20:19:45,791 INFO L287 CegarLoopForPetriNet]: 241 programPoint places, 75 predicate places. [2022-11-02 20:19:45,792 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 387 transitions, 2517 flow [2022-11-02 20:19:45,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 187.7) internal successors, (1877), 10 states have internal predecessors, (1877), 0 states have call successors, (0), 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-02 20:19:45,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:19:45,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:19:45,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:19:46,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:46,004 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:19:46,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:46,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1479612390, now seen corresponding path program 1 times [2022-11-02 20:19:46,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:46,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518181919] [2022-11-02 20:19:46,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:46,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:19:53,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:53,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518181919] [2022-11-02 20:19:53,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518181919] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:19:53,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115768321] [2022-11-02 20:19:53,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:53,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:53,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:19:53,694 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:19:53,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b52913-7d08-4845-b5ca-475722eb7669/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process