./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-send-receive.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_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/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_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/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_c05682c1-643c-44f2-9cb1-b91448f76153/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 238e609d3671ff2de494998b0abc6a14651375b5eb423e7b66fc3d987b466268 --- 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 21:04:47,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:04:47,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:04:47,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:04:47,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:04:47,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:04:47,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:04:47,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:04:47,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:04:47,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:04:47,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:04:47,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:04:47,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:04:47,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:04:47,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:04:47,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:04:47,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:04:47,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:04:47,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:04:47,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:04:47,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:04:47,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:04:47,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:04:47,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:04:47,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:04:47,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:04:47,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:04:47,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:04:47,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:04:47,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:04:47,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:04:47,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:04:47,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:04:47,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:04:47,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:04:47,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:04:47,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:04:47,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:04:47,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:04:47,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:04:47,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:04:47,761 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:04:47,784 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:04:47,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:04:47,785 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:04:47,785 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:04:47,785 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:04:47,786 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:04:47,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:04:47,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:04:47,787 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:04:47,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:04:47,787 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:04:47,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:04:47,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:04:47,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:04:47,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:04:47,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:04:47,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:04:47,788 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:04:47,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:04:47,789 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:04:47,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:04:47,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:04:47,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:04:47,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:04:47,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:04:47,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:04:47,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:04:47,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:04:47,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:04:47,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:04:47,791 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:04:47,791 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:04:47,791 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:04:47,791 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_c05682c1-643c-44f2-9cb1-b91448f76153/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_c05682c1-643c-44f2-9cb1-b91448f76153/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 -> 238e609d3671ff2de494998b0abc6a14651375b5eb423e7b66fc3d987b466268 [2022-11-02 21:04:48,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:04:48,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:04:48,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:04:48,139 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:04:48,140 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:04:48,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2022-11-02 21:04:48,226 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/data/7698a358b/c82da05915664e099d4772e2ea3a98e2/FLAG8f95fff02 [2022-11-02 21:04:48,763 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:04:48,767 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2022-11-02 21:04:48,776 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/data/7698a358b/c82da05915664e099d4772e2ea3a98e2/FLAG8f95fff02 [2022-11-02 21:04:49,105 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/data/7698a358b/c82da05915664e099d4772e2ea3a98e2 [2022-11-02 21:04:49,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:04:49,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:04:49,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:04:49,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:04:49,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:04:49,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:04:49" (1/1) ... [2022-11-02 21:04:49,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513ecd33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:49, skipping insertion in model container [2022-11-02 21:04:49,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:04:49" (1/1) ... [2022-11-02 21:04:49,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:04:49,144 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:04:49,374 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_c05682c1-643c-44f2-9cb1-b91448f76153/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c[3107,3120] [2022-11-02 21:04:49,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:04:49,408 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:04:49,464 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_c05682c1-643c-44f2-9cb1-b91448f76153/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c[3107,3120] [2022-11-02 21:04:49,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:04:49,492 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:04:49,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:49 WrapperNode [2022-11-02 21:04:49,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:04:49,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:04:49,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:04:49,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:04:49,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:49" (1/1) ... [2022-11-02 21:04:49,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:49" (1/1) ... [2022-11-02 21:04:49,563 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 161 [2022-11-02 21:04:49,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:04:49,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:04:49,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:04:49,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:04:49,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:49" (1/1) ... [2022-11-02 21:04:49,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:49" (1/1) ... [2022-11-02 21:04:49,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:49" (1/1) ... [2022-11-02 21:04:49,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:49" (1/1) ... [2022-11-02 21:04:49,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:49" (1/1) ... [2022-11-02 21:04:49,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:49" (1/1) ... [2022-11-02 21:04:49,600 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:49" (1/1) ... [2022-11-02 21:04:49,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:49" (1/1) ... [2022-11-02 21:04:49,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:04:49,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:04:49,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:04:49,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:04:49,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:49" (1/1) ... [2022-11-02 21:04:49,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:04:49,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:49,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:04:49,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:04:49,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:04:49,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:04:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:04:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:04:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 21:04:49,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 21:04:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 21:04:49,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 21:04:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 21:04:49,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 21:04:49,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:04:49,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 21:04:49,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 21:04:49,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:04:49,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:04:49,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:04:49,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:04:49,715 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 21:04:49,858 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:04:49,860 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:04:50,178 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:04:50,312 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:04:50,312 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 21:04:50,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:04:50 BoogieIcfgContainer [2022-11-02 21:04:50,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:04:50,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:04:50,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:04:50,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:04:50,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:04:49" (1/3) ... [2022-11-02 21:04:50,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5ffea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:04:50, skipping insertion in model container [2022-11-02 21:04:50,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:49" (2/3) ... [2022-11-02 21:04:50,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5ffea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:04:50, skipping insertion in model container [2022-11-02 21:04:50,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:04:50" (3/3) ... [2022-11-02 21:04:50,329 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2022-11-02 21:04:50,339 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 21:04:50,350 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:04:50,350 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:04:50,350 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 21:04:50,464 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 21:04:50,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 142 transitions, 308 flow [2022-11-02 21:04:50,568 INFO L130 PetriNetUnfolder]: 10/139 cut-off events. [2022-11-02 21:04:50,569 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 21:04:50,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 10/139 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2022-11-02 21:04:50,573 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 142 transitions, 308 flow [2022-11-02 21:04:50,578 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 128 transitions, 274 flow [2022-11-02 21:04:50,589 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:04:50,596 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;@3b45c388, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:04:50,596 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-02 21:04:50,640 INFO L130 PetriNetUnfolder]: 10/127 cut-off events. [2022-11-02 21:04:50,644 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 21:04:50,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:04:50,645 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] [2022-11-02 21:04:50,646 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:04:50,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:50,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1609197532, now seen corresponding path program 1 times [2022-11-02 21:04:50,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:50,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652367055] [2022-11-02 21:04:50,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:50,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:50,967 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 21:04:50,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:50,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652367055] [2022-11-02 21:04:50,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652367055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:50,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:50,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:04:50,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522479147] [2022-11-02 21:04:50,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:50,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:04:50,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:51,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:04:51,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:04:51,035 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 142 [2022-11-02 21:04:51,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 128 transitions, 274 flow. Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 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 21:04:51,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:04:51,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 142 [2022-11-02 21:04:51,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:04:51,136 INFO L130 PetriNetUnfolder]: 21/174 cut-off events. [2022-11-02 21:04:51,136 INFO L131 PetriNetUnfolder]: For 26/27 co-relation queries the response was YES. [2022-11-02 21:04:51,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 174 events. 21/174 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 303 event pairs, 7 based on Foata normal form. 20/176 useless extension candidates. Maximal degree in co-relation 141. Up to 33 conditions per place. [2022-11-02 21:04:51,139 INFO L137 encePairwiseOnDemand]: 136/142 looper letters, 9 selfloop transitions, 0 changer transitions 2/122 dead transitions. [2022-11-02 21:04:51,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 122 transitions, 280 flow [2022-11-02 21:04:51,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:04:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 21:04:51,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 267 transitions. [2022-11-02 21:04:51,154 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9401408450704225 [2022-11-02 21:04:51,155 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 267 transitions. [2022-11-02 21:04:51,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 267 transitions. [2022-11-02 21:04:51,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:04:51,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 267 transitions. [2022-11-02 21:04:51,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:51,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 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 21:04:51,169 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 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 21:04:51,171 INFO L175 Difference]: Start difference. First operand has 128 places, 128 transitions, 274 flow. Second operand 2 states and 267 transitions. [2022-11-02 21:04:51,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 122 transitions, 280 flow [2022-11-02 21:04:51,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 122 transitions, 268 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 21:04:51,180 INFO L231 Difference]: Finished difference. Result has 123 places, 120 transitions, 246 flow [2022-11-02 21:04:51,182 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=246, PETRI_PLACES=123, PETRI_TRANSITIONS=120} [2022-11-02 21:04:51,186 INFO L287 CegarLoopForPetriNet]: 128 programPoint places, -5 predicate places. [2022-11-02 21:04:51,186 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 120 transitions, 246 flow [2022-11-02 21:04:51,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 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 21:04:51,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:04:51,187 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] [2022-11-02 21:04:51,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:04:51,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:04:51,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:51,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2092863801, now seen corresponding path program 1 times [2022-11-02 21:04:51,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:51,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591501327] [2022-11-02 21:04:51,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:51,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:51,650 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 21:04:51,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:51,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591501327] [2022-11-02 21:04:51,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591501327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:51,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:51,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:51,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538773009] [2022-11-02 21:04:51,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:51,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:51,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:51,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:51,657 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 142 [2022-11-02 21:04:51,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 120 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 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 21:04:51,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:04:51,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 142 [2022-11-02 21:04:51,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:04:51,897 INFO L130 PetriNetUnfolder]: 98/367 cut-off events. [2022-11-02 21:04:51,897 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-02 21:04:51,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 367 events. 98/367 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1418 event pairs, 20 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 540. Up to 64 conditions per place. [2022-11-02 21:04:51,906 INFO L137 encePairwiseOnDemand]: 137/142 looper letters, 35 selfloop transitions, 5 changer transitions 0/142 dead transitions. [2022-11-02 21:04:51,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 142 transitions, 372 flow [2022-11-02 21:04:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:04:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:04:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2022-11-02 21:04:51,914 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8830985915492958 [2022-11-02 21:04:51,915 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2022-11-02 21:04:51,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2022-11-02 21:04:51,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:04:51,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2022-11-02 21:04:51,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 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 21:04:51,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 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 21:04:51,923 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 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 21:04:51,923 INFO L175 Difference]: Start difference. First operand has 123 places, 120 transitions, 246 flow. Second operand 5 states and 627 transitions. [2022-11-02 21:04:51,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 142 transitions, 372 flow [2022-11-02 21:04:51,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 142 transitions, 372 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 21:04:51,930 INFO L231 Difference]: Finished difference. Result has 128 places, 123 transitions, 277 flow [2022-11-02 21:04:51,930 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=128, PETRI_TRANSITIONS=123} [2022-11-02 21:04:51,931 INFO L287 CegarLoopForPetriNet]: 128 programPoint places, 0 predicate places. [2022-11-02 21:04:51,932 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 123 transitions, 277 flow [2022-11-02 21:04:51,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 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 21:04:51,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:04:51,933 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] [2022-11-02 21:04:51,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:04:51,934 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:04:51,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:51,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1525047151, now seen corresponding path program 2 times [2022-11-02 21:04:51,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:51,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623212963] [2022-11-02 21:04:51,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:51,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:52,203 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 21:04:52,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:52,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623212963] [2022-11-02 21:04:52,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623212963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:52,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:52,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:52,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491964963] [2022-11-02 21:04:52,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:52,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:52,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:52,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:52,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:52,207 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 142 [2022-11-02 21:04:52,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 123 transitions, 277 flow. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 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 21:04:52,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:04:52,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 142 [2022-11-02 21:04:52,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:04:52,412 INFO L130 PetriNetUnfolder]: 119/468 cut-off events. [2022-11-02 21:04:52,412 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2022-11-02 21:04:52,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 468 events. 119/468 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2220 event pairs, 16 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 775. Up to 79 conditions per place. [2022-11-02 21:04:52,418 INFO L137 encePairwiseOnDemand]: 137/142 looper letters, 36 selfloop transitions, 7 changer transitions 0/145 dead transitions. [2022-11-02 21:04:52,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 145 transitions, 431 flow [2022-11-02 21:04:52,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:04:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:04:52,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2022-11-02 21:04:52,422 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8816901408450705 [2022-11-02 21:04:52,422 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 626 transitions. [2022-11-02 21:04:52,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 626 transitions. [2022-11-02 21:04:52,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:04:52,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 626 transitions. [2022-11-02 21:04:52,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 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 21:04:52,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 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 21:04:52,428 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 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 21:04:52,428 INFO L175 Difference]: Start difference. First operand has 128 places, 123 transitions, 277 flow. Second operand 5 states and 626 transitions. [2022-11-02 21:04:52,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 145 transitions, 431 flow [2022-11-02 21:04:52,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 145 transitions, 426 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:04:52,438 INFO L231 Difference]: Finished difference. Result has 134 places, 127 transitions, 320 flow [2022-11-02 21:04:52,438 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=134, PETRI_TRANSITIONS=127} [2022-11-02 21:04:52,441 INFO L287 CegarLoopForPetriNet]: 128 programPoint places, 6 predicate places. [2022-11-02 21:04:52,441 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 127 transitions, 320 flow [2022-11-02 21:04:52,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 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 21:04:52,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:04:52,442 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] [2022-11-02 21:04:52,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:04:52,442 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:04:52,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:52,443 INFO L85 PathProgramCache]: Analyzing trace with hash -479802429, now seen corresponding path program 3 times [2022-11-02 21:04:52,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:52,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450388921] [2022-11-02 21:04:52,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:52,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:52,840 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 21:04:52,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:52,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450388921] [2022-11-02 21:04:52,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450388921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:52,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:52,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:04:52,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078486611] [2022-11-02 21:04:52,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:52,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:04:52,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:52,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:04:52,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:52,846 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 142 [2022-11-02 21:04:52,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 127 transitions, 320 flow. Second operand has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 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 21:04:52,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:04:52,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 142 [2022-11-02 21:04:52,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:04:53,100 INFO L130 PetriNetUnfolder]: 211/627 cut-off events. [2022-11-02 21:04:53,100 INFO L131 PetriNetUnfolder]: For 255/262 co-relation queries the response was YES. [2022-11-02 21:04:53,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1247 conditions, 627 events. 211/627 cut-off events. For 255/262 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3192 event pairs, 20 based on Foata normal form. 11/557 useless extension candidates. Maximal degree in co-relation 1237. Up to 122 conditions per place. [2022-11-02 21:04:53,105 INFO L137 encePairwiseOnDemand]: 135/142 looper letters, 43 selfloop transitions, 7 changer transitions 12/163 dead transitions. [2022-11-02 21:04:53,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 163 transitions, 575 flow [2022-11-02 21:04:53,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:04:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 21:04:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 863 transitions. [2022-11-02 21:04:53,108 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8682092555331992 [2022-11-02 21:04:53,108 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 863 transitions. [2022-11-02 21:04:53,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 863 transitions. [2022-11-02 21:04:53,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:04:53,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 863 transitions. [2022-11-02 21:04:53,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.28571428571429) internal successors, (863), 7 states have internal predecessors, (863), 0 states have call successors, (0), 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 21:04:53,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 142.0) internal successors, (1136), 8 states have internal predecessors, (1136), 0 states have call successors, (0), 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 21:04:53,114 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 142.0) internal successors, (1136), 8 states have internal predecessors, (1136), 0 states have call successors, (0), 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 21:04:53,114 INFO L175 Difference]: Start difference. First operand has 134 places, 127 transitions, 320 flow. Second operand 7 states and 863 transitions. [2022-11-02 21:04:53,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 163 transitions, 575 flow [2022-11-02 21:04:53,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 163 transitions, 566 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:04:53,119 INFO L231 Difference]: Finished difference. Result has 141 places, 125 transitions, 325 flow [2022-11-02 21:04:53,119 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=325, PETRI_PLACES=141, PETRI_TRANSITIONS=125} [2022-11-02 21:04:53,120 INFO L287 CegarLoopForPetriNet]: 128 programPoint places, 13 predicate places. [2022-11-02 21:04:53,120 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 125 transitions, 325 flow [2022-11-02 21:04:53,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 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 21:04:53,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:04:53,121 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] [2022-11-02 21:04:53,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:04:53,122 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:04:53,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:53,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1728744340, now seen corresponding path program 1 times [2022-11-02 21:04:53,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:53,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032095679] [2022-11-02 21:04:53,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:53,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:53,349 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 21:04:53,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:53,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032095679] [2022-11-02 21:04:53,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032095679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:53,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:53,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:04:53,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600345] [2022-11-02 21:04:53,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:53,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:53,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:53,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:53,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:53,354 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 142 [2022-11-02 21:04:53,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 125 transitions, 325 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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 21:04:53,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:04:53,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 142 [2022-11-02 21:04:53,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:04:53,444 INFO L130 PetriNetUnfolder]: 49/301 cut-off events. [2022-11-02 21:04:53,444 INFO L131 PetriNetUnfolder]: For 123/133 co-relation queries the response was YES. [2022-11-02 21:04:53,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 301 events. 49/301 cut-off events. For 123/133 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 925 event pairs, 9 based on Foata normal form. 13/288 useless extension candidates. Maximal degree in co-relation 499. Up to 70 conditions per place. [2022-11-02 21:04:53,447 INFO L137 encePairwiseOnDemand]: 138/142 looper letters, 16 selfloop transitions, 3 changer transitions 0/127 dead transitions. [2022-11-02 21:04:53,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 127 transitions, 357 flow [2022-11-02 21:04:53,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:04:53,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-11-02 21:04:53,449 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8967136150234741 [2022-11-02 21:04:53,449 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2022-11-02 21:04:53,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2022-11-02 21:04:53,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:04:53,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2022-11-02 21:04:53,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 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 21:04:53,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 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 21:04:53,453 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 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 21:04:53,453 INFO L175 Difference]: Start difference. First operand has 141 places, 125 transitions, 325 flow. Second operand 3 states and 382 transitions. [2022-11-02 21:04:53,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 127 transitions, 357 flow [2022-11-02 21:04:53,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 127 transitions, 333 flow, removed 1 selfloop flow, removed 11 redundant places. [2022-11-02 21:04:53,460 INFO L231 Difference]: Finished difference. Result has 133 places, 125 transitions, 305 flow [2022-11-02 21:04:53,461 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=305, PETRI_PLACES=133, PETRI_TRANSITIONS=125} [2022-11-02 21:04:53,464 INFO L287 CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places. [2022-11-02 21:04:53,464 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 125 transitions, 305 flow [2022-11-02 21:04:53,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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 21:04:53,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:04:53,465 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] [2022-11-02 21:04:53,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:04:53,465 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:04:53,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:53,466 INFO L85 PathProgramCache]: Analyzing trace with hash 767920314, now seen corresponding path program 1 times [2022-11-02 21:04:53,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:53,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965764686] [2022-11-02 21:04:53,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:53,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:53,617 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 21:04:53,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:53,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965764686] [2022-11-02 21:04:53,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965764686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:53,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:53,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:04:53,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593395256] [2022-11-02 21:04:53,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:53,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:53,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:53,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:53,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:53,622 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 142 [2022-11-02 21:04:53,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 125 transitions, 305 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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 21:04:53,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:04:53,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 142 [2022-11-02 21:04:53,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:04:53,704 INFO L130 PetriNetUnfolder]: 79/365 cut-off events. [2022-11-02 21:04:53,705 INFO L131 PetriNetUnfolder]: For 87/113 co-relation queries the response was YES. [2022-11-02 21:04:53,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 365 events. 79/365 cut-off events. For 87/113 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1397 event pairs, 9 based on Foata normal form. 16/353 useless extension candidates. Maximal degree in co-relation 648. Up to 114 conditions per place. [2022-11-02 21:04:53,708 INFO L137 encePairwiseOnDemand]: 139/142 looper letters, 19 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2022-11-02 21:04:53,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 130 transitions, 363 flow [2022-11-02 21:04:53,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:04:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2022-11-02 21:04:53,710 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9061032863849765 [2022-11-02 21:04:53,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2022-11-02 21:04:53,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2022-11-02 21:04:53,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:04:53,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2022-11-02 21:04:53,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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 21:04:53,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 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 21:04:53,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 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 21:04:53,715 INFO L175 Difference]: Start difference. First operand has 133 places, 125 transitions, 305 flow. Second operand 3 states and 386 transitions. [2022-11-02 21:04:53,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 130 transitions, 363 flow [2022-11-02 21:04:53,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 130 transitions, 361 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:04:53,719 INFO L231 Difference]: Finished difference. Result has 135 places, 125 transitions, 310 flow [2022-11-02 21:04:53,720 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=135, PETRI_TRANSITIONS=125} [2022-11-02 21:04:53,722 INFO L287 CegarLoopForPetriNet]: 128 programPoint places, 7 predicate places. [2022-11-02 21:04:53,722 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 125 transitions, 310 flow [2022-11-02 21:04:53,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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 21:04:53,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:04:53,723 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] [2022-11-02 21:04:53,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:04:53,724 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:04:53,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:53,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1397760906, now seen corresponding path program 1 times [2022-11-02 21:04:53,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:53,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651112671] [2022-11-02 21:04:53,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:53,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:54,085 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 21:04:54,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:54,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651112671] [2022-11-02 21:04:54,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651112671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:54,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:54,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:04:54,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138012874] [2022-11-02 21:04:54,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:54,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:04:54,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:54,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:04:54,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:04:54,096 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 142 [2022-11-02 21:04:54,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 125 transitions, 310 flow. Second operand has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 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 21:04:54,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:04:54,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 142 [2022-11-02 21:04:54,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:04:54,336 INFO L130 PetriNetUnfolder]: 60/412 cut-off events. [2022-11-02 21:04:54,336 INFO L131 PetriNetUnfolder]: For 108/138 co-relation queries the response was YES. [2022-11-02 21:04:54,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 412 events. 60/412 cut-off events. For 108/138 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1530 event pairs, 17 based on Foata normal form. 26/414 useless extension candidates. Maximal degree in co-relation 717. Up to 72 conditions per place. [2022-11-02 21:04:54,339 INFO L137 encePairwiseOnDemand]: 131/142 looper letters, 27 selfloop transitions, 9 changer transitions 8/139 dead transitions. [2022-11-02 21:04:54,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 139 transitions, 436 flow [2022-11-02 21:04:54,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:04:54,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 21:04:54,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1006 transitions. [2022-11-02 21:04:54,343 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7871674491392802 [2022-11-02 21:04:54,343 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1006 transitions. [2022-11-02 21:04:54,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1006 transitions. [2022-11-02 21:04:54,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:04:54,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1006 transitions. [2022-11-02 21:04:54,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 111.77777777777777) internal successors, (1006), 9 states have internal predecessors, (1006), 0 states have call successors, (0), 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 21:04:54,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 142.0) internal successors, (1420), 10 states have internal predecessors, (1420), 0 states have call successors, (0), 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 21:04:54,350 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 142.0) internal successors, (1420), 10 states have internal predecessors, (1420), 0 states have call successors, (0), 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 21:04:54,350 INFO L175 Difference]: Start difference. First operand has 135 places, 125 transitions, 310 flow. Second operand 9 states and 1006 transitions. [2022-11-02 21:04:54,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 139 transitions, 436 flow [2022-11-02 21:04:54,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 139 transitions, 434 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:04:54,354 INFO L231 Difference]: Finished difference. Result has 144 places, 126 transitions, 336 flow [2022-11-02 21:04:54,355 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=336, PETRI_PLACES=144, PETRI_TRANSITIONS=126} [2022-11-02 21:04:54,355 INFO L287 CegarLoopForPetriNet]: 128 programPoint places, 16 predicate places. [2022-11-02 21:04:54,355 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 126 transitions, 336 flow [2022-11-02 21:04:54,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 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 21:04:54,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:04:54,356 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] [2022-11-02 21:04:54,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:04:54,357 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:04:54,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:54,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2065619259, now seen corresponding path program 1 times [2022-11-02 21:04:54,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:54,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151767254] [2022-11-02 21:04:54,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:54,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:56,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:56,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151767254] [2022-11-02 21:04:56,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151767254] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:56,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515806539] [2022-11-02 21:04:56,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:56,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:56,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:56,980 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:57,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:04:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:57,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-02 21:04:57,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:57,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:04:57,257 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:04:57,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 21:04:57,342 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 21:04:57,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 22 [2022-11-02 21:04:58,091 INFO L356 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2022-11-02 21:04:58,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 25 [2022-11-02 21:04:58,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 21:04:59,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:04:59,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:04:59,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:04:59,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-02 21:04:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:59,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:02,627 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:02,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2022-11-02 21:05:02,647 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:02,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2636 treesize of output 2520 [2022-11-02 21:05:02,686 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:02,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2508 treesize of output 2136 [2022-11-02 21:05:02,728 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:02,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1602 treesize of output 1518 [2022-11-02 21:05:02,768 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:02,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2028 treesize of output 1848 [2022-11-02 21:05:03,663 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:03,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2022-11-02 21:05:03,684 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-02 21:05:03,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 644 treesize of output 616 [2022-11-02 21:05:03,711 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-02 21:05:03,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 612 treesize of output 568 [2022-11-02 21:05:03,738 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-02 21:05:03,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 564 treesize of output 472 [2022-11-02 21:05:03,764 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-02 21:05:03,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 468 treesize of output 448 [2022-11-02 21:05:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:05,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515806539] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:05,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:05,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 24] total 67 [2022-11-02 21:05:05,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541773438] [2022-11-02 21:05:05,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:05,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-02 21:05:05,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:05,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-02 21:05:05,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=685, Invalid=3603, Unknown=134, NotChecked=0, Total=4422 [2022-11-02 21:05:05,492 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 142 [2022-11-02 21:05:05,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 126 transitions, 336 flow. Second operand has 67 states, 67 states have (on average 59.6865671641791) internal successors, (3999), 67 states have internal predecessors, (3999), 0 states have call successors, (0), 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 21:05:05,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:05:05,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 142 [2022-11-02 21:05:05,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:05:16,034 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~front~0 4))) (let ((.cse10 (* c_~back~0 4)) (.cse13 (+ c_~queue~0.offset .cse9))) (let ((.cse0 (<= .cse13 0)) (.cse2 (= (select (select |c_#memory_int| c_~queue~0.base) .cse13) 1)) (.cse1 (not (= .cse13 0))) (.cse16 (= .cse9 .cse10)) (.cse3 (= c_~sum~0 0)) (.cse14 (+ c_~queue~0.offset .cse10)) (.cse4 (<= c_~n~0 c_~front~0)) (.cse11 (< c_~front~0 0))) (and .cse0 (or .cse1 (and .cse2 .cse3)) (<= 1 c_~sum~0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or .cse0 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 1))) (or .cse4 (let ((.cse7 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ (select .cse5 .cse6) c_~sum~0) 1) (not (= (select .cse5 .cse7) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse8 .cse7) 1)) (<= 0 (+ (select .cse8 .cse6) c_~sum~0))))))) .cse11) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse12 .cse13))) (not (= (select .cse12 .cse14) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (not (= (select .cse15 .cse14) 1)) (<= (+ c_~sum~0 (select .cse15 .cse13)) 1))))) .cse4 .cse11) (<= c_~v_assert~0 1) (or (and (or (not .cse2) .cse3) .cse16) .cse1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) .cse16) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 .cse11) (= c_~queue~0.offset 0) (or .cse4 (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse17 .cse13)) 1) (not (= (select .cse17 .cse14) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse18 .cse13))) (not (= (select .cse18 .cse14) 1)))))) .cse11) (<= 1 c_~v_assert~0) (or .cse4 (let ((.cse20 (+ .cse10 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse21 (+ .cse9 |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= (select .cse19 .cse20) 1)) (<= (+ c_~sum~0 (select .cse19 .cse21)) 1)))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= (select .cse22 .cse20) 1)) (<= 0 (+ c_~sum~0 (select .cse22 .cse21)))))))) .cse11) (<= c_~sum~0 1) (or (let ((.cse24 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse25 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= (+ c_~sum~0 (select .cse23 .cse24)) 1) (not (= (select .cse23 .cse25) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse26 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse26 .cse24))) (not (= (select .cse26 .cse25) 1))))))) .cse4 .cse11) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or .cse1 (and .cse16 .cse3)) (or (and (forall ((v_ArrVal_138 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (not (= (select .cse27 .cse14) 1)) (<= (+ c_~sum~0 (select .cse27 .cse13)) 1)))) (forall ((v_ArrVal_138 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (not (= (select .cse28 .cse14) 1)) (<= 0 (+ c_~sum~0 (select .cse28 .cse13))))))) .cse4 .cse11))))) is different from false [2022-11-02 21:05:16,269 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse16 (= .cse9 .cse10)) (.cse13 (+ c_~queue~0.offset .cse9))) (let ((.cse0 (<= .cse13 0)) (.cse2 (= (select (select |c_#memory_int| c_~queue~0.base) .cse13) 1)) (.cse1 (not (= .cse13 0))) (.cse3 (= c_~sum~0 0)) (.cse14 (+ c_~queue~0.offset .cse10)) (.cse17 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) .cse16)) (.cse4 (<= c_~n~0 c_~front~0)) (.cse11 (< c_~front~0 0))) (and .cse0 (or .cse1 (and .cse2 .cse3)) (<= 1 c_~sum~0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or .cse0 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 1))) (or .cse4 (let ((.cse7 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ (select .cse5 .cse6) c_~sum~0) 1) (not (= (select .cse5 .cse7) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse8 .cse7) 1)) (<= 0 (+ (select .cse8 .cse6) c_~sum~0))))))) .cse11) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse12 .cse13))) (not (= (select .cse12 .cse14) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (not (= (select .cse15 .cse14) 1)) (<= (+ c_~sum~0 (select .cse15 .cse13)) 1))))) .cse4 .cse11) (<= c_~v_assert~0 1) (or (and (or (not .cse2) .cse3) .cse16) .cse1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or .cse17 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 .cse11) (= c_~queue~0.offset 0) (or .cse4 (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse18 .cse13)) 1) (not (= (select .cse18 .cse14) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse19 .cse13))) (not (= (select .cse19 .cse14) 1)))))) .cse11) (<= 1 c_~v_assert~0) (or .cse4 (let ((.cse21 (+ .cse10 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse22 (+ .cse9 |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= (select .cse20 .cse21) 1)) (<= (+ c_~sum~0 (select .cse20 .cse22)) 1)))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= (select .cse23 .cse21) 1)) (<= 0 (+ c_~sum~0 (select .cse23 .cse22)))))))) .cse11) (or .cse17 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 .cse11) (<= c_~sum~0 1) (or (let ((.cse25 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse26 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= (+ c_~sum~0 (select .cse24 .cse25)) 1) (not (= (select .cse24 .cse26) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse27 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse27 .cse25))) (not (= (select .cse27 .cse26) 1))))))) .cse4 .cse11) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or .cse1 (and .cse16 .cse3)) (or (and (forall ((v_ArrVal_138 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (not (= (select .cse28 .cse14) 1)) (<= (+ c_~sum~0 (select .cse28 .cse13)) 1)))) (forall ((v_ArrVal_138 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (not (= (select .cse29 .cse14) 1)) (<= 0 (+ c_~sum~0 (select .cse29 .cse13))))))) .cse4 .cse11) (or .cse17 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_6| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_6|) 0))) .cse4 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse11))))) is different from false [2022-11-02 21:05:30,489 INFO L130 PetriNetUnfolder]: 17510/31213 cut-off events. [2022-11-02 21:05:30,490 INFO L131 PetriNetUnfolder]: For 19465/19465 co-relation queries the response was YES. [2022-11-02 21:05:30,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78545 conditions, 31213 events. 17510/31213 cut-off events. For 19465/19465 co-relation queries the response was YES. Maximal size of possible extension queue 1259. Compared 278904 event pairs, 691 based on Foata normal form. 790/31139 useless extension candidates. Maximal degree in co-relation 78532. Up to 3869 conditions per place. [2022-11-02 21:05:30,726 INFO L137 encePairwiseOnDemand]: 97/142 looper letters, 970 selfloop transitions, 324 changer transitions 347/1689 dead transitions. [2022-11-02 21:05:30,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 1689 transitions, 8748 flow [2022-11-02 21:05:30,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2022-11-02 21:05:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2022-11-02 21:05:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 10730 transitions. [2022-11-02 21:05:30,750 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.4722711267605634 [2022-11-02 21:05:30,751 INFO L72 ComplementDD]: Start complementDD. Operand 160 states and 10730 transitions. [2022-11-02 21:05:30,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 10730 transitions. [2022-11-02 21:05:30,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:05:30,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 160 states and 10730 transitions. [2022-11-02 21:05:30,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 161 states, 160 states have (on average 67.0625) internal successors, (10730), 160 states have internal predecessors, (10730), 0 states have call successors, (0), 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 21:05:30,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 161 states, 161 states have (on average 142.0) internal successors, (22862), 161 states have internal predecessors, (22862), 0 states have call successors, (0), 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 21:05:30,822 INFO L81 ComplementDD]: Finished complementDD. Result has 161 states, 161 states have (on average 142.0) internal successors, (22862), 161 states have internal predecessors, (22862), 0 states have call successors, (0), 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 21:05:30,822 INFO L175 Difference]: Start difference. First operand has 144 places, 126 transitions, 336 flow. Second operand 160 states and 10730 transitions. [2022-11-02 21:05:30,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 1689 transitions, 8748 flow [2022-11-02 21:05:30,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 1689 transitions, 8724 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-11-02 21:05:30,864 INFO L231 Difference]: Finished difference. Result has 416 places, 534 transitions, 3625 flow [2022-11-02 21:05:30,864 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=160, PETRI_FLOW=3625, PETRI_PLACES=416, PETRI_TRANSITIONS=534} [2022-11-02 21:05:30,865 INFO L287 CegarLoopForPetriNet]: 128 programPoint places, 288 predicate places. [2022-11-02 21:05:30,865 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 534 transitions, 3625 flow [2022-11-02 21:05:30,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 59.6865671641791) internal successors, (3999), 67 states have internal predecessors, (3999), 0 states have call successors, (0), 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 21:05:30,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:05:30,867 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] [2022-11-02 21:05:30,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 21:05:31,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:31,082 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:05:31,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:31,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1887491297, now seen corresponding path program 2 times [2022-11-02 21:05:31,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:31,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545841728] [2022-11-02 21:05:31,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:31,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:05:31,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:31,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545841728] [2022-11-02 21:05:31,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545841728] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:31,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584510482] [2022-11-02 21:05:31,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:05:31,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:31,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:31,986 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:32,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:05:32,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:05:32,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:05:32,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-02 21:05:32,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:32,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 21:05:33,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:05:33,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:05:33,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:33,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 21:05:34,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-02 21:05:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:34,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:34,370 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (< c_~front~0 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_175 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_175 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~queue~0.base) .cse0))))))) is different from false [2022-11-02 21:05:34,478 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (< c_~front~0 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_175 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_175 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~queue~0.base) .cse0)))))) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) is different from false [2022-11-02 21:05:34,879 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_174 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174))) (or (not (= (select (select .cse0 c_~queue~0.base) .cse1) 1)) (forall ((v_ArrVal_175 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~queue~0.base) .cse2))))))) (forall ((v_ArrVal_174 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174))) (or (not (= (select (select .cse3 c_~queue~0.base) .cse1) 1)) (forall ((v_ArrVal_175 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~queue~0.base) .cse2)) 1))))))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-11-02 21:05:35,027 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174))) (or (forall ((v_ArrVal_175 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~queue~0.base) .cse1)) 1)) (not (= (select (select .cse0 c_~queue~0.base) .cse2) 1))))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174))) (or (not (= (select (select .cse3 c_~queue~0.base) .cse2) 1)) (forall ((v_ArrVal_175 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~queue~0.base) .cse1))))))))) (< c_~front~0 0)) is different from false [2022-11-02 21:05:35,147 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (< c_~front~0 0) (let ((.cse1 (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse2 (+ (* c_~back~0 4) |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174))) (or (forall ((v_ArrVal_175 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse1)) 1)) (not (= (select (select .cse0 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse2) 1))))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174))) (or (forall ((v_ArrVal_175 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse1)))) (not (= (select (select .cse3 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse2) 1)))))))) is different from false [2022-11-02 21:05:35,215 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse2 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse1 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174))) (or (forall ((v_ArrVal_175 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse1)) 1)) (not (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse2) 1))))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174))) (or (not (= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse2) 1)) (forall ((v_ArrVal_175 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse1))))))))) (< c_~front~0 0)) is different from false [2022-11-02 21:05:35,250 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_175 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse2))))))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174))) (or (forall ((v_ArrVal_175 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse2)) 1)) (not (= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 1))))))) (< c_~front~0 0)) is different from false [2022-11-02 21:05:35,283 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_175 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse2))))))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174))) (or (forall ((v_ArrVal_175 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse2)) 1)) (not (= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 1))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< c_~front~0 0)) is different from false [2022-11-02 21:05:35,499 WARN L833 $PredicateComparison]: unable to prove that (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~n~0 c_~front~0) (let ((.cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_175 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse2))))))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174))) (or (forall ((v_ArrVal_175 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse2)) 1)) (not (= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 1))))))) (< c_~front~0 0)) is different from false [2022-11-02 21:05:35,552 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:35,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2022-11-02 21:05:35,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:35,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1504 treesize of output 1436 [2022-11-02 21:05:35,595 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:35,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 782 treesize of output 734 [2022-11-02 21:05:35,620 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:35,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1364 treesize of output 1256 [2022-11-02 21:05:35,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1142 treesize of output 950 [2022-11-02 21:05:36,800 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:36,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2022-11-02 21:05:36,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:36,815 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-02 21:05:36,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 136 [2022-11-02 21:05:36,831 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-02 21:05:36,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 112 [2022-11-02 21:05:36,846 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-02 21:05:36,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 75 [2022-11-02 21:05:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:05:37,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584510482] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:37,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:37,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 25] total 59 [2022-11-02 21:05:37,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886160062] [2022-11-02 21:05:37,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:37,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-02 21:05:37,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:37,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-02 21:05:37,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=2171, Unknown=21, NotChecked=936, Total=3422 [2022-11-02 21:05:37,807 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 142 [2022-11-02 21:05:37,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 534 transitions, 3625 flow. Second operand has 59 states, 59 states have (on average 64.72881355932203) internal successors, (3819), 59 states have internal predecessors, (3819), 0 states have call successors, (0), 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 21:05:37,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:05:37,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 142 [2022-11-02 21:05:37,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:02,812 INFO L130 PetriNetUnfolder]: 24661/47592 cut-off events. [2022-11-02 21:06:02,812 INFO L131 PetriNetUnfolder]: For 3482354/3486084 co-relation queries the response was YES. [2022-11-02 21:06:04,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353806 conditions, 47592 events. 24661/47592 cut-off events. For 3482354/3486084 co-relation queries the response was YES. Maximal size of possible extension queue 2039. Compared 491471 event pairs, 3586 based on Foata normal form. 1567/48358 useless extension candidates. Maximal degree in co-relation 353675. Up to 19794 conditions per place. [2022-11-02 21:06:04,674 INFO L137 encePairwiseOnDemand]: 109/142 looper letters, 767 selfloop transitions, 396 changer transitions 314/1555 dead transitions. [2022-11-02 21:06:04,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 1555 transitions, 15967 flow [2022-11-02 21:06:04,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-02 21:06:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-11-02 21:06:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 3669 transitions. [2022-11-02 21:06:04,692 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.48750996545309594 [2022-11-02 21:06:04,693 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 3669 transitions. [2022-11-02 21:06:04,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 3669 transitions. [2022-11-02 21:06:04,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:04,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 3669 transitions. [2022-11-02 21:06:04,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 69.22641509433963) internal successors, (3669), 53 states have internal predecessors, (3669), 0 states have call successors, (0), 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 21:06:04,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 142.0) internal successors, (7668), 54 states have internal predecessors, (7668), 0 states have call successors, (0), 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 21:06:04,721 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 142.0) internal successors, (7668), 54 states have internal predecessors, (7668), 0 states have call successors, (0), 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 21:06:04,721 INFO L175 Difference]: Start difference. First operand has 416 places, 534 transitions, 3625 flow. Second operand 53 states and 3669 transitions. [2022-11-02 21:06:04,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 1555 transitions, 15967 flow [2022-11-02 21:06:41,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 1555 transitions, 14796 flow, removed 559 selfloop flow, removed 42 redundant places. [2022-11-02 21:06:41,461 INFO L231 Difference]: Finished difference. Result has 414 places, 790 transitions, 7192 flow [2022-11-02 21:06:41,462 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=3262, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=7192, PETRI_PLACES=414, PETRI_TRANSITIONS=790} [2022-11-02 21:06:41,462 INFO L287 CegarLoopForPetriNet]: 128 programPoint places, 286 predicate places. [2022-11-02 21:06:41,463 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 790 transitions, 7192 flow [2022-11-02 21:06:41,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 64.72881355932203) internal successors, (3819), 59 states have internal predecessors, (3819), 0 states have call successors, (0), 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 21:06:41,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:06:41,464 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:06:41,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:06:41,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c05682c1-643c-44f2-9cb1-b91448f76153/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-02 21:06:41,665 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 21:06:41,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:41,666 INFO L85 PathProgramCache]: Analyzing trace with hash -492120468, now seen corresponding path program 3 times [2022-11-02 21:06:41,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:41,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188629938] [2022-11-02 21:06:41,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:41,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:06:41,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:41,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188629938] [2022-11-02 21:06:41,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188629938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:41,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:41,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:06:41,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340559632] [2022-11-02 21:06:41,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:41,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:06:41,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:41,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:06:41,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:06:41,890 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 142 [2022-11-02 21:06:41,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 790 transitions, 7192 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:06:41,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:06:41,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 142 [2022-11-02 21:06:41,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:06:49,958 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L59-->L51-1: Formula: (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_3| 256) 0) InVars {thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_3|} OutVars{thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_3|} AuxVars[] AssignedVars[][345], [Black: 1159#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (or (<= ~n~0 ~back~0) (not (<= 0 ~back~0))) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (= ~queue~0.offset 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (= (* ~front~0 4) (* ~back~0 4)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0))), Black: 815#(or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)), Black: 1225#(and (<= 0 ~sum~0) (<= ~sum~0 1) (not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0))), Black: 1086#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (<= (+ ~sum~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 1))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (<= 0 (+ ~sum~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (<= (+ ~sum~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) 1) (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (<= 0 (+ ~sum~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (or (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (<= 0 (+ ~sum~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| (* ~front~0 4))))) (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| (* ~back~0 4))) 1)))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| (* ~front~0 4)))) 1)))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (= (* ~front~0 4) (* ~back~0 4)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= ~sum~0 1) (or (<= ~n~0 ~front~0) (< ~front~0 0) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (or (<= (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (or (<= 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))))) (or (and (= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (or (<= ~n~0 ~front~0) (and (forall ((v_ArrVal_138 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (forall ((v_ArrVal_138 (Array Int Int))) (or (<= (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (or (<= ~n~0 ~front~0) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (<= (+ ~sum~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (<= 1 ~sum~0)), 18#L113-1true, Black: 632#(not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)), Black: 1138#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0))), Black: 1024#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~v_assert~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~v_assert~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ ~front~0 ~n~0) (+ ~back~0 (* 1073741824 (div (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 4294967296)) 1)) (= ~sum~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |thread2Thread1of1ForFork2_~b~0#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1006#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~v_assert~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~v_assert~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (<= (+ ~front~0 ~n~0) (+ ~back~0 (* 1073741824 (div (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 4294967296)) 1)) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1014#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~v_assert~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~v_assert~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ ~front~0 ~n~0) (+ ~back~0 (* 1073741824 (div (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 4294967296)) 1)) (= ~sum~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1098#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 1088#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0))), Black: 1136#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (or (<= ~n~0 ~back~0) (not (<= 0 ~back~0))) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (= ~queue~0.offset 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (= (* ~front~0 4) (* ~back~0 4)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)))), Black: 1231#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~sum~0 1) (<= 1 ~sum~0)), Black: 1066#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~sum~0 1) (or (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (<= 1 ~sum~0)), Black: 1052#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~sum~0 1) (or (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)) (<= 1 ~sum~0)), Black: 1175#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (= (* ~front~0 4) (* ~back~0 4)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 1261#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~sum~0 1) (not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)) (<= 1 ~sum~0)), Black: 1219#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= ~queue~0.offset 0) (not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 1134#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (= (* ~front~0 4) (* ~back~0 4)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 1149#(and (or (and (or (<= ~n~0 ~back~0) (not (<= 0 ~back~0))) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (= ~queue~0.offset 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (= (* ~front~0 4) (* ~back~0 4)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)))), Black: 1163#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= ~sum~0 1) (<= 1 ~sum~0)), Black: 1151#(and (not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0))), Black: 1056#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= ~sum~0 1)), Black: 683#(or (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)), Black: 1092#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (<= (+ ~sum~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 1))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (<= 0 (+ ~sum~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (<= (+ ~sum~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) 1) (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (<= 0 (+ ~sum~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (or (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (<= 0 (+ ~sum~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| (* ~front~0 4))))) (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| (* ~back~0 4))) 1)))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| (* ~front~0 4)))) 1)))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (= (* ~front~0 4) (* ~back~0 4)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= ~sum~0 1) (or (<= ~n~0 ~front~0) (< ~front~0 0) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (or (<= (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (or (<= 0 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))))) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_6| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_6|) 0))) (<= ~n~0 ~front~0) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~front~0 0)) (or (and (= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (or (<= ~n~0 ~front~0) (and (forall ((v_ArrVal_138 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (forall ((v_ArrVal_138 (Array Int Int))) (or (<= (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (or (<= ~n~0 ~front~0) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (or (<= (+ ~sum~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 ~sum~0)), Black: 1167#(and (<= 0 ~sum~0) (<= ~sum~0 1) (not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0))), Black: 1217#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= ~sum~0 1) (<= 1 ~sum~0)), Black: 1183#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0))), 9#L37-1true, Black: 1141#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0))), Black: 235#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 1076#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (or (<= ~n~0 ~back~0) (not (<= 0 ~back~0))) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (and (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (= (* ~front~0 4) (* ~back~0 4)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= ~sum~0 1)), Black: 1072#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 2249#(and (or (<= ~n~0 ~front~0) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)) (or (< 0 ~front~0) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 234#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 1118#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0))), Black: 1080#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~sum~0 1) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (<= 1 ~sum~0)), Black: 1233#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= ~sum~0 1) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)) (<= 1 ~sum~0)), Black: 1004#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~v_assert~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~v_assert~0 1) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 (* 1073741824 (div (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 4294967296)) 1)) (< 0 (+ (div (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 4294967296) 1))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1193#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0))), Black: 1114#(and (<= ~sum~0 1) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)) (<= 1 ~sum~0)), Black: 1122#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0))), Black: 1106#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (or (<= ~n~0 ~back~0) (not (<= 0 ~back~0))) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (= ~queue~0.offset 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (= (* ~front~0 4) (* ~back~0 4)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)))), Black: 1241#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0))), Black: 1054#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~sum~0 1) (<= 1 ~sum~0)), Black: 998#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~v_assert~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~v_assert~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 (* 1073741824 (div (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 4294967296)) 1)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| (+ (* 1073741824 (div (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 4294967296)) 1073741822))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1030#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~v_assert~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~v_assert~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ ~front~0 ~n~0) (+ ~back~0 (* 1073741824 (div (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 4294967296)) 1)) (= ~sum~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |thread2Thread1of1ForFork2_~b~0#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1128#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= ~sum~0 1) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 1074#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~sum~0 1) (or (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)) (or (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (<= 1 ~sum~0) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0))), Black: 1090#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 1010#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~v_assert~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~v_assert~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret9#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ ~front~0 ~n~0) (+ ~back~0 (* 1073741824 (div (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 4294967296)) 1)) (not (= |ULTIMATE.start_main_#t~ret9#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (not (= |ULTIMATE.start_main_#t~ret9#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= |ULTIMATE.start_main_#t~ret9#1.offset| 0)), Black: 1104#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (= (* ~front~0 4) (* ~back~0 4)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= ~sum~0 1) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 1070#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= ~sum~0 1)), Black: 1082#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~sum~0 1) (or (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (<= 1 ~sum~0) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0))), Black: 1187#(and (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (= (* ~front~0 4) (* ~back~0 4)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 1177#(and (or (and (or (<= ~n~0 ~back~0) (not (<= 0 ~back~0))) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (= ~queue~0.offset 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (= (* ~front~0 4) (* ~back~0 4)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0))), Black: 1161#(and (<= ~sum~0 1) (not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 1 ~sum~0)), 145#true, Black: 1239#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~sum~0 1) (not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 1 ~sum~0)), Black: 1094#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (or (<= ~n~0 ~back~0) (not (<= 0 ~back~0))) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (and (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (= (* ~front~0 4) (* ~back~0 4)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= ~sum~0 1) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0))), Black: 1012#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~v_assert~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~v_assert~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret9#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ ~front~0 ~n~0) (+ ~back~0 (* 1073741824 (div (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 4294967296)) 1)) (not (= |ULTIMATE.start_main_#t~ret9#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~sum~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret9#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= |ULTIMATE.start_main_#t~ret9#1.offset| 0)), Black: 1124#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~sum~0 1) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)) (<= 1 ~sum~0)), Black: 1120#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (or (<= ~n~0 ~back~0) (not (<= 0 ~back~0))) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (= ~queue~0.offset 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (= (* ~front~0 4) (* ~back~0 4)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0))), Black: 1189#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 1223#(and (<= ~sum~0 1) (not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)) (<= 1 ~sum~0)), Black: 233#(and (<= ~sum~0 1) (<= 1 ~sum~0)), 208#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1016#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~v_assert~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~v_assert~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ ~front~0 ~n~0) (+ ~back~0 (* 1073741824 (div (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 4294967296)) 1)) (= ~sum~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1145#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0))), Black: 1199#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 1126#(and (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0))), Black: 1143#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= ~sum~0 1) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0))), Black: 1060#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~sum~0 1) (or (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)) (or (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (<= 1 ~sum~0)), Black: 232#(and (or (and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= ~queue~0.offset 0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 1034#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~v_assert~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~v_assert~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ ~front~0 ~n~0) (+ ~back~0 (* 1073741824 (div (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 4294967296)) 1)) (= ~sum~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |thread2Thread1of1ForFork2_~b~0#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1155#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0))), Black: 1026#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~v_assert~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~v_assert~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ ~front~0 ~n~0) (+ ~back~0 (* 1073741824 (div (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 4294967296)) 1)) (= ~sum~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |thread2Thread1of1ForFork2_~b~0#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1165#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 1112#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= ~sum~0 1) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0))), Black: 1100#(and (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (= ~queue~0.offset 0) (or (and (= (* ~front~0 4) (* ~back~0 4)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0))), Black: 1002#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~v_assert~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~v_assert~0 1) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 (* 1073741824 (div (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 4294967296)) 1)) (< 0 (+ (div (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 4294967296) 1))) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post20#1| 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1028#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~v_assert~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~v_assert~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ ~front~0 ~n~0) (+ ~back~0 (* 1073741824 (div (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 4294967296)) 1)) (= ~sum~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |thread2Thread1of1ForFork2_~b~0#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 212#true, 161#(= |thread2Thread1of1ForFork2_~cond~1#1| 1), Black: 151#(= |thread1Thread1of1ForFork1_~cond~0#1| 1), Black: 153#(and (= ~v_assert~0 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 72#L51-1true, Black: 163#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 176#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= ~sum~0 0)), Black: 184#(<= ~back~0 ~front~0), Black: 189#(= |thread2Thread1of1ForFork2_~b~0#1| 1), Black: 204#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (not (<= 0 ~front~0))) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2257#(and (or (< 0 ~front~0) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 2247#(and (or (<= ~n~0 ~front~0) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)) (or (< 0 ~front~0) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 1818#(not (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)), Black: 2251#(and (or (<= ~n~0 ~front~0) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)) (or (< 0 ~front~0) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (not (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0))), Black: 2228#(and (<= 0 ~sum~0) (or (<= ~n~0 ~front~0) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)) (or (< 0 ~front~0) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= |thread1Thread1of1ForFork1_~cond~0#1| 1) (<= ~sum~0 1)), 1096#(and (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 2245#(and (or (< 0 ~front~0) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 2259#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 1724#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 2050#(or (< 0 ~front~0) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)), Black: 2224#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (= ~sum~0 1) (or (< 0 ~front~0) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= |thread1Thread1of1ForFork1_~cond~0#1| 1) (or (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~front~0 0))), Black: 2254#(and (<= 0 ~sum~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= |thread1Thread1of1ForFork1_~cond~0#1| 1) (<= ~sum~0 1)), Black: 2226#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (= ~sum~0 1) (or (< 0 ~front~0) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= |thread1Thread1of1ForFork1_~cond~0#1| 1) (or (<= ~n~0 ~front~0) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~front~0 0))), Black: 2261#(and (or (< 0 ~front~0) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)) (not (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0))), Black: 1385#true, Black: 2241#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (= ~sum~0 1) (or (< 0 ~front~0) (< ~front~0 0)) (<= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 2239#(and (or (<= ~n~0 ~front~0) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)) (or (< 0 ~front~0) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4))) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 1259#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= ~sum~0 1) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)) (<= 1 ~sum~0)), 34#L95true, Black: 1211#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= ~queue~0.offset 0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 1130#(and (or (and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= ~queue~0.offset 0) (not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 996#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~v_assert~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~v_assert~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1008#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~v_assert~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~v_assert~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ ~front~0 ~n~0) (+ ~back~0 (* 1073741824 (div (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 4294967296)) 1)) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1153#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0))), Black: 1032#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~v_assert~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~v_assert~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ ~front~0 ~n~0) (+ ~back~0 (* 1073741824 (div (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4) 4294967296)) 1)) (= ~sum~0 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |thread2Thread1of1ForFork2_~b~0#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (or (= |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1064#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 2280#true, Black: 679#(and (<= 0 ~sum~0) (<= ~sum~0 1)), Black: 1110#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 1068#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 231#(and (= ~queue~0.offset 0) (or (and (= (* ~front~0 4) (* ~back~0 4)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 1147#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork2_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (and (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (< ~front~0 0)))]) [2022-11-02 21:06:49,963 INFO L383 tUnfolder$Statistics]: this new event has 127 ancestors and is cut-off event [2022-11-02 21:06:49,964 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-02 21:06:49,964 INFO L386 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-11-02 21:06:49,964 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-02 21:06:54,044 INFO L130 PetriNetUnfolder]: 13559/33623 cut-off events. [2022-11-02 21:06:54,044 INFO L131 PetriNetUnfolder]: For 1488138/1498467 co-relation queries the response was YES. [2022-11-02 21:06:54,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246596 conditions, 33623 events. 13559/33623 cut-off events. For 1488138/1498467 co-relation queries the response was YES. Maximal size of possible extension queue 1339. Compared 385675 event pairs, 5387 based on Foata normal form. 1909/33752 useless extension candidates. Maximal degree in co-relation 246475. Up to 13602 conditions per place. [2022-11-02 21:06:55,168 INFO L137 encePairwiseOnDemand]: 138/142 looper letters, 426 selfloop transitions, 316 changer transitions 0/1121 dead transitions. [2022-11-02 21:06:55,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 1121 transitions, 12015 flow [2022-11-02 21:06:55,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:06:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 21:06:55,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2022-11-02 21:06:55,178 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9049295774647887 [2022-11-02 21:06:55,179 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2022-11-02 21:06:55,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2022-11-02 21:06:55,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:06:55,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2022-11-02 21:06:55,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 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 21:06:55,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 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 21:06:55,183 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 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 21:06:55,183 INFO L175 Difference]: Start difference. First operand has 414 places, 790 transitions, 7192 flow. Second operand 4 states and 514 transitions. [2022-11-02 21:06:55,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 1121 transitions, 12015 flow